7 8
1 2
1 3
1 4
5 6
6 7
7 8
7 5

10 10
4 2
2 3
3 1
1 5
5 6
6 7
2 8
8 9
9 10
10 6

answer is:
6
4 2 3 1 5 6 7 3 4 5

WA in Case #6.
Could you give me the case?

Edited by author 11.10.2015 17:59

Here is a special case test:

Input:
2 4
1 2
3 4

Possible output:
49
1 2 50 49

4 5
1 2
2 3
3 4
4 5

7 6
1 2
2 3
3 4
4 1
4 5
5 6
6 1

2 5
1 2
2 3

2 4
1 2
3 4

3 4
3 1
1 2
2 4

4 4
1 2
3 1
2 4
3 4

3 3
1 2
2 3
1 3

please, give any advice...

Maybe it's only me who is of this opinion, but the statement of the problem is really equivocal. The expressions "If Leonid is wrong in his assumptions" and "Leonid assumes that the work experience of each pilot is in the range from 1 to 50 years" obviously led me to the misunderstanding of the problem itself, as I supposed that if the graph is disconnected the answer would be -1, because Leonid might be wrong in his assumptions in case if the difference in ages between pilots from two different connected components exceeds 50 years. Therefore it would be better to say "It is known that the work experience of each pilot is in range from 1 to 50 years" as it makes people understand that this is a required restriction.

I would be very grateful if authors avoided such tricky and equivocal expressions in their statements. Thank you for the time spent in order to look through this post.

if unconnected graph, alway maximal difference is 49.
if connected graph ??


AC!!! I found bug!!!

Edited by author 22.12.2011 21:28

Edited by author 22.12.2011 21:28

Some new tricky tests were added. 3 authors lost their AC after rejudge.

Can you public this test or tell about idea in it? Yesterday we can't got "Accepted", because always got "WA 24" (Magnitogorsk STU). We have no idea about our mistake.
Maybe test is incorrect?

I think that first answer
2
1 2 2 1
is true, but wa1

In the second line output n integers

I think it should be "p integers"