Submission details
Task:Building Teams
Sender:Sanzis
Submission time:2025-09-08 17:31:11 +0300
Language:Python3 (CPython3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.02 sdetails
#2ACCEPTED0.02 sdetails
#30.02 sdetails
#4ACCEPTED0.02 sdetails
#5ACCEPTED0.02 sdetails
#6--details
#7--details
#8--details
#9--details
#10--details
#11ACCEPTED0.02 sdetails
#12ACCEPTED0.02 sdetails

Code

fline = list(int(x) for x in input("").split(" "))
friends = []

for i in range(fline[1]):
    friends.append(tuple(int(x) for x in input("").split(" ")))

friendlist = {}

for i in range(fline[0]):
    friendlist[i + 1] = []

for j in friends:
    friendlist[j[0]].append(j[1])
    friendlist[j[1]].append(j[0])

previous = []

has2 = False
for i in friendlist.keys():
    team1 = True
    team2 = True
    for j in previous:
        if j[1] in friendlist[i]:
            if j[0] == 1:
                team1 = False
            if j[0] == 2:
                team2 = False
    if team1:
        previous.append((1, i))
    elif team2:
        previous.append((2, i))
        has2 = True
    
    else:
        previous = "IMPOSSIBLE"
        break

if previous == "IMPOSSIBLE":
    print(previous)
else:
    if not has2:
        num = previous.pop()
        new = (2, num[1])
        previous.append(new)
    printable = ""
    for i in previous:
        
        printable += f"{i[0]} "
    print(printable.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:

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

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

correct output
IMPOSSIBLE

user output
(empty)

Test 11

Verdict: ACCEPTED

input
5 4
1 2
3 4
4 5
5 3

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 12

Verdict: ACCEPTED

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

correct output
IMPOSSIBLE

user output
IMPOSSIBLE