
Some help for others:
Input #1:
Code: Select all
1
A B C
A<B B<C C<A
Code: Select all
NO
Code: Select all
1
A B
A<B B<A
Code: Select all
NO
Code: Select all
1
A B C
A<B B<C C<A
Code: Select all
NO
Code: Select all
1
A B
A<B B<A
Code: Select all
NO
brianfry713 wrote:My C++ code that got AC in 0.752 sec I rewrote in JAVA and got TLE.
Shafaet_du wrote:Whats wrong with problem description? just add the costs of first N-1 inputs,and thats the first output. find MST of last K+M inputs,thats the 2nd output.
thank you very much! Ill try with this ...brianfry713 wrote:Your input is not valid. The malls do not intersect, even in one point. I tested the judge's input.