Task: | Building Teams |
Sender: | zilakkio |
Submission time: | 2024-09-09 16:50:45 +0300 |
Language: | Python3 (CPython3) |
Status: | READY |
Result: | WRONG ANSWER |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.02 s | details |
#2 | ACCEPTED | 0.02 s | details |
#3 | WRONG ANSWER | 0.02 s | details |
#4 | ACCEPTED | 0.02 s | details |
#5 | WRONG ANSWER | 0.02 s | details |
#6 | WRONG ANSWER | 0.81 s | details |
#7 | WRONG ANSWER | 0.81 s | details |
#8 | WRONG ANSWER | 0.81 s | details |
#9 | WRONG ANSWER | 0.81 s | details |
#10 | WRONG ANSWER | 0.80 s | details |
#11 | WRONG ANSWER | 0.02 s | details |
#12 | WRONG ANSWER | 0.02 s | details |
Code
import sys sys.setrecursionlimit(10 ** 6) n, m = map(int, input().split()) adj = [[] for _ in range(n)] visited = [False for _ in range(n)] for _ in range(m): a, b = map(int, input().split()) adj[a - 1].append(b - 1) adj[b - 1].append(a - 1) colors: list[bool | None] = [None for _ in range(n)] def dfs(i, color): if visited[i]: return True visited[i] = True colors[i] = color for u in adj[s]: if colors[u] == color: return False dfs(u, not color) return True result: list[bool|None] = [None for _ in range(n)] for s in range(n): result[s] = dfs(s, True) if all(not i for i in result): print("IMPOSSIBLE") else: print(" ".join(["1" if colors[i] else "2" for i in range(n)]))
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: WRONG ANSWER
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 1 1 2 2 2 2 2 2 2 |
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: WRONG ANSWER
input |
---|
10 20 3 5 8 10 9 10 1 8 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
1 1 1 2 2 1 2 2 2 2 |
Test 6
Verdict: WRONG ANSWER
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 |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... Truncated |
Test 7
Verdict: WRONG ANSWER
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 |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... Truncated |
Test 8
Verdict: WRONG ANSWER
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 |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... Truncated |
Test 9
Verdict: WRONG ANSWER
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 |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... Truncated |
Test 10
Verdict: WRONG ANSWER
input |
---|
100000 200000 38942 96755 70049 82663 7746 72732 87819 99029 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... Truncated |
Test 11
Verdict: WRONG ANSWER
input |
---|
5 4 1 2 3 4 4 5 5 3 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
1 2 1 2 2 |
Test 12
Verdict: WRONG ANSWER
input |
---|
4 5 1 2 1 4 2 3 2 4 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
1 2 1 2 |