| Task: | Distance Code |
| Sender: | Nicolai Epshtein |
| Submission time: | 2019-03-06 20:03:17 +0200 |
| Language: | Python3 |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.06 s | 1, 2, 3 | details |
| #2 | WRONG ANSWER | 0.05 s | 1, 2, 3 | details |
| #3 | WRONG ANSWER | 0.04 s | 1, 2, 3 | details |
| #4 | WRONG ANSWER | 0.04 s | 1, 2, 3 | details |
| #5 | WRONG ANSWER | 0.04 s | 1, 2, 3 | details |
| #6 | WRONG ANSWER | 0.04 s | 1, 2, 3 | details |
| #7 | WRONG ANSWER | 0.04 s | 1, 2, 3 | details |
| #8 | WRONG ANSWER | 0.04 s | 1, 2, 3 | details |
| #9 | WRONG ANSWER | 0.06 s | 1, 2, 3 | details |
| #10 | WRONG ANSWER | 0.05 s | 1, 2, 3 | details |
| #11 | WRONG ANSWER | 0.05 s | 1, 2, 3 | details |
| #12 | WRONG ANSWER | 0.05 s | 2, 3 | details |
| #13 | WRONG ANSWER | 0.05 s | 2, 3 | details |
| #14 | WRONG ANSWER | 0.03 s | 2, 3 | details |
| #15 | WRONG ANSWER | 0.04 s | 2, 3 | details |
| #16 | WRONG ANSWER | 0.51 s | 3 | details |
| #17 | WRONG ANSWER | 0.50 s | 3 | details |
| #18 | WRONG ANSWER | 0.50 s | 3 | details |
| #19 | WRONG ANSWER | 0.51 s | 3 | details |
| #20 | WRONG ANSWER | 0.04 s | 1, 2, 3 | details |
Code
t = int(input())
n = int(input())
if t == 1:
test = []
for i in range(n-1):
test.append([int(x) for x in input().split(" ")])
for i in range(len(test)):
print(" ".join([str(x) for x in test[i]]))
# nodes = [[] for _ in range(n+1)]
# for i in range(n-1):
# u, v = [int(x) for x in input().split(" ")]
# nodes[u].append(v)
# nodes[v].append(u)
# path = []
# def remove():
# ind = nodes.index(min((x for x in nodes[::-1] if len(x) > 0), key=len))
# path.append (ind)
# nodes[nodes[ind][0]].remove(ind)
# if not nodes[nodes[ind][0]]:
# path.append(nodes[ind][0])
# nodes[ind] = []
# remove()
# try:
# remove()
# except:
# print(" ".join([str(x) for x in path]))
if t == 2:
print(input())
# nodes = [[] for _ in range(n)]
# parent = 0
# try:
# path = [int(x) for x in input().split(" ")]
# path = path[::-1]
# for i in range(n):
# if i == 0:
# parent = path[i]-1
# elif path[i] > path[i+1]:
# None
# else:
# parent = parent+1
# nodes[parent].append(path[i+1])
# except:
# for i in range(n):
# for node in nodes[i]:
# print(i+1, node)Test details
Test 1
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 2 2 1 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 |
Test 2
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 3 3 1 2 1 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 1 |
Test 3
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 4 3 2 2 1 4 1 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 3 2 2 1 4 1 |
Test 4
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 4 2 3 3 4 1 3 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 2 3 3 4 1 3 |
Test 5
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 5 3 5 4 1 1 3 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 3 5 4 1 1 3 4 2 |
Test 6
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 5 3 2 3 4 5 1 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 3 2 3 4 5 1 1 3 |
Test 7
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 5 4 3 1 4 4 2 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 4 3 1 4 4 2 5 4 |
Test 8
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 10 9 3 8 9 2 9 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 9 3 8 9 2 9 1 9 10 9 ... |
Test 9
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 10 9 2 5 8 7 1 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 9 2 5 8 7 1 6 8 4 10 ... |
Test 10
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 10 10 4 9 1 4 7 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 10 4 9 1 4 7 3 8 8 1 ... |
Test 11
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 10 2 6 4 3 3 5 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 2 6 4 3 3 5 10 6 9 2 ... |
Test 12
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 500 10 6 6 255 6 428 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 10 6 6 255 6 428 7 6 65 6 ... Truncated |
Test 13
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 500 152 466 451 313 158 479 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 152 466 451 313 158 479 445 87 403 273 ... Truncated |
Test 14
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 500 109 440 330 190 443 161 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 109 440 330 190 443 161 206 81 236 23 ... Truncated |
Test 15
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 500 144 373 257 233 341 318 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 144 373 257 233 341 318 156 159 185 13 ... Truncated |
Test 16
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 100000 54983 75172 93807 75172 44082 75172 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 54983 75172 93807 75172 44082 75172 75172 84824 75172 98997 ... Truncated |
Test 17
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 100000 88863 19059 86423 76688 98536 95984 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 88863 19059 86423 76688 98536 95984 96118 70092 42041 95469 ... Truncated |
Test 18
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 100000 59979 6389 19097 24999 27846 82330 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 59979 6389 19097 24999 27846 82330 55283 21756 29532 76920 ... Truncated |
Test 19
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 100000 58761 66001 25102 51081 98625 67861 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 58761 66001 25102 51081 98625 67861 39627 96609 42728 51847 ... Truncated |
Test 20
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 6 2 1 3 2 4 2 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 2 1 3 2 4 2 5 3 6 3 |