CSES - Datatähti 2023 alku

Submission details
Task:	Sadonkorjuu
Sender:	Parodontax
Submission time:	2022-11-04 16:00:35 +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	TIME LIMIT EXCEEDED	--	1, 2	details
#9	TIME LIMIT EXCEEDED	--	2	details
#10	TIME LIMIT EXCEEDED	--	1, 2	details
#11	TIME LIMIT EXCEEDED	--	2	details
#12	TIME LIMIT EXCEEDED	--	2	details
#13	TIME LIMIT EXCEEDED	--	2	details
#14	TIME LIMIT EXCEEDED	--	2	details
#15	RUNTIME ERROR	0.04 s	1, 2	details
#16	RUNTIME ERROR	0.04 s	1, 2	details
#17	RUNTIME ERROR	0.04 s	1, 2	details
#18	TIME LIMIT EXCEEDED	--	1, 2	details
#19	TIME LIMIT EXCEEDED	--	1, 2	details
#20	TIME LIMIT EXCEEDED	--	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

n = int(input())
k = input().split(" ")
k = list(map(int, k))
edges = []
for i in range(n - 1):
    a = input().split(" ")
    a = list(map(int, a))
    edges.append([a[0], a[1], a[2]])
graph = {}
for edge in edges:
    a, b, c = edge[0], edge[1], edge[2]
    if a not in graph.keys():
        graph[a] = []
    if b not in graph.keys():
        graph[b] = []
    graph[a].append([b, c])
    graph[b].append([a, c])

if len(graph.keys()) == 0: graph[1] = [[1, 0]]

def leveyshaku():
    q = [1]
    visited = [1]
    heights = {1: 1}
    e = {1: 0}
    while q:
        s = q.pop(0)
        for u in graph[s]:
            if u[0] in visited: continue
            visited.append(u[0])
            e[u[0]] = e[s] + u[1]
            heights[u[0]] = heights[s] + 1
            q.append(u[0])
    return e, heights

z = []
euler = {}
depth = []
def eulerTree(u, index):
    z.append(u)
    euler[index] = u
    depth.append(heights[u])
    index += 1
    for nbr in graph[u]:
        if nbr[0] not in z:
            index = eulerTree(nbr[0], index)
            euler[index] = u
            depth.append(heights[u])
            index += 1
    return index

def lca(node1, node2):
    minDist = 9999999999999
    for i in range(len(euler)):
        for j in range(i + 1, len(euler)):
            if (node1 == euler[i] and node2 == euler[j] or node2 == euler[i] and node1 == euler[j]) and minDist > abs(i-j):
                m = (min(i, j), max(i, j) + 1)
                minDist = abs(i-j)
    return min(depth[m[0]:m[1]])

def dist(pelto, satama):
    return values[pelto + 1] + values[satama + 1] - 2 * values[lca(pelto + 1, satama + 1)]

def findSatamas(pelto):
    satamas = []
    visited = [pelto]
    queue = [pelto]

    while queue:
        s = queue.pop(0)
        for neighbour in graph[s]:
            if neighbour[0] not in visited:
                if k[neighbour[0] - 1] == 0:
                    satamas.append(neighbour[0])
                else:
                    queue.append(neighbour[0])
                visited.append(neighbour[0])
    return satamas

values, heights = leveyshaku()
eulerTree(1, 1)
euler = list(euler.values())

ans = 0
while 1 in k:
    pelto = k.index(1)
    satamas = findSatamas(pelto + 1)
    costs = []
    for satama in satamas:
        costs.append(dist(pelto, satama - 1))
    ans += min(costs)
    k[pelto] = 2

print(ans)

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: TIME LIMIT EXCEEDED

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
(empty)

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: TIME LIMIT EXCEEDED

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
(empty)

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: TIME LIMIT EXCEEDED

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)

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: RUNTIME ERROR

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)

Error:

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

Test 16

Group: 1, 2

Verdict: RUNTIME ERROR

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
(empty)

Error:

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

Test 17

Group: 1, 2

Verdict: RUNTIME ERROR

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
(empty)

Error:

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

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: TIME LIMIT EXCEEDED

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
(empty)

Test 20

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

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 (Parodontax)