Submission details
Task:Building Teams
Sender:YanAalto
Submission time:2025-09-08 17:13:43 +0300
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.04 sdetails
#3ACCEPTED0.04 sdetails
#4ACCEPTED0.04 sdetails
#50.04 sdetails
#6--details
#7--details
#8--details
#9--details
#10--details
#110.04 sdetails
#120.04 sdetails

Code

number_of_pupils, number_of_friendships = list(map(int, input().split()))

friends = []

for _ in range(number_of_friendships):
    a, b = list(map(int, input().split()))
    friends.append((a, b))

graph = {}

for i in range(1, number_of_pupils + 1):
    graph[i] = []

for friendship in friends:
    a, b = friendship
    graph[a].append(b)
    graph[b].append(a)

coloured_nodes = dict()

for node in range(1, number_of_pupils + 1):
    node_colour = 1
    if node in coloured_nodes:
        continue

    queue = list()
    queue.append(node)
    coloured_nodes[node] = node_colour

    while len(queue) > 0:
        current_node = queue.pop()
        for adj_node in graph[current_node]:
            if not adj_node in coloured_nodes:
                coloured_nodes[adj_node] = 2 if coloured_nodes[current_node] == 1 else 1
                queue.append(adj_node)


for node in range(1, number_of_pupils + 1):
    node_colour = coloured_nodes[node]
    for adj_node in graph[node]:
        if coloured_nodes[adj_node] == node_colour:
                print("IMPOSSIBLE")

print_string = ""

for item in dict(sorted(coloured_nodes.items())).items():
    print_string += f"{item[1]} "

print(print_string.strip())

Test details

Test 1

Verdict: ACCEPTED

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
1 1 1 2 2 1 2 2 2 1

Test 2

Verdict: ACCEPTED

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
1 1 2 2 1 1 1 2 1 1

Test 3

Verdict: ACCEPTED

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
1 2 2 1 1 1 2 1 2 1

Test 4

Verdict: ACCEPTED

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
1 2 1 1 2 2 2 1 2 1

Test 5

Verdict:

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

correct output
IMPOSSIBLE

user output
IMPOSSIBLE
IMPOSSIBLE
IMPOSSIBLE
IMPOSSIBLE
IMPOSSIBLE
...

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)

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)

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)

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)

Test 10

Verdict:

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

correct output
IMPOSSIBLE

user output
(empty)

Test 11

Verdict:

input
5 4
1 2
3 4
4 5
5 3

correct output
IMPOSSIBLE

user output
IMPOSSIBLE
IMPOSSIBLE
1 2 1 2 2

Test 12

Verdict:

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

correct output
IMPOSSIBLE

user output
IMPOSSIBLE
IMPOSSIBLE
1 2 1 2