Submission details
Task:Building Teams
Sender:aalto26bm_035
Submission time:2026-09-07 16:53:37 +0300
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#10.04 sdetails
#20.04 sdetails
#30.04 sdetails
#40.04 sdetails
#50.04 sdetails
#60.33 sdetails
#70.33 sdetails
#80.32 sdetails
#90.32 sdetails
#10ACCEPTED0.32 sdetails
#110.04 sdetails
#120.04 sdetails

Code

def main():
    pupils, frienships = [int(x) for x in input().split()]
    adj_list = {k:[] for k in range(1, pupils+1)}
    groups = [0 for _ in range(pupils+1)]
    stack = []
    previous = 2

    for _ in range(frienships):
        pupil1,pupil2 = [int(x) for x in input().split()]
        adj_list[pupil1].append(pupil2)
        adj_list[pupil1].append(pupil1) 



    for pupil in adj_list:
        if groups[pupil] == 0:
            if previous==1:
                previous=2
            else:
                previous=1

            stack.append(pupil)
            groups[pupil] = previous 

            while stack:
                aux = stack.pop()
                for x in adj_list[aux]:
                    if groups[x] == 0:
                        stack.append(x)
                        groups[x] = 1 if previous == 2 else 2

        elif groups[pupil] == previous:
            print("IMPOSSIBLE")
            return
            
    salida = ""
    for x in range(1, pupils+1):
        salida+=str(groups[x]) + " "
    print(salida)             


main()

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

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
IMPOSSIBLE

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
IMPOSSIBLE

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

Test 5

Verdict:

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

correct output
IMPOSSIBLE

user output
1 2 1 2 2 2 2 2 2 2 

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
IMPOSSIBLE

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
IMPOSSIBLE

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
IMPOSSIBLE

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
IMPOSSIBLE

Test 10

Verdict: ACCEPTED

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

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 11

Verdict:

input
5 4
1 2
3 4
4 5
5 3

correct output
IMPOSSIBLE

user output
1 2 2 1 1 

Test 12

Verdict:

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

correct output
IMPOSSIBLE

user output
1 2 2 2