CSES - Aalto Competitive Programming 2024 - wk2 - Mon

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

Submission details
Task:	Building Teams
Sender:	Rafal1
Submission time:	2024-09-09 17:18:06 +0300
Language:	CPython3
Status:	READY
Result:	WRONG ANSWER

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	WRONG ANSWER	0.02 s	details
#6	RUNTIME ERROR	0.70 s	details
#7	RUNTIME ERROR	0.70 s	details
#8	RUNTIME ERROR	0.70 s	details
#9	RUNTIME ERROR	0.70 s	details
#10	RUNTIME ERROR	0.70 s	details
#11	WRONG ANSWER	0.02 s	details
#12	WRONG ANSWER	0.02 s	details

Code

n = input().split(" ")
m = int(n[1])
n = int(n[0])

connect = []
visited = [0]
adj = [[]]
flag = 0

for i in range(n):
    visited.append(0)
    adj.append([])

for i in range(m):
    f = input().split(" ")
    f = [int(f[0]), int(f[1])]

    adj[f[0]].append(f[1])
    adj[f[1]].append(f[0])


def dfs(s, t):
    if visited[s] != 0:
        if visited[s] == t:
            flag = 1
        return
    visited[s] = t%2 + 1
    for c in adj[s]:
        dfs(c, t%2 + 1)

for i, p in enumerate(visited):
    if p == 0:
        dfs(i, 1)
if flag:
    print("IMPOSSIBLE")
else:
    for i in visited[1:]:
        print(i, end=" ")

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

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

correct output
`IMPOSSIBLE` view save

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

Test 6

Verdict: RUNTIME ERROR

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
(empty)

Error:

Traceback (most recent call last):
  File "/box/input/code.py", line 33, in <module>
    dfs(i, 1)
  File "/box/input/code.py", line 29, in dfs
    dfs(c, t%2 + 1)
  File "/box/input/code.py", line 29, in dfs
    dfs(c, t%2 + 1)
  File "/box/input/code.py", line 29, in dfs
    dfs(c, t%2 + 1)
  [Previous line repeated 995 more times]
  File "/box/input/code.py", line 23, in dfs
    if visited[s] != 0:
RecursionError: maximum recursion depth exceeded in comparison

Test 7

Verdict: RUNTIME ERROR

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
(empty)

Error:

Traceback (most recent call last):
  File "/box/input/code.py", line 33, in <module>
    dfs(i, 1)
  File "/box/input/code.py", line 29, in dfs
    dfs(c, t%2 + 1)
  File "/box/input/code.py", line 29, in dfs
    dfs(c, t%2 + 1)
  File "/box/input/code.py", line 29, in dfs
    dfs(c, t%2 + 1)
  [Previous line repeated 995 more times]
  File "/box/input/code.py", line 23, in dfs
    if visited[s] != 0:
RecursionError: maximum recursion depth exceeded in comparison

Test 8

Verdict: RUNTIME ERROR

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
(empty)

Error:

Traceback (most recent call last):
  File "/box/input/code.py", line 33, in <module>
    dfs(i, 1)
  File "/box/input/code.py", line 29, in dfs
    dfs(c, t%2 + 1)
  File "/box/input/code.py", line 29, in dfs
    dfs(c, t%2 + 1)
  File "/box/input/code.py", line 29, in dfs
    dfs(c, t%2 + 1)
  [Previous line repeated 995 more times]
  File "/box/input/code.py", line 23, in dfs
    if visited[s] != 0:
RecursionError: maximum recursion depth exceeded in comparison

Test 9

Verdict: RUNTIME ERROR

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
(empty)

Error:

Traceback (most recent call last):
  File "/box/input/code.py", line 33, in <module>
    dfs(i, 1)
  File "/box/input/code.py", line 29, in dfs
    dfs(c, t%2 + 1)
  File "/box/input/code.py", line 29, in dfs
    dfs(c, t%2 + 1)
  File "/box/input/code.py", line 29, in dfs
    dfs(c, t%2 + 1)
  [Previous line repeated 995 more times]
  File "/box/input/code.py", line 23, in dfs
    if visited[s] != 0:
RecursionError: maximum recursion depth exceeded in comparison

Test 10

Verdict: RUNTIME ERROR

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

correct output
`IMPOSSIBLE` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "/box/input/code.py", line 33, in <module>
    dfs(i, 1)
  File "/box/input/code.py", line 29, in dfs
    dfs(c, t%2 + 1)
  File "/box/input/code.py", line 29, in dfs
    dfs(c, t%2 + 1)
  File "/box/input/code.py", line 29, in dfs
    dfs(c, t%2 + 1)
  [Previous line repeated 995 more times]
  File "/box/input/code.py", line 23, in dfs
    if visited[s] != 0:
RecursionError: maximum recursion depth exceeded in comparison

Test 11

Verdict: WRONG ANSWER

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

correct output
`IMPOSSIBLE` view save

user output
`2 1 2 1 2` view save

Test 12

Verdict: WRONG ANSWER

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

correct output
`IMPOSSIBLE` view save

user output
`2 1 2 1` 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 (Rafal1)