| Task: | Building Teams |
| Sender: | aalto26bm_021 |
| Submission time: | 2026-09-07 18:56:20 +0300 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | ACCEPTED |
| 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 | ACCEPTED | 0.33 s | details |
| #7 | ACCEPTED | 0.33 s | details |
| #8 | ACCEPTED | 0.33 s | details |
| #9 | ACCEPTED | 0.32 s | details |
| #10 | ACCEPTED | 0.35 s | details |
| #11 | ACCEPTED | 0.04 s | details |
| #12 | ACCEPTED | 0.04 s | details |
Code
n,m = [int(x) for x in input().split()]
edges = []
for i in range(0,m):
(a,b) = input().split()
edges.append(int(a))
edges.append(int(b))
g1 = set([edges[0]])
g2 = set([])
while len(edges) > 0:
did = False
l = []
for e in range(0,len(edges)//2):
a = True
if edges[2*e] in g1:
g2.add(edges[2*e+1])
a = False
if edges[2*e+1] in g1:
g2.add(edges[2*e])
a = False
if edges[2*e] in g2:
g1.add(edges[2*e+1])
a = False
if edges[2*e+1] in g2:
g1.add(edges[2*e])
a = False
if a:
l.append(edges[2*e])
l.append(edges[2*e+1])
else:
did = True
edges = l
if not did:
g1.add(edges[0])
if len(g1.intersection(g2)) != 0:
print("IMPOSSIBLE")
else:
toPrint = []
for i in range(1,n+1):
if i in g1:
toPrint.append("1")
elif i in g2:
toPrint.append("2")
else:
toPrint.append("1")
print(" ".join(toPrint))
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 |
|---|
| 2 1 1 2 2 2 1 2 1 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 |
|---|
| 2 1 2 2 1 1 1 2 1 2 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 10 20 3 5 8 10 9 10 1 8 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
Test 6
Verdict: ACCEPTED
| 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 |
|---|
| 2 1 1 2 1 1 2 2 1 1 1 1 2 2 2 ... |
Test 7
Verdict: ACCEPTED
| 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 2 2 1 1 2 1 2 1 2 2 2 1 ... |
Test 8
Verdict: ACCEPTED
| 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 |
|---|
| 2 1 2 2 1 2 1 1 1 2 1 2 1 1 1 ... |
Test 9
Verdict: ACCEPTED
| 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 2 2 2 1 1 2 2 2 2 2 1 2 1 ... |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 100000 200000 38942 96755 70049 82663 7746 72732 87819 99029 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
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 |