Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

AtCoder Regular Contest 085 Problem E

Revision en1, by mochow, 2017-11-13 05:22:41

Can anyone explain the intuition behind the min-cut solution of the problem of the last ARC problem E? The editorial explains it but it does not explain the meaning of the taken steps.

The solution is quite fascinating but I cannot wrap my head around the complete idea.

Thanks in advance.

Tags atcoder, max-flow min-cut

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English mochow 2017-11-13 05:22:41 384 Initial revision (published)