Submission details
Task:Building Teams
Sender:francden
Submission time:2025-09-08 17:04:48 +0300
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.05 sdetails
#3ACCEPTED0.04 sdetails
#4ACCEPTED0.04 sdetails
#5ACCEPTED0.05 sdetails
#6--details
#7--details
#8--details
#9--details
#10ACCEPTED0.37 sdetails
#11ACCEPTED0.04 sdetails
#120.04 sdetails

Code

n,m = [int(x) for x in input().split()]
friendship = []
for i in range (n):
    friendship.append([])
group = [0 for i in range(n)]
list_to_test = [0]

for i in range (m):
    a,b = [int(x)-1 for x in input().split()]
    friendship[a].append(b)
    friendship[b].append(a)

def test_friendship():
    while list_to_test:
        people = list_to_test.pop()
        flag = False
        color = 0
        for friend in friendship[people]:
            if group[friend] != 0:
                
                if flag:
                    if  color != group[friend]:
                        return False
                color = group[friend]
                group[people] = 3 - group[friend]
                flag = True
            else : 
                list_to_test.append(friend)    
        if flag == False:
            group[people] = 1      
    return True
            
            

test_friendship()

i = 1
test = False
while i<n:
    if group[i] == 0:
        list_to_test.append(i)
        if test_friendship() == False:
            print("IMPOSSIBLE")
            test = True
            break
    i+=1
    
if not(test):
    car = ""
    for eleve in group:
        car+= str(eleve) + " "
    print(car)

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: ACCEPTED

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

correct output
IMPOSSIBLE

user output
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: ACCEPTED

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

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 11

Verdict: ACCEPTED

input
5 4
1 2
3 4
4 5
5 3

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 12

Verdict:

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

correct output
IMPOSSIBLE

user output
1 2 1 2