Problem statement says "His friends write numbers from 1 to N on cards", but it doesn't mention that these numbers should be distinct. Yet, it seems like the problem only accepts solutions in which the numbers are distinct (i.e. the numbers on the N cards are a permutation of [1..N]).

A dozen of new tests has been added.
Time limit has been decreased to 500 ms.
All submissions have been rejudged - 58 authors have lost their AC.

Can anybody provide me with 37 test? I have runtime error in Python.

4
2 4 3
2 4 4
2 1 1
2 3 4
// 2 1 2 2


4
3 2 1
2 1 1
4 4 4
2 3 1
// 1 1 2 2

2
2 2 2
1 1 1
// 1 1


3
1 2 1
2 3 2
3 1 3
// 1 1 1

Edited by author 24.01.2009 20:24

I think tests for this problem are weak.
For example, there is no tests like
1000
2 2 2
1 1 1
4 4 4
3 3 3
...
1000 1000 1000
999 999 99

My program works slowly on this test (nearly 0.5sec) but it's fly like a wind on submission

my 2-sat get Wa 11..I dont know why....Can someone give me hints?Thanks!

Can I just search,or there're some other better ways?

Potentialy very interesting but with too weak tests problem
I got Ac very unexpected on halphway of solution.
MY prog can't process test
4
1 2 1
2 1 2
3 4 3
4 3 4
with answer
1 1 1 1
This specific case most interesting case when
there are K~100-250 unintersecting circles in given
graph. We should build forest consist of such
circles and process each tree from the root.
Circles are bound throught whome each statement belong.
All this situation is unreflected because weak tests.

Edited by author 12.02.2007 22:08

Edited by author 12.02.2007 22:09

Edited by author 12.02.2007 22:09

Edited by author 12.02.2007 22:11