All submissions for this problem are available.### Read problem statements in [Hindi](http://www.codechef.com/download/translated/SEPT19/hindi/DOOFST.pdf), [Bengali](http://www.codechef.com/download/translated/SEPT19/bengali/DOOFST.pdf), [Mandarin Chinese](http://www.codechef.com/download/translated/SEPT19/mandarin/DOOFST.pdf), [Russian](http://www.codechef.com/download/translated/SEPT19/russian/DOOFST.pdf), and [Vietnamese](http://www.codechef.com/download/translated/SEPT19/vietnamese/DOOFST.pdf) as well. Dr.D has invented yet another -inator: the hateinator. He wants to test it on a group of $N$ people (numbered $1$ through $N$). The hateinator may be used any number of times; to use it once, Dr.D should divide these $N$ people into two groups and press the fire button on the hateinator. We call each such grouping a *Doofish set*. Afterwards, there will be hatred between each two people who were in different groups. The hatred does not disappear ― any two people that hate each other before the hateinator is used still hate each other afterwards. The hateinator uses a lot of power. Let's denote the number of times it is used by $K$. Then, it consumes $K \cdot N$ units of power. Dr.D cannot afford to use the hateinator if this number exceeds $10^6$. Dr.D has done the math and computed the most evil hatred system: a situation with some $M$ pairs of people who hate each other. You are given these pairs. There must not be any other pair of people who hate each other. Initially, there is no hatred between these $N$ people. Now, Dr.D is wondering: is it possible to use the hateinator to create this most evil system? If it is, what is the minimum number of times he needs to use it and with which Doofish sets? Help Dr.D find the answers. ### Input - The first line of the input contains two space-separated integers $N$ and $M$. - $M$ lines follow. For each $i$ ($1 \le i \le M$), the $i$-th of these lines contains two space-separated integers $a_i$ and $b_i$ denoting that people $a_i$ and $b_i$ should hate each other. ### Output If there is no way to achieve Dr.D's plan or the required amount of power exceeds $10^6$, print a single line containing the integer $-1$. Otherwise, first, print a line containing one integer $K$ ― the minimum number of times Dr.D needs to use the hateinator. Then, print $K$ lines; each of these lines should contain a string describing a Doofish set for one use of the hateinator. A string $S$ describes a Doofish set if it contains exactly $N$ characters and each of these characters is '0' or '1'. A Doofish set is a pair of groups. For each valid $i$, if the $i$-th character of $S$ is '1', the $i$-th person is in the first group and if it is '0', this person is in the second group. ### Constraints - $1 \le N \le 10^5$ - $0 \le M \le 2 \cdot 10^5$ - $1 \le a_i, b_i \le N$ for each valid $i$ ### Subtasks **Subtask 1 (30 points):** $M = N \cdot (N - 1) / 2$ **Subtask 2 (70 points):** original constraints ### Example Input ``` 3 3 1 2 1 3 2 3 ``` ### Example Output ``` 2 110 100 ```
|Tags||anand20, complement, dfs, kmaaszraa, long_challenge, sept19|
|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, SQL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, R, COB, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.