Building Teams

n, m = map(int, input().split())

parent = list(range(n))
groups = list(range(n))

def find(x):
    while parent[x] != x:
        parent[x] = parent[parent[x]] # Go one step up
        x = parent[x]
    return x

def union(x, y):
    rx, ry = find(x), find(y)
    if rx != ry:
        parent[ry] = rx

for _ in range(m):
    a, b = map(int, input().split())
    union(a-1, b-1)

number = [find(i) for i in range(n)]
for i in range(len(number)):
    if i == number[i]: groups[i] = 1
    else: groups[i] = 2
print(" ".join(map(str, groups)))

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER