| Task: | Building Teams |
| Sender: | Rafal1 |
| Submission time: | 2024-09-09 17:29:54 +0300 |
| Language: | CPython3 |
| Status: | READY |
| Result: | WRONG ANSWER |
| 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 | WRONG ANSWER | 0.76 s | details |
| #7 | WRONG ANSWER | 0.75 s | details |
| #8 | WRONG ANSWER | 0.76 s | details |
| #9 | WRONG ANSWER | 0.77 s | details |
| #10 | WRONG ANSWER | 0.77 s | details |
| #11 | WRONG ANSWER | 0.02 s | details |
| #12 | WRONG ANSWER | 0.02 s | details |
Code
n = input().split(" ")
m = int(n[1])
n = int(n[0])
connect = []
visited = [0]
adj = [[]]
flag = 0
for i in range(n):
visited.append(-1)
adj.append([])
for i in range(m):
f = input().split(" ")
f = [int(f[0]), int(f[1])]
adj[f[0]].append(f[1])
adj[f[1]].append(f[0])
def dfs(s, t):
if visited[s] != 0:
if visited[s] == t:
flag = 1
return
visited[s] = t%2 + 1
for c in adj[s]:
dfs(c, t%2 + 1)
for i, p in enumerate(visited):
if p == 0:
dfs(i, 1)
if flag:
print("IMPOSSIBLE")
else:
for i in visited[1:-1]:
print(i, end=" ")
print(visited[-1])Test details
Test 1
Verdict: WRONG ANSWER
| 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 -1 -1 -1 -1 -1 -1 -1 |
Test 2
Verdict: WRONG ANSWER
| 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 -1 -1 -1 -1 -1 -1 -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 -1 -1 -1 -1 -1 -1 -1 |
Test 4
Verdict: WRONG ANSWER
| 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 -1 -1 -1 -1 -1 -1 -1 -1 -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 -1 -1 -1 -1 -1 -1 -1 |
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 ... |
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 ... |
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 ... |
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 ... |
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 ... |
Test 11
Verdict: WRONG ANSWER
| input |
|---|
| 5 4 1 2 3 4 4 5 5 3 |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| -1 -1 -1 -1 -1 |
Test 12
Verdict: WRONG ANSWER
| input |
|---|
| 4 5 1 2 1 4 2 3 2 4 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| -1 -1 -1 -1 |