Some solutions are still missing, and you are welcome to fill them if you wish ! Just send a message on Discord !
No solution yet
Not yet available
No solution yet
Not yet available
Statement looks complicated at first glance
No solution yet
Not yet available
The idea is that the number of that we try to minimize is a function of the sizes of connected components and therefore we can compute some information about the vertices in one traversal (classic) and greedily get the most risky node and then get the amount of links that will be severed
We struggled a lot on this dp but in the end the idea is just the natural dp
No solution yet
Not yet available
No solution yet
Not yet available
It was really hard to understand the statement, and then we spent a lot of time debugging so I have bad memories of this one
No solution yet
Not yet available
No solution yet
Not yet available