CSES - Aalto Competitive Programming 2024 - wk2 - Mon

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

Submission details
Task:	Building Teams
Sender:	Mojojijo
Submission time:	2024-09-09 16:43:07 +0300
Language:	CPython3
Status:	READY
Result:	WRONG ANSWER

Test results
test	verdict	time
#1	WRONG ANSWER	0.02 s	details
#2	WRONG ANSWER	0.02 s	details
#3	WRONG ANSWER	0.02 s	details
#4	WRONG ANSWER	0.02 s	details
#5	WRONG ANSWER	0.02 s	details
#6	RUNTIME ERROR	0.77 s	details
#7	RUNTIME ERROR	0.76 s	details
#8	RUNTIME ERROR	0.76 s	details
#9	RUNTIME ERROR	0.77 s	details
#10	RUNTIME ERROR	0.76 s	details
#11	WRONG ANSWER	0.02 s	details
#12	WRONG ANSWER	0.02 s	details

Code

def building_teams(n,friendships):

    from collections import defaultdict

    graph = defaultdict(list)
    for a,b in friendships:
        graph[a].append(b)
        graph[b].append(a)

    visited = [False] * (n+1) 
    components = []

    def dfs(node, component):
        visited[node] = True
        component.append(node)
        for neighbour in graph[node]:
            if not visited[neighbour]:
                dfs(neighbour, component)

    for i in range(1, n+1):
        if not visited[i]:
            component = []
            dfs(i, component)
            components.append(component)

    return components

def solution(n, frienships):
    components = building_teams(n,friendships)

    if n==1:
        return "IMPOSSIBLE"
    
    group1 = []
    group2 = []
    for i in range(len(components)-1):
        group1 = components[i][0]
        group2 = components[i+1][0]
    
    return group1


n,m = map(int, input().split())

friendships = []
for _ in range(m):
    a,b = map(int, input().split())
    friendships.append((a,b))

# print(building_teams(n,friendships))
print(solution(n,friendships))

Test details

Test 1

Verdict: WRONG ANSWER

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
`[]` view save

Test 2

Verdict: WRONG ANSWER

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
`[]` view save

Test 3

Verdict: WRONG ANSWER

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
`[]` view save

Test 4

Verdict: WRONG ANSWER

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
`[]` 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
`[]` 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 51, in <module>
    print(solution(n,friendships))
  File "/box/input/code.py", line 29, in solution
    components = building_teams(n,friendships)
  File "/box/input/code.py", line 23, in building_teams
    dfs(i, component)
  File "/box/input/code.py", line 18, in dfs
    dfs(neighbour, component)
  File "/box/input/code.py", line 18, in dfs
    dfs(neighbour, component)
  File "/box/input/code.py", line 18, in dfs
    dfs(neighbour, component)
  [Previous line repeated 993 more times]
  File "/box/input/code.py", line 15, in dfs
    component.append(node)
RecursionError: maximum recursion depth exceeded while calling a Python object

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 51, in <module>
    print(solution(n,friendships))
  File "/box/input/code.py", line 29, in solution
    components = building_teams(n,friendships)
  File "/box/input/code.py", line 23, in building_teams
    dfs(i, component)
  File "/box/input/code.py", line 18, in dfs
    dfs(neighbour, component)
  File "/box/input/code.py", line 18, in dfs
    dfs(neighbour, component)
  File "/box/input/code.py", line 18, in dfs
    dfs(neighbour, component)
  [Previous line repeated 993 more times]
  File "/box/input/code.py", line 15, in dfs
    component.append(node)
RecursionError: maximum recursion depth exceeded while calling a Python object

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 51, in <module>
    print(solution(n,friendships))
  File "/box/input/code.py", line 29, in solution
    components = building_teams(n,friendships)
  File "/box/input/code.py", line 23, in building_teams
    dfs(i, component)
  File "/box/input/code.py", line 18, in dfs
    dfs(neighbour, component)
  File "/box/input/code.py", line 18, in dfs
    dfs(neighbour, component)
  File "/box/input/code.py", line 18, in dfs
    dfs(neighbour, component)
  [Previous line repeated 993 more times]
  File "/box/input/code.py", line 15, in dfs
    component.append(node)
RecursionError: maximum recursion depth exceeded while calling a Python object

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 51, in <module>
    print(solution(n,friendships))
  File "/box/input/code.py", line 29, in solution
    components = building_teams(n,friendships)
  File "/box/input/code.py", line 23, in building_teams
    dfs(i, component)
  File "/box/input/code.py", line 18, in dfs
    dfs(neighbour, component)
  File "/box/input/code.py", line 18, in dfs
    dfs(neighbour, component)
  File "/box/input/code.py", line 18, in dfs
    dfs(neighbour, component)
  [Previous line repeated 993 more times]
  File "/box/input/code.py", line 15, in dfs
    component.append(node)
RecursionError: maximum recursion depth exceeded while calling a Python object

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 51, in <module>
    print(solution(n,friendships))
  File "/box/input/code.py", line 29, in solution
    components = building_teams(n,friendships)
  File "/box/input/code.py", line 23, in building_teams
    dfs(i, component)
  File "/box/input/code.py", line 18, in dfs
    dfs(neighbour, component)
  File "/box/input/code.py", line 18, in dfs
    dfs(neighbour, component)
  File "/box/input/code.py", line 18, in dfs
    dfs(neighbour, component)
  [Previous line repeated 993 more times]
  File "/box/input/code.py", line 15, in dfs
    component.append(node)
RecursionError: maximum recursion depth exceeded while calling a Python object

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
`1` 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
`[]` 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 (Mojojijo)