Submission details
Task:Building Teams
Sender:luukwin
Submission time:2025-09-09 21:48:01 +0300
Language:Python2 (PyPy2)
Status:READY
Result:
Test results
testverdicttime
#10.03 sdetails
#20.03 sdetails
#30.04 sdetails
#40.03 sdetails
#50.03 sdetails
#60.03 sdetails
#70.03 sdetails
#80.03 sdetails
#90.04 sdetails
#100.03 sdetails
#110.03 sdetails
#120.03 sdetails

Code

import sys

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

friendships = [[] for _ in range(n)]
groups = [0 for _ in range(n)]
visited = [False for i in range(n)]
aprint = True

# Link all friends together
for i in range(m):
    a, b = [int(x) for x in input().split()]
    friendships[a-1].append(b-1)
    friendships[b-1].append(a-1)

# Depth first search through all friends and assign a team to the next friend
def dfs(s):
    stack = [s]
    while stack:
        s = stack.pop()
        if visited[s]: continue
        visited[s] = True
        for u in friendships[s]:
            stack.append(u)
            if visited[u] and groups[u] == groups[s]:
                print("IMPOSSIBLE")
                return False
            if groups[u] == 0: groups[u] = 1 if groups[s] == 2 else 2 
    return True

for i in range(n):
    if groups[i] == 0: groups[i] = 1
    if not dfs(i): 
        aprint = False
        break
if aprint: print(" ".join(map(str, groups)))

Test details

Test 1

Verdict:

input
10 20
3 4
8 10
3 7
1 8
...

correct output
1 1 1 2 2 1 2 2 2 1 

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 3, in <module>
    n, m =...

Test 2

Verdict:

input
10 20
1 3
8 10
2 4
6 8
...

correct output
1 1 2 2 1 1 1 2 1 1 

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 3, in <module>
    n, m =...

Test 3

Verdict:

input
10 20
7 10
3 10
9 10
2 10
...

correct output
1 2 2 1 1 1 2 1 2 1 

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 3, in <module>
    n, m =...

Test 4

Verdict:

input
10 20
2 4
2 10
7 10
4 6
...

correct output
1 2 1 1 2 2 2 1 2 1 

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 3, in <module>
    n, m =...

Test 5

Verdict:

input
10 20
3 5
8 10
9 10
1 8
...

correct output
IMPOSSIBLE

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 3, in <module>
    n, m =...

Test 6

Verdict:

input
100000 200000
47355 96505
90709 92058
735 80715
91802 94265
...

correct output
1 2 2 1 2 1 1 1 2 2 1 2 1 1 1 ...

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 3, in <module>
    n, m =...

Test 7

Verdict:

input
100000 200000
59991 95794
95150 96051
78453 94730
90411 95523
...

correct output
1 1 1 2 2 1 1 2 1 2 1 2 2 2 1 ...

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 3, in <module>
    n, m =...

Test 8

Verdict:

input
100000 200000
89827 96402
65137 86792
80965 94708
19479 48078
...

correct output
1 2 1 1 2 1 2 2 2 1 2 1 1 2 1 ...

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 3, in <module>
    n, m =...

Test 9

Verdict:

input
100000 200000
72952 83723
66197 70052
2949 52160
55753 95651
...

correct output
1 1 2 2 2 1 1 2 2 2 2 2 1 2 1 ...

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 3, in <module>
    n, m =...

Test 10

Verdict:

input
100000 200000
38942 96755
70049 82663
7746 72732
87819 99029
...

correct output
IMPOSSIBLE

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 3, in <module>
    n, m =...

Test 11

Verdict:

input
5 4
1 2
3 4
4 5
5 3

correct output
IMPOSSIBLE

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 3, in <module>
    n, m =...

Test 12

Verdict:

input
4 5
1 2
1 4
2 3
2 4
...

correct output
IMPOSSIBLE

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 3, in <module>
    n, m =...