InPut
5 5
1 4
4 5
5 1
1 2
2 3

OutPut
3 2 1 4 5 1

Can you send me test 11?

subj

I wrote a program about this problem but wa4....
I found an AC code but it can not pass this data,and I can pass.
8 12
1 2
2 3
3 4
4 1
1 5
2 6
3 7
4 8
5 6
6 7
7 8
8 5

here is my answer:
4
5 6 7 8 5 1 2 3 4 1
6 2
7 3
8 4

here is ac code answer:
7
1 2 3 1 4 3
4 5 1 6 5
6 7 1 8 7
8 9 1 10 9
10 11 1 12 11
12 13 1 14 13
14 2
I think he is wrong.

Please add this kind of data.
And I wanted to know the test for test 4.
Could you please tell me?
At last,sorry for my poor English.

if your algo use euleraen tour and also add edge to the graph, note that the edge can be over that 20000.
this test is good:
20000 19999
1 2
1 3
1 4
.
.
.
1 20000

GOOD LUCK & HAPPY NEW YEAR!!!

   I wrote a program about this problem and passed it today.
   But in fact,my program can't pass this data:
   4 4
   1 2
   2 1
   3 4
   4 3

   Here is my answer:
   1
   3 4 3 0 0 0
   It is not correct obviously.
   Please add this kind of data.
   At last,sorry for my poor English.

How do this faster?
1) Adding virtual edges to pairs of vertices with odd degree
2) Building Eler circuit in new graph.
3) Cutting circuit by virtual edges.
But Graph is undirected and when we removing edges
in classic stac algorithm we should use set-class as
dynamic Adj list for each vertex instead of vector-class

Please give me this test. I cannot find a mistake in my program (((

Does anybody know, how to cope with it?
(Idea of my solution: Euler Cycle).

My program is wrong! But I got AC!

I took part in the live contest yesterday and it is unfair to participate in this contest too. But I have submitted 2 problems only (F and C), which were not solved during that contest. I am sorry.

P.S. Problem C is brilliant. My respect to the author. And I have solved it using less than 1 Mb ;)

P.P.S. I wonder if Mr. Kopeliovich took part in CBOSS yesterday...