Hamel Paths

All submissions for this problem are available.
Read problem statement in Mandarin chinese and Vietnamese.
Chefsberg consists of $N$ islands numbered $1$ through $N$ connected by $M$ bridges numbered $1$ through $M$ (in the order in which they are given in the input). Chefsberg was designed by the best coders of the world, and they decided to create the bridges in a way that makes Chefsberg extremely connected. In particular, it is always necessary to remove more than $3$ bridges to disconnect Chefsberg. In his free time, Suzumo keeps trying to find a way to visit all islands without crossing the same bridge twice (crossing it once in each direction is also forbidden). Help Suzumo find a valid route. Remember that we are not in Königsberg, but in Chefsberg, so we don't want to cross each bridge, but visit each island. Also, we are not helping Hamilton, but Suzumo, so it is allowed to visit the same island multiple times. It is guaranteed that under the given constraints, at least one valid route exists. ### Input  The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.  The first line of each test case contains two spaceseparated integers $N$ and $M$ denoting the number of islands and the number of bridges.  Each of the following $M$ lines contains two spaceseparated integers $u$ and $v$ representing a bidirectional bridge between islands $u$ and $v$. ### Output For each test case, print a single line. This line should start with an integer $s$ denoting the number of bridges in your chosen route, followed by $s$ spaceseparated integers — the indices of the bridges in the order in which they should be crossed. For any given sequence of bridges, there are two possible choices of the starting island. Your answer will be considered correct if at least one of them produces a valid route. ### Constraints  $2 \le T \le 64$  $2 \le N \le 64$  $1 \le M \le { {64} \choose {2} }$  $1 \le u, v \le N$  there can be multiple bridges between the same pair of islands  there is no bridge connecting an island to itself ### Example Input ``` 1 8 16 1 2 1 5 1 4 1 4 2 3 2 3 2 6 3 7 3 4 4 8 5 6 5 6 5 8 6 7 7 8 7 8 ``` ### Example Output ``` 9 2 11 12 13 15 16 10 9 5 ``` ### Explanation **Example case 1:** The structure of Chefsberg is described in the picture above. The bridges used by the route are highlighted in yellow.Author:  alei 
Tags  alei, augmentingpath, cook93, eulertour, hard, matroidpartition, spanningtree 
Date Added:  15042018 
Time Limit:  1 sec 
Source Limit:  50000 Bytes 
Languages:  C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, CLOJ, COB, FS 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions
HELP
If you are still having problems, see a sample solution here. 