CSES - Aalto Competitive Programming 2024 - wk2 - Mon

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

Submission details
Task:	Building Teams
Sender:	clovis
Submission time:	2024-09-09 17:36:06 +0300
Language:	CPython3
Status:	READY
Result:	RUNTIME ERROR

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	RUNTIME ERROR	0.79 s	details
#7	RUNTIME ERROR	0.79 s	details
#8	RUNTIME ERROR	0.80 s	details
#9	RUNTIME ERROR	0.79 s	details
#10	RUNTIME ERROR	0.80 s	details
#11	ACCEPTED	0.02 s	details
#12	ACCEPTED	0.02 s	details

Code

import sys
sys.setrecursionlimit(10**5)

inp1 = input().split()
numPupils = int(inp1[0])
numFriendships = int(inp1[1])

friendshipList = []

def whetherValid(group1, group2):
  for friendship in friendshipList:
    if friendship[0] in group1 and friendship[1] in group1:
      return False
    if friendship[0] in group2 and friendship[1] in group2:
      return False
  return True

def get_combinations(index, group1, group2):
  # base case
  # if index reaches total number of pupils, then no more pupils to sort. Check if both group1 and group2 are valid. If yes then print out
  if possibleGroup != []:
    return
  if index == numPupils + 1:
    if whetherValid(group1, group2):
      # print("group1:", group1)
      # print("group2:", group2)
      possibleGroup.append(list(group1))
      possibleGroup.append(list(group2))
      whetherPossible[0] = True
    return
    
  # print(f"index: {index}, group1: {group1}, group2: {group2}")

  # reduction step
  # 2 choices
  # 1. don't add the pupil to group1, add to group2 and increment index
  # 2. add the pupil to group1, don't add to group2, increment index
  group2.add(index)
  get_combinations(index + 1, group1, group2)
  group2.remove(index)
  group1.add(index)
  get_combinations(index + 1, group1, group2)
  group1.remove(index)

if numPupils == 1:
  print("1")
else:
  for i in range(numFriendships):
    inp2 = input().split()
    friendshipList.append([int(inp2[0]), int(inp2[1])])

  whetherPossible = [False]
  possibleGroup = []

  get_combinations(1, set(), set())
  if whetherPossible[0]:
    group1 = possibleGroup[0]
    group2 = possibleGroup[1]
    solution = ""

    for i in range(1, numPupils + 1):
      if i in group1:
        solution += "1 "
      else:
        solution += "2 "

    print(solution[:-1])

  else:
    print("IMPOSSIBLE")

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: 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 39, in get_combinations
    get_combinations(index + 1, group1, group2)
  File "/box/input/code.py", line 39, in get_combinations
    get_combinations(index + 1, group1, group2)
  File "/box/input/code.py", line 39, in get_combinations
    get_combinations(index + 1, group1, group2)
  [Previous line repeated 996 more times]
  File "/box/input/code.py", line 21, in get_combinations
    if possibleGroup != []:
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 39, in get_combinations
    get_combinations(index + 1, group1, group2)
  File "/box/input/code.py", line 39, in get_combinations
    get_combinations(index + 1, group1, group2)
  File "/box/input/code.py", line 39, in get_combinations
    get_combinations(index + 1, group1, group2)
  [Previous line repeated 996 more times]
  File "/box/input/code.py", line 21, in get_combinations
    if possibleGroup != []:
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 39, in get_combinations
    get_combinations(index + 1, group1, group2)
  File "/box/input/code.py", line 39, in get_combinations
    get_combinations(index + 1, group1, group2)
  File "/box/input/code.py", line 39, in get_combinations
    get_combinations(index + 1, group1, group2)
  [Previous line repeated 996 more times]
  File "/box/input/code.py", line 21, in get_combinations
    if possibleGroup != []:
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 39, in get_combinations
    get_combinations(index + 1, group1, group2)
  File "/box/input/code.py", line 39, in get_combinations
    get_combinations(index + 1, group1, group2)
  File "/box/input/code.py", line 39, in get_combinations
    get_combinations(index + 1, group1, group2)
  [Previous line repeated 996 more times]
  File "/box/input/code.py", line 21, in get_combinations
    if possibleGroup != []:
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 39, in get_combinations
    get_combinations(index + 1, group1, group2)
  File "/box/input/code.py", line 39, in get_combinations
    get_combinations(index + 1, group1, group2)
  File "/box/input/code.py", line 39, in get_combinations
    get_combinations(index + 1, group1, group2)
  [Previous line repeated 996 more times]
  File "/box/input/code.py", line 21, in get_combinations
    if possibleGroup != []:
RecursionError: maximum recursion depth exceeded in comparison

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