Graph Problem

Revision en2, by satirmo, 2015-11-19 02:15:32

Hello all.

There was a problem from the ACM Greater NY Contest that my team was unable to solve. The problem statement can be found here. It is not mentioned in the problem statement, but K represents the current test case number, while N <= 600.

We feel that it can ultimately be reduced to a graph problem, but don't know how to go about doing so. Could you give me any hints on how to solve it?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English satirmo 2015-11-19 02:15:32 139
en1 English satirmo 2015-11-19 02:13:53 389 Initial revision (published)