| Task: | Building Teams |
| Sender: | aalto26bm_013 |
| Submission time: | 2026-09-07 16:54:32 +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.61 s | details |
| #7 | ACCEPTED | 0.60 s | details |
| #8 | ACCEPTED | 0.61 s | details |
| #9 | ACCEPTED | 0.60 s | details |
| #10 | ACCEPTED | 0.35 s | details |
| #11 | ACCEPTED | 0.04 s | details |
| #12 | ACCEPTED | 0.04 s | details |
Code
if __name__ == "__main__":
n, m = [int(x) for x in input().split(" ")]
friends = {}
for x in range(1, m + 1):
s, e = [int(x) for x in input().split(" ")]
if not (s in friends):
friends[s] = []
if not (e in friends):
friends[e] = []
friends[s].append(e)
friends[e].append(s)
team = [None] * (n+1)
for x in range(1, n + 1):
if team[x] != None:
continue
stack = [(x, True)]
while len(stack) > 0:
y, t = stack.pop()
if team[y] != None:
if team[y] != t:
print("IMPOSSIBLE")
exit()
for n in friends[y]:
if team[n] != None and team[n] == t:
print("IMPOSSIBLE")
exit()
continue
team[y] = t
if not y in friends:
continue
for n in friends[y]:
stack.append((n, not t))
for t in team[1:]:
print(int(t) + 1, end=" ")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 |
|---|
| 2 2 2 1 1 2 1 1 1 2 |
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 |
|---|
| 2 2 1 1 2 2 2 1 2 2 |
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 2 2 2 1 1 2 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 |
|---|
| 2 2 2 1 1 2 2 1 2 1 2 1 1 1 2 ... |
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 2 1 2 ... |
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 |
|---|
| 2 2 1 1 1 2 2 1 1 1 1 1 2 1 2 ... |
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 |
