My submission https://codeforces.com/gym/101991/submission/61462281

Ideone link : http://ideone.com/Xj7jgc

for problem https://codeforces.com/gym/101991/problem/E

gives -> Diagnostics detected issues [cpp.clang++-diagnose]: ================================================================= ==2408==ERROR: AddressSanitizer: stack-overflow on address 0x00d72000 (pc 0x002f5149 bp 0x10d6fca4 sp 0x10d6f838 T0)

#0 0x2f5148 in _chkstk f:\dd\vctools\crt\vcstartup\src\misc\i386\chkstk.asm:98

#1 0x2f546f in __scrt_common_main_seh f:\dd\vctools\crt\vcstartup\src\startup\exe_common.inl:283

#2 0x7705343c in BaseThreadInitThunk+0x11 (C:\Windows\syswow64\kernel32.dll+0x1343c)

#3 0x77709831 in RtlInitializeExceptionChain+0x62 (C:\Windows\SysWOW64\ntdll.dll+0x39831)

#4 0x77709804 in RtlInitializeExceptionChain+0x35 (C:\Windows\SysWOW64\ntdll.dll+0x39804)

SUMMARY: AddressSanitizer: stack-overflow f:\dd\vctools\crt\vcstartup\src\misc\i386\chkstk.asm:98 in _chkstk =="2408"==aborting -----------------------------------------------------------------------------------------------------------

I just learnt aho-corasick and implemented it but,I am not able to understand what this diagnostics mean, please help. Thanks!

There are so many different ways one can implement Dinic's, i have come across

1-> **EV^2** - https://github.com/PetarV-/Algorithms/blob/master/Graph%20Algorithms/Dinic%27s%20Algorithm.cpp
2-> **EV*log(maximum edge capcity)** -https://github.com/ADJA/algos/blob/master/Graphs/Dinic.cpp
3-> **EV*log(V)** - http://www.cs.tau.ac.il/~haimk/adv-alg-2013/dinic2013.pdf

Can anyone tell about or suggest some good tutorials where i can learn any of the following ->
1-> proof of Dinics
2-> proof of its timecomplexity (1st and 2nd types)
3-> implementation of third type(EVlog(V))
4-> proof of 2nd type