| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 2 초 | 1024 MB | 45 | 25 | 23 | 54.762% |
You have a simple undirected graph consisting of $n$ vertices and $m$ edges. The graph doesn't contain self-loops, there is at most one edge between a pair of vertices. The given graph can be disconnected.
Let's make a definition.
Let $v_1$ and $v_2$ be two some nonempty subsets of vertices that do not intersect. Let $f(v_{1}, v_{2})$ be true if and only if all the conditions are satisfied:
Create three vertex sets ($v_{1},ドル $v_{2},ドル $v_{3}$) which satisfy the conditions below;
Is it possible to create such three vertex sets? If it's possible, print matching vertex set for each vertex.
The first line contains two integers $n$ and $m$ (3ドル \le n \le 10^{5},ドル 0ドル \le m \le \text{min}(3 \cdot 10^{5}, \frac{n(n-1)}{2})$) --- the number of vertices and edges in the graph.
The $i$-th of the next $m$ lines contains two integers $a_{i}$ and $b_{i}$ (1ドル \le a_{i} \lt b_{i} \le n$) --- it means there is an edge between $a_{i}$ and $b_{i}$. The graph doesn't contain self-loops, there is at most one edge between a pair of vertices. The given graph can be disconnected.
If the answer exists, print $n$ integers. $i$-th integer means the vertex set number (from 1ドル$ to 3ドル$) of $i$-th vertex. Otherwise, print $-1$.
If there are multiple answers, print any.
6 11 1 2 1 3 1 4 1 5 1 6 2 4 2 5 2 6 3 4 3 5 3 6
1 2 2 3 3 3
4 6 1 2 1 3 1 4 2 3 2 4 3 4
-1
In the first example, if $v_{1} = \{ 1 \},ドル $v_{2} = \{ 2, 3 \},ドル and $v_{3} = \{ 4, 5, 6 \}$ then vertex sets will satisfy all conditions. But you can assign vertices to vertex sets in a different way; Other answers like "2 3 3 1 1 1" will be accepted as well.
In the second example, it's impossible to make such vertex sets.
Contest > Codeforces > Codeforces Round 589 (Div. 2) D번