Task: | Building Teams |
Sender: | Meriem |
Submission time: | 2024-09-09 17:40:42 +0300 |
Language: | Python3 (PyPy3) |
Status: | READY |
Result: | RUNTIME ERROR |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.04 s | details |
#2 | ACCEPTED | 0.04 s | details |
#3 | ACCEPTED | 0.04 s | details |
#4 | ACCEPTED | 0.04 s | details |
#5 | ACCEPTED | 0.04 s | details |
#6 | RUNTIME ERROR | 0.39 s | details |
#7 | RUNTIME ERROR | 0.39 s | details |
#8 | RUNTIME ERROR | 0.39 s | details |
#9 | RUNTIME ERROR | 0.39 s | details |
#10 | RUNTIME ERROR | 0.39 s | details |
#11 | ACCEPTED | 0.04 s | details |
#12 | ACCEPTED | 0.04 s | details |
Code
import sys sys.setrecursionlimit(100) def task1(n, relations, team): for i in range(1, n + 1): if team[i] == 0: if not dfs(i, relations, team): print("IMPOSSIBLE") return team = team[1:] print(" ".join(map(str, team))) def dfs(i, relations, team): if team[i] == 0: team[i] = 1 if team[i] == 1: friend_team = 2 else: friend_team = 1 for friend in relations[i]: if team[friend] == 0: team[friend] = friend_team if not dfs(friend, relations, team): return False elif team[friend] != friend_team: return False return True if __name__ == "__main__": n, m = map(int, input().split()) relations = [[] for _ in range(n + 1)] team = [0] * (n + 1) for i in range(m): u, v = map(int, input().split()) relations[u].append(v) relations[v].append(u) task1(n, relations, team)
Test details
Test 1
Verdict: ACCEPTED
input |
---|
10 20 3 4 8 10 3 7 1 8 ... |
correct output |
---|
1 1 1 2 2 1 2 2 2 1 |
user output |
---|
1 1 1 2 2 1 2 2 2 1 |
Test 2
Verdict: ACCEPTED
input |
---|
10 20 1 3 8 10 2 4 6 8 ... |
correct output |
---|
1 1 2 2 1 1 1 2 1 1 |
user output |
---|
1 1 2 2 1 1 1 2 1 1 |
Test 3
Verdict: ACCEPTED
input |
---|
10 20 7 10 3 10 9 10 2 10 ... |
correct output |
---|
1 2 2 1 1 1 2 1 2 1 |
user output |
---|
1 2 2 1 1 1 2 1 2 1 |
Test 4
Verdict: ACCEPTED
input |
---|
10 20 2 4 2 10 7 10 4 6 ... |
correct output |
---|
1 2 1 1 2 2 2 1 2 1 |
user output |
---|
1 2 1 1 2 2 2 1 2 1 |
Test 5
Verdict: ACCEPTED
input |
---|
10 20 3 5 8 10 9 10 1 8 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 6
Verdict: RUNTIME ERROR
input |
---|
100000 200000 47355 96505 90709 92058 735 80715 91802 94265 ... |
correct output |
---|
1 2 2 1 2 1 1 1 2 2 1 2 1 1 1 ... |
user output |
---|
(empty) |
Error:
Traceback (most recent call last): File "input/code.py", line 42, in <module> task1(...
Test 7
Verdict: RUNTIME ERROR
input |
---|
100000 200000 59991 95794 95150 96051 78453 94730 90411 95523 ... |
correct output |
---|
1 1 1 2 2 1 1 2 1 2 1 2 2 2 1 ... |
user output |
---|
(empty) |
Error:
Traceback (most recent call last): File "input/code.py", line 42, in <module> task1(...
Test 8
Verdict: RUNTIME ERROR
input |
---|
100000 200000 89827 96402 65137 86792 80965 94708 19479 48078 ... |
correct output |
---|
1 2 1 1 2 1 2 2 2 1 2 1 1 2 1 ... |
user output |
---|
(empty) |
Error:
Traceback (most recent call last): File "input/code.py", line 42, in <module> task1(...
Test 9
Verdict: RUNTIME ERROR
input |
---|
100000 200000 72952 83723 66197 70052 2949 52160 55753 95651 ... |
correct output |
---|
1 1 2 2 2 1 1 2 2 2 2 2 1 2 1 ... |
user output |
---|
(empty) |
Error:
Traceback (most recent call last): File "input/code.py", line 42, in <module> task1(...
Test 10
Verdict: RUNTIME ERROR
input |
---|
100000 200000 38942 96755 70049 82663 7746 72732 87819 99029 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
(empty) |
Error:
Traceback (most recent call last): File "input/code.py", line 42, in <module> task1(...
Test 11
Verdict: ACCEPTED
input |
---|
5 4 1 2 3 4 4 5 5 3 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 12
Verdict: ACCEPTED
input |
---|
4 5 1 2 1 4 2 3 2 4 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |