CSES - Aalto Competitive Programming 2024 - wk2 - Mon

CSES - Aalto Competitive Programming 2024 - wk2 - Mon - Results

Submission details
Task:	Building Teams
Sender:	esya_rae
Submission time:	2024-09-09 16:37:24 +0300
Language:	Python3 (CPython3)
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.02 s	details
#2	ACCEPTED	0.02 s	details
#3	ACCEPTED	0.02 s	details
#4	ACCEPTED	0.02 s	details
#5	ACCEPTED	0.02 s	details
#6	ACCEPTED	0.94 s	details
#7	ACCEPTED	0.93 s	details
#8	ACCEPTED	0.93 s	details
#9	ACCEPTED	0.93 s	details
#10	ACCEPTED	0.69 s	details
#11	ACCEPTED	0.02 s	details
#12	ACCEPTED	0.02 s	details

Code

from collections import deque
n, m = map(int, input().split())
color = [-1] * n

g = [[] for i in range(n)]

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



def bfs(v):
    global g
    queue = deque([v])
    while queue:
        node = queue.popleft()
        for w in g[node]:
            if color[w] == color[node]:
                return False
            elif color[w] == -1:
                color[w] = 1 - color[node]
                queue.append(w)
    return True

flag = True

for v in range(n):
    if color[v] == -1:
        color[v] = 1
        if not bfs(v):
            flag = False
            print("IMPOSSIBLE")
            break

if flag:
    for v in range(n):
        print(color[v] + 1, end=" ")
    print()

Test details

Test 1

Verdict: ACCEPTED

input
`10 20 3 4 8 10 3 7 1 8 ...` view save

correct output
`1 1 1 2 2 1 2 2 2 1` view save

user output
`2 2 2 1 1 2 1 1 1 2` view save

Test 2

Verdict: ACCEPTED

input
`10 20 1 3 8 10 2 4 6 8 ...` view save

correct output
`1 1 2 2 1 1 1 2 1 1` view save

user output
`2 2 1 1 2 2 2 1 2 2` view save

Test 3

Verdict: ACCEPTED

input
`10 20 7 10 3 10 9 10 2 10 ...` view save

correct output
`1 2 2 1 1 1 2 1 2 1` view save

user output
`2 1 1 2 2 2 1 2 1 2` view save

Test 4

Verdict: ACCEPTED

input
`10 20 2 4 2 10 7 10 4 6 ...` view save

correct output
`1 2 1 1 2 2 2 1 2 1` view save

user output
`2 1 2 2 1 1 1 2 1 2` view save

Test 5

Verdict: ACCEPTED

input
`10 20 3 5 8 10 9 10 1 8 ...` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 6

Verdict: ACCEPTED

input
`100000 200000 47355 96505 90709 92058 735 80715 91802 94265 ...` view save

correct output
`1 2 2 1 2 1 1 1 2 2 1 2 1 1 1 ...` view save

user output
`2 1 1 2 1 2 2 2 1 1 2 1 2 2 2 ...` Truncated

Test 7

Verdict: ACCEPTED

input
`100000 200000 59991 95794 95150 96051 78453 94730 90411 95523 ...` view save

correct output
`1 1 1 2 2 1 1 2 1 2 1 2 2 2 1 ...` view save

user output
`2 2 2 1 1 2 2 1 2 1 2 1 1 1 2 ...` Truncated

Test 8

Verdict: ACCEPTED

input
`100000 200000 89827 96402 65137 86792 80965 94708 19479 48078 ...` view save

correct output
`1 2 1 1 2 1 2 2 2 1 2 1 1 2 1 ...` view save

user output
`2 1 2 2 1 2 1 1 1 2 1 2 2 1 2 ...` Truncated

Test 9

Verdict: ACCEPTED

input
`100000 200000 72952 83723 66197 70052 2949 52160 55753 95651 ...` view save

correct output
`1 1 2 2 2 1 1 2 2 2 2 2 1 2 1 ...` view save

user output
`2 2 1 1 1 2 2 1 1 1 1 1 2 1 2 ...` Truncated

Test 10

Verdict: ACCEPTED

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

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 11

Verdict: ACCEPTED

input
`5 4 1 2 3 4 4 5 5 3` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 12

Verdict: ACCEPTED

input
`4 5 1 2 1 4 2 3 2 4 ...` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Aalto Competitive Programming 2024 - wk2 - Mon

Building Teams

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Tasks

Submissions (esya_rae)