CSES - Aalto Competitive Programming 2026 - wk2 - Mon

Submission details
Task:	Building Teams
Sender:	aalto26bm_021
Submission time:	2026-09-07 17:34:22 +0300
Language:	Python3 (PyPy3)
Status:	READY
Result:	WRONG ANSWER

Test results
test	verdict	time
#1	WRONG ANSWER	0.04 s	details
#2	WRONG ANSWER	0.04 s	details
#3	WRONG ANSWER	0.04 s	details
#4	WRONG ANSWER	0.04 s	details
#5	ACCEPTED	0.04 s	details
#6	TIME LIMIT EXCEEDED	--	details
#7	TIME LIMIT EXCEEDED	--	details
#8	TIME LIMIT EXCEEDED	--	details
#9	TIME LIMIT EXCEEDED	--	details
#10	RUNTIME ERROR	0.43 s	details
#11	ACCEPTED	0.04 s	details
#12	ACCEPTED	0.04 s	details

Code

n,m = [int(x) for x in input().split()]
mapping = list(range(0,n+1)) #zero ignored
IMPOSSIBLE = False
def sign(a:int): 
    return a//abs(a)
def moreToPopagate(a:int):
    global mapping
    global IMPOSSIBLE
    v = mapping[abs(a)]
    if -v == abs(a):
        IMPOSSIBLE = True
        return False
    return mapping[abs(a)] != mapping[abs(v)]*sign(v)
def propagate(a: int):
    global mapping
    global IMPOSSIBLE
    v = mapping[abs(a)]
    if -v == abs(a):
        IMPOSSIBLE = True
        return
    mapping[abs(a)] = mapping[abs(v)]*sign(v)
    if moreToPopagate(a):
        propagate(a)

def isLowest(a: int):
    return abs(mapping[abs(a)]) == abs(a)
def doMapping(a: int, b:int):
    global mapping
    global IMPOSSIBLE
    if IMPOSSIBLE: return
    if (abs(a) > abs(b)): return doMapping(b,a)
    if (b != abs(b)): return doMapping(-a,-b)
    if (sign(a)*mapping[abs(a)]==sign(b)*mapping[abs(b)]): IMPOSSIBLE = True
    propagate(a)
    propagate(b)
    if (not isLowest(a) or not isLowest(b)): return doMapping(sign(a)*mapping[abs(a)],sign(b)*mapping[abs(b)])
    assert(mapping[abs(a)])
    mapping[b] = -a

i = m
while i != 0: 
    a,b = input().split()
    doMapping(int(a),int(b))
    i -= 1

for i in range(1,n+1):
    while moreToPopagate(i): 
        propagate(i)
        
if IMPOSSIBLE:
    print("IMPOSSIBLE")
else:
    toPrint = []
    for i in range(1,n+1):
        if mapping[i] > 0: 
            toPrint.append(1)
        else:
            toPrint.append(2)
    print(toPrint)

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
`[1, 1, 1, 2, 2, 1, 2, 2, 2, 1]` 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
`[1, 1, 2, 2, 1, 1, 1, 2, 1, 1]` 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
`[1, 2, 2, 1, 1, 1, 2, 1, 2, 1]` 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
`[1, 2, 1, 1, 2, 2, 2, 1, 2, 1]` 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: TIME LIMIT EXCEEDED

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)

Test 7

Verdict: TIME LIMIT EXCEEDED

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)

Test 8

Verdict: TIME LIMIT EXCEEDED

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)

Test 9

Verdict: TIME LIMIT EXCEEDED

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)

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 48, in <module>
    propagate(i)
  File "/box/input/code.py", line 23, in propagate
    propagate(a)
  File "/box/input/code.py", line 23, in propagate
    propagate(a)
  File "/box/input/code.py", line 23, in propagate
    propagate(a)
  [Previous line repeated 1685 more times]
  File "/box/input/code.py", line 21, in propagate
    mapping[abs(a)] = mapping[abs(v)]*sign(v)
  File "/box/input/code.py", line 4, in sign
    def sign(a:int):
RecursionError: maximum recursion depth exceeded

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 2026 - 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 (aalto26bm_021)