| Task: | Building Teams |
| Sender: | luukwin |
| Submission time: | 2025-09-09 17:28:30 +0300 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | WRONG ANSWER | 0.04 s | details |
| #2 | WRONG ANSWER | 0.05 s | details |
| #3 | WRONG ANSWER | 0.04 s | details |
| #4 | WRONG ANSWER | 0.04 s | details |
| #5 | WRONG ANSWER | 0.04 s | details |
| #6 | WRONG ANSWER | 0.34 s | details |
| #7 | WRONG ANSWER | 0.33 s | details |
| #8 | WRONG ANSWER | 0.34 s | details |
| #9 | WRONG ANSWER | 0.33 s | details |
| #10 | WRONG ANSWER | 0.33 s | details |
| #11 | WRONG ANSWER | 0.04 s | details |
| #12 | WRONG ANSWER | 0.04 s | details |
Code
n, m = map(int, input().split())
parent = list(range(n))
groups = list(range(n))
def find(x):
while parent[x] != x:
parent[x] = parent[parent[x]] # Go one step up
x = parent[x]
return x
def union(x, y):
rx, ry = find(x), find(y)
if rx != ry:
parent[ry] = rx
for _ in range(m):
a, b = map(int, input().split())
union(a-1, b-1)
number = [find(i) for i in range(n)]
print(number)
for i in range(len(number)):
if i == number[i]: groups[i] = 1
else: groups[i] = 2
print(" ".join(map(str, groups)))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 |
|---|
| [5, 5, 5, 5, 5, 5, 5, 5, 5, 5] 2 2 2 2 2 1 2 2 2 2 |
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 |
|---|
| [4, 4, 4, 4, 4, 4, 4, 4, 4, 4] 2 2 2 2 1 2 2 2 2 2 |
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 |
|---|
| [4, 4, 4, 4, 4, 4, 4, 4, 4, 4] 2 2 2 2 1 2 2 2 2 2 |
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 |
|---|
| [7, 7, 7, 7, 7, 7, 7, 7, 7, 7] 2 2 2 2 2 2 2 1 2 2 |
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] 2 1 2 2 2 2 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 |
|---|
| [1594, 1594, 1594, 1594, 1594,... 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 |
|---|
| [9917, 1, 9917, 9917, 9917, 5,... 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 |
|---|
| [30749, 30749, 30749, 30749, 3... 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 |
|---|
| [5943, 18260, 5943, 5943, 5943... Truncated |
Test 10
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 38942 96755 70049 82663 7746 72732 87819 99029 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| [12876, 12876, 12876, 12876, 1... Truncated |
Test 11
Verdict: WRONG ANSWER
| input |
|---|
| 5 4 1 2 3 4 4 5 5 3 |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| [0, 0, 2, 2, 2] 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 |
|---|
| [0, 0, 0, 0] 1 2 2 2 |
