CSES - Datatähti 2023 alku

CSES - Datatähti 2023 alku - Results

Submission details
Task:	Sadonkorjuu
Sender:	Ebin :D
Submission time:	2022-11-02 20:53:09 +0200
Language:	Python3 (CPython3)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	TIME LIMIT EXCEEDED	0
#2	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	1, 2	details
#2	ACCEPTED	0.02 s	1, 2	details
#3	ACCEPTED	0.02 s	1, 2	details
#4	ACCEPTED	0.02 s	1, 2	details
#5	ACCEPTED	0.02 s	1, 2	details
#6	TIME LIMIT EXCEEDED	--	1, 2	details
#7	TIME LIMIT EXCEEDED	--	2	details
#8	WRONG ANSWER	0.64 s	1, 2	details
#9	TIME LIMIT EXCEEDED	--	2	details
#10	ACCEPTED	0.02 s	1, 2	details
#11	TIME LIMIT EXCEEDED	--	2	details
#12	RUNTIME ERROR	0.75 s	2	details
#13	TIME LIMIT EXCEEDED	--	2	details
#14	TIME LIMIT EXCEEDED	--	2	details
#15	TIME LIMIT EXCEEDED	--	1, 2	details
#16	WRONG ANSWER	0.27 s	1, 2	details
#17	ACCEPTED	0.04 s	1, 2	details
#18	TIME LIMIT EXCEEDED	--	1, 2	details
#19	WRONG ANSWER	0.04 s	1, 2	details
#20	WRONG ANSWER	0.33 s	1, 2	details
#21	TIME LIMIT EXCEEDED	--	2	details
#22	TIME LIMIT EXCEEDED	--	2	details
#23	TIME LIMIT EXCEEDED	--	2	details
#24	TIME LIMIT EXCEEDED	--	1, 2	details
#25	TIME LIMIT EXCEEDED	--	2	details
#26	TIME LIMIT EXCEEDED	--	1, 2	details
#27	TIME LIMIT EXCEEDED	--	2	details
#28	TIME LIMIT EXCEEDED	--	1, 2	details
#29	TIME LIMIT EXCEEDED	--	2	details
#30	TIME LIMIT EXCEEDED	--	1, 2	details
#31	TIME LIMIT EXCEEDED	--	2	details

Code

def main():
    # input:
    n = int(input(""))
    t = list(map(int, input("").split(" ")))
 
    l = []
 
    for i in range(n - 1):
        j = list(map(int, input("").split(" ")))
        l.append(j)
 
    # output
    # print(n, t, l)
    m = 0
    e = 0
    for i in range(1, n + 1):  # nodes one by one
        if t[i - 1] == 0:  # if node is dock
            continue
        # print("pelto", i)
        m += f(i, l, t, e)  # where is the closest dock
    print(m)
 
 
def f(e, l, t, h):  # returns the distance for e node
 
    m1 = 1000
    m2 = 1000
 
    for i in l:                         # checks the distances to the docks one by one
        if i[0] == h or i[1] == h:      # check that we don't go back the same route
            continue
 
        if e == i[0]:                   # if node being checked is 1st in i-list
            if t[i[1] - 1] == 0:        # if neighboring node is a dock
                m1 = i[2]                   # distance between node and neighbor
            else:                       # if neighboring node is a farm
                m1 = i[2] + f(i[1], l, t, e)# recursion
        elif e == i[1]:                 # if node being checked is 2nd in i-list
            if t[i[0] - 1] == 0:        # if neighboring node is a dock
                m1 = i[2]                   # distance between node and neighbor
            else:                       # if neighboring node is a farm
                m1 = i[2] + f(i[0], l, t, e)# recursion
        else:
            continue
 
        if m1 < m2:  # sorting
            m2 = m1
 
    # print(m2)
    return m2
 
 
main()

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
`1 0` view save

correct output
`0` view save

user output
`0` view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

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

correct output
`0` view save

user output
`0` view save

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
`4 1 0 1 1 1 2 10 2 3 20 2 4 30` view save

correct output
`60` view save

user output
`60` view save

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 1 1 1 0 1 2 10 2 3 20 3 4 30 ...` view save

correct output
`80` view save

user output
`80` view save

Test 5

Group: 1, 2

Verdict: ACCEPTED

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

correct output
`6` view save

user output
`6` view save

Test 6

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5506363` view save

user output
(empty)

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1795118520` view save

user output
(empty)

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 0 0 1 0 1 1 0 1 0 1 1 0 0 0 1 ...` view save

correct output
`293576` view save

user output
`267562` view save

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`816932444` view save

user output
(empty)

Test 10

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`3089` view save

user output
`3089` view save

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`40839` view save

user output
(empty)

Test 12

Group: 2

Verdict: RUNTIME ERROR

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5683983203973` view save

user output
(empty)

Error:

Traceback (most recent call last):
  File "/box/input/code.py", line 53, in <module>
    m...

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 1 1 1 1 1 1 0 0 0 1 1 0 1 0 ...` view save

correct output
`58572993` view save

user output
(empty)

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`32755` view save

user output
(empty)

Test 15

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`126238345` view save

user output
(empty)

Test 16

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 0 0 0 1 0 1 1 1 0 0 1 0 1 1 0 ...` view save

correct output
`278678` view save

user output
`252433` view save

Test 17

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 ...` view save

correct output
`34929` view save

user output
`34929` view save

Test 18

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1543963` view save

user output
(empty)

Test 19

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`39606` view save

user output
`39429` view save

Test 20

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 1 0 1 0 1 0 0 0 0 1 1 0 0 0 1 ...` view save

correct output
`321598` view save

user output
`283558` view save

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`978670626` view save

user output
(empty)

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`375218` view save

user output
(empty)

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 0 0 0 0 0 1 0 1 0 1 1 ...` view save

correct output
`60422556` view save

user output
(empty)

Test 24

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`291990` view save

user output
(empty)

Test 25

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`59607954` view save

user output
(empty)

Test 26

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`990` view save

user output
(empty)

Test 27

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`199982` view save

user output
(empty)

Test 28

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

input
`1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`7987` view save

user output
(empty)

Test 29

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`3137875` view save

user output
(empty)

Test 30

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

input
`1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`4657693` view save

user output
(empty)

Test 31

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1652889357` view save

user output
(empty)

Datatähti 2023 alku

Sadonkorjuu

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Tasks

Submissions (Ebin :D)