— Dark mode

NOI 2019

Distance Code

  • Start: 2019-03-06 11:00:00
  • End: 2019-03-06 16:00:00
CSES - NOI 2019 - Results
Submission details
Task:Distance Code
Sender:Elvar Árni Bjarnason
Submission time:2019-03-06 12:33:35 +0200
Language:Python3
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.04 s1, 2, 3details
#2ACCEPTED0.04 s1, 2, 3details
#30.05 s1, 2, 3details
#40.04 s1, 2, 3details
#50.05 s1, 2, 3details
#60.05 s1, 2, 3details
#70.04 s1, 2, 3details
#80.06 s1, 2, 3details
#90.05 s1, 2, 3details
#100.04 s1, 2, 3details
#110.05 s1, 2, 3details
#12--2, 3details
#130.30 s2, 3details
#14--2, 3details
#150.64 s2, 3details
#16--3details
#17--3details
#18--3details
#19--3details
#200.05 s1, 2, 3details

Code

t = int(input())
tree = []
throw = []

def do(thing):
    global throw
    res = []
    if len(thing) < 1:
        return(thing)
    elif len(thing) == 1:
        throw.append(thing[0])
        return(thing)
    for i in thing:
        for x in thing:
            if i == x:
                break
            for z in i:
                if z in x:
                    res.append(z)
    for i in thing:
        for y in i:
            if y not in res and y not in throw:
                throw.append(y)
    do(res)
    
if t == 1:
    n = int(input())
    for i in range(n-1):
        tree.append(input().split())
    do(tree)
    [print(i, end=' ') for i in throw]
elif t == 2:
    free = []
    ref = []
    n = int(input())
    m = input().split()
    x = [str(i+1) for i in range(n)]
    for i in x:
        if i not in m:
            free.append(i)
    for i in free:
        for z in m:
            print(z,i)

Test details

Test 1

Group: 1, 2, 3

Verdict:

input
1
2
2 1
view save

correct output
(empty)

user output
['2', '1'] 
view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
3
3 1
2 1
view save

correct output
(empty)

user output
2 3
1 3
view save

Test 3

Group: 1, 2, 3

Verdict:

input
1
4
3 2
2 1
4 1
view save

correct output
(empty)

user output
3 4
2 4
1 4
view save

Test 4

Group: 1, 2, 3

Verdict:

input
1
4
2 3
3 4
1 3
view save

correct output
(empty)

user output
2 3
2 3
1 3
2 4
2 4
...
view save

Test 5

Group: 1, 2, 3

Verdict:

input
1
5
3 5
4 1
1 3
...
view save

correct output
(empty)

user output
4 2
3 2
1 2
1 2
4 5
...
view save

Test 6

Group: 1, 2, 3

Verdict:

input
1
5
3 2
3 4
5 1
...
view save

correct output
(empty)

user output
2 4
3 4
2 4
1 4
2 5
...
view save

Test 7

Group: 1, 2, 3

Verdict:

input
1
5
4 3
1 4
4 2
...
view save

correct output
(empty)

user output
2 3
2 3
2 3
1 3
2 4
...
view save

Test 8

Group: 1, 2, 3

Verdict:

input
1
10
9 3
8 9
2 9
...
view save

correct output
(empty)

user output
2 3
2 3
2 3
2 3
2 3
...
Truncated

Test 9

Group: 1, 2, 3

Verdict:

input
1
10
9 2
5 8
7 1
...
view save

correct output
(empty)

user output
5 4 8 9 7 0 2 3 6 1 
view save

Test 10

Group: 1, 2, 3

Verdict:

input
1
10
10 4
9 1
4 7
...
view save

correct output
(empty)

user output
10 9 3 5 4 1 8 7 6 2 
view save

Test 11

Group: 1, 2, 3

Verdict:

input
1
10
2 6
4 3
3 5
...
view save

correct output
(empty)

user output
8 2
3 2
6 2
6 2
1 2
...
Truncated

Test 12

Group: 2, 3

Verdict:

input
1
500
10 6
6 255
6 428
...
view save

correct output
(empty)

user output
(empty)

Test 13

Group: 2, 3

Verdict:

input
1
500
152 466
451 313
158 479
...
view save

correct output
(empty)

user output
72 106 7 4 9 1 3 8 2 6 0 5 
view save

Test 14

Group: 2, 3

Verdict:

input
1
500
109 440
330 190
443 161
...
view save

correct output
(empty)

user output
(empty)

Test 15

Group: 2, 3

Verdict:

input
1
500
144 373
257 233
341 318
...
view save

correct output
(empty)

user output
159 167 74 497 386 401 322 205...
Truncated

Test 16

Group: 3

Verdict:

input
1
100000
54983 75172
93807 75172
44082 75172
...
view save

correct output
(empty)

user output
(empty)

Test 17

Group: 3

Verdict:

input
1
100000
88863 19059
86423 76688
98536 95984
...
view save

correct output
(empty)

user output
(empty)

Test 18

Group: 3

Verdict:

input
1
100000
59979 6389
19097 24999
27846 82330
...
view save

correct output
(empty)

user output
(empty)

Test 19

Group: 3

Verdict:

input
1
100000
58761 66001
25102 51081
98625 67861
...
view save

correct output
(empty)

user output
(empty)

Test 20

Group: 1, 2, 3

Verdict:

input
1
6
2 1
3 2
4 2
...
view save

correct output
(empty)

user output
2 4
3 4
2 4
2 4
1 4
...
view save

Tasks

A Distance Code-B Thieves and Prisons-C Graph Ordering-

Submissions (Elvar Árni Bjarnason)

2019-03-06 12:45:46 02019-03-06 12:33:35 0