Task: | Building Teams |
Sender: | aarol |
Submission time: | 2024-09-09 17:41:23 +0300 |
Language: | Python3 (PyPy3) |
Status: | READY |
Result: | TIME LIMIT EXCEEDED |
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 | TIME LIMIT EXCEEDED | -- | details |
#7 | TIME LIMIT EXCEEDED | -- | details |
#8 | TIME LIMIT EXCEEDED | -- | details |
#9 | TIME LIMIT EXCEEDED | -- | details |
#10 | ACCEPTED | 0.38 s | details |
#11 | ACCEPTED | 0.04 s | details |
#12 | ACCEPTED | 0.04 s | details |
Code
import sys sys.setrecursionlimit(100000) line = input() parts = line.split(" ") pupils, friendships = int(parts[0]), int(parts[1]) adj = {} for i in range(1, pupils + 1): adj[i] = [] for _ in range(friendships): parts = input().split(" ") a, b = int(parts[0]), int(parts[1]) adj[a].append(b) adj[b].append(a) res= [] for i in range(pupils+1): res.append("0") #team = 2, !team = 1 def rec(p, team): if res[p] == "1" and team == "2": print("IMPOSSIBLE") exit(0) if res[p] == "2" and team == "1": print("IMPOSSIBLE") exit(0) if res[p] != "0": return res[p] = team for friend in adj[p]: rec(friend, "1" if team == "2" else "2") for p in range(1, pupils + 1): if res[p] == "0": rec(p, "1") print(" ".join(res[1:]))
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 |
---|
1 2 2 1 1 1 2 1 2 1 |
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: ACCEPTED
input |
---|
10 20 3 5 8 10 9 10 1 8 ... |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 6
Verdict: TIME LIMIT EXCEEDED
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 |
---|
(empty) |
Test 7
Verdict: TIME LIMIT EXCEEDED
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 |
---|
(empty) |
Test 8
Verdict: TIME LIMIT EXCEEDED
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 |
---|
(empty) |
Test 9
Verdict: TIME LIMIT EXCEEDED
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 |
---|
(empty) |
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 |