Fygon 2.0 (NEERC 2017-2018) — Need help understanding Russian tutorial

Revision en4, by pabloskimg, 2020-08-11 21:56:58

I was trying to solve problem Fygon 2.0 from ICPC 2017–2018, NEERC, Northern Subregional Contest, but I couldn't come up with a solution, so I decided to check out this tutorial. Unfortunately, the tutorial is in Russian and the explanation is quite short and is probably omitting a lot of details. Using google translate I managed to understand that we should build a DAG where nodes represent the variables in the nested for loops and the edges represent inequalities between variables, but I don't understand how you can compute $$$C$$$ and $$$k$$$ from that. Any help is appreciated. Thanks in advance.

Tags neerc 2017-2018


  Rev. Lang. By When Δ Comment
en4 English pabloskimg 2020-08-11 21:56:58 5 Tiny change: 'tely, the editorial is ' -> 'tely, the tutorial is '
en3 English pabloskimg 2020-08-11 21:56:33 10 Tiny change: 'out [this editorial](ht' -> 'out [this tutorial](ht'
en2 English pabloskimg 2020-08-11 21:55:14 3
en1 English pabloskimg 2020-08-11 21:54:47 864 Initial revision (published)