CSES - Aalto Competitive Programming 2024 - wk2 - Mon - Results
Submission details
Task:Building Teams
Sender:aarol
Submission time:2024-09-09 17:36:50 +0300
Language:Python3 (CPython3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.02 sdetails
#2ACCEPTED0.02 sdetails
#3ACCEPTED0.02 sdetails
#4ACCEPTED0.02 sdetails
#5ACCEPTED0.02 sdetails
#60.76 sdetails
#70.76 sdetails
#80.76 sdetails
#90.75 sdetails
#10ACCEPTED0.75 sdetails
#11ACCEPTED0.02 sdetails
#12ACCEPTED0.02 sdetails

Code

line = input()

parts = line.split(" ")
pupils, friendships = int(parts[0]), int(parts[1])

adj: dict[int, list[int]] = {}
for i in range(1, pupils + 1):
    adj[i] = []

for _ in range(friendships):
    parts = input().split(" ")
    a, b = int(parts[0]), int(parts[1])

    adj[a].append(b)
    adj[b].append(a)


res: list[str] = []
for i in range(pupils+1):
    res.append("0")

#team = 2, !team = 1
def rec(p: int, team: str):
    
    if res[p] == "1" and team == "2":
        print("IMPOSSIBLE")
        exit(0)

    if res[p] == "2" and team == "1":
        print("IMPOSSIBLE")
        exit(0)

    if res[p] != "0":
        return
    
    res[p] = team
    
    for friend in adj[p]:
        rec(friend, "1" if team == "2" else "2")

for p in range(1, pupils + 1):
    if res[p] == "0":
        rec(p, "1")

print(" ".join(res[1:]))

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)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 43, in <module>
    r...

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 "/box/input/code.py", line 43, in <module>
    r...

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 "/box/input/code.py", line 43, in <module>
    r...

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 "/box/input/code.py", line 43, in <module>
    r...

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

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

correct output
IMPOSSIBLE

user output
IMPOSSIBLE