Logo
(追記) (追記ここまで)

30170번 - Complete Tripartite 스페셜 저지다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 1024 MB45252354.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:

  1. There are no edges with both endpoints in vertex set $v_1$.
  2. There are no edges with both endpoints in vertex set $v_2$.
  3. For every two vertices $x$ and $y$ such that $x$ is in $v_1$ and $y$ is in $v_2,ドル there is an edge between $x$ and $y$.

Create three vertex sets ($v_{1},ドル $v_{2},ドル $v_{3}$) which satisfy the conditions below;

  1. All vertex sets should not be empty.
  2. Each vertex should be assigned to only one vertex set.
  3. $f(v_{1}, v_{2}),ドル $f(v_{2}, v_{3}),ドル $f(v_{3}, v_{1})$ are all true.

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.

제한

예제 입력 1

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

1 2 2 3 3 3

예제 입력 2

4 6
1 2
1 3
1 4
2 3
2 4
3 4

예제 출력 2

-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번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /