CSES - Datatähti 2020 alku - Results
Submission details
Task:Mastot
Sender:TrixterTheTux
Submission time:2019-10-11 21:40:02 +0300
Language:PyPy2
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1, 2, 3details
#20.04 s1, 2, 3details
#30.04 s1, 2, 3details
#40.04 s1, 2, 3details
#50.04 s1, 2, 3details
#60.04 s1, 2, 3details
#70.04 s1, 2, 3details
#80.04 s1, 2, 3details
#90.04 s1, 2, 3details
#100.04 s1, 2, 3details
#110.04 s1, 2, 3details
#120.04 s1, 2, 3details
#130.04 s1, 2, 3details
#140.04 s1, 2, 3details
#150.04 s1, 2, 3details
#160.04 s1, 2, 3details
#170.04 s1, 2, 3details
#180.04 s1, 2, 3details
#190.04 s1, 2, 3details
#200.04 s1, 2, 3details
#210.04 s2, 3details
#220.04 s2, 3details
#230.04 s2, 3details
#240.04 s2, 3details
#250.04 s2, 3details
#260.04 s2, 3details
#270.04 s2, 3details
#280.04 s2, 3details
#290.04 s2, 3details
#300.04 s2, 3details
#310.04 s2, 3details
#320.04 s2, 3details
#330.04 s2, 3details
#340.04 s3details
#350.04 s3details
#360.04 s3details
#370.04 s3details
#380.04 s3details
#390.04 s3details
#400.04 s3details
#410.04 s3details
#420.04 s3details
#430.04 s3details
#440.04 s3details
#450.04 s3details
#460.04 s3details

Code

import heapq

# goal = int(raw_input())
# transmitters = [int(x) for x in raw_input().split()]
# costs = [1] + [int(x) for x in raw_input().split()]

goal = 6
transmitters = [2, 2, 3, 1, 2, 4]
costs = [1, 4, 1, 3, 4, 2]

def educatedGuess(node):
    return goal - node - 1

def dijkstra(graph, fromNode, toNode):
    costs = dict()
    heap = [(0, 0, fromNode)]
    explored = set()

    while heap:
        totalCost, realCost, node = heapq.heappop(heap)

        if node == toNode:
            return realCost - 1

        if node in explored:
            continue

        explored.add(node)

        neighbours = graph[node] if node in graph else None
        if not neighbours:
            continue

        for neighbourNode in neighbours:
            if neighbourNode in explored:
                continue

            cost = neighbours[neighbourNode]
            newCost = totalCost + cost + educatedGuess(neighbourNode)

            if neighbourNode not in costs:
                costs[neighbourNode] = newCost
                heapq.heappush(heap, (newCost, realCost + cost, neighbourNode))
            else:
                if newCost < costs[neighbourNode]:
                    costs[neighbourNode] = newCost
                    heapq.heappush(heap, (newCost, realCost + cost, neighbourNode))

graph = dict()
for index, distance in enumerate(transmitters):
    cost = costs[index]

    nearbyNodes = dict()
    for x in range(index + 1, index + 1 + distance):
        nearbyNodes[x] = cost

    graph[index] = nearbyNodes

print(dijkstra(graph, 0, goal))

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
6
2 2 3 1 2 4
4 1 3 4 2

correct output
3

user output
3

Test 2

Group: 1, 2, 3

Verdict:

input
2
1 1
1

correct output
1

user output
3

Test 3

Group: 1, 2, 3

Verdict:

input
2
2 1
1

correct output
0

user output
3

Test 4

Group: 1, 2, 3

Verdict:

input
3
2 2 1
1 2

correct output
1

user output
3

Test 5

Group: 1, 2, 3

Verdict:

input
3
2 2 1
2 1

correct output
1

user output
3

Test 6

Group: 1, 2, 3

Verdict:

input
4
1 1 1 1
1000000000 1000000000 10000000...

correct output
3000000000

user output
3

Test 7

Group: 1, 2, 3

Verdict:

input
20
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
19000000000

user output
3

Test 8

Group: 1, 2, 3

Verdict:

input
20
1 1 2 1 1 1 2 1 1 2 1 1 1 2 1 ...

correct output
4609157377

user output
3

Test 9

Group: 1, 2, 3

Verdict:

input
20
20 20 20 20 20 20 20 20 20 20 ...

correct output
0

user output
3

Test 10

Group: 1, 2, 3

Verdict:

input
19
16 10 9 17 1 16 19 4 18 13 5 3...

correct output
8424700

user output
3

Test 11

Group: 1, 2, 3

Verdict:

input
20
2 4 3 4 4 4 4 1 1 3 4 2 1 3 3 ...

correct output
2817777553

user output
3

Test 12

Group: 1, 2, 3

Verdict:

input
20
4 4 4 4 3 4 1 3 4 1 1 4 1 3 1 ...

correct output
3020673750

user output
3

Test 13

Group: 1, 2, 3

Verdict:

input
20
5 1 3 4 2 4 2 2 5 1 3 3 2 4 1 ...

correct output
2064735712

user output
3

Test 14

Group: 1, 2, 3

Verdict:

input
20
8 1 2 6 8 6 9 1 4 9 9 8 6 3 3 ...

correct output
378551508

user output
3

Test 15

Group: 1, 2, 3

Verdict:

input
20
5 2 8 9 4 10 1 8 9 9 8 1 7 8 9...

correct output
457149308

user output
3

Test 16

Group: 1, 2, 3

Verdict:

input
20
7 6 2 6 1 3 10 4 6 3 5 2 2 10 ...

correct output
471575451

user output
3

Test 17

Group: 1, 2, 3

Verdict:

input
20
6 2 2 3 8 7 2 10 8 9 6 3 10 5 ...

correct output
620685913

user output
3

Test 18

Group: 1, 2, 3

Verdict:

input
20
4 5 3 8 2 8 5 9 6 3 7 5 1 6 9 ...

correct output
1132427688

user output
3

Test 19

Group: 1, 2, 3

Verdict:

input
20
15 9 7 18 3 20 19 20 17 16 16 ...

correct output
333300698

user output
3

Test 20

Group: 1, 2, 3

Verdict:

input
20
19 18 17 16 15 14 13 12 11 10 ...

correct output
660514815

user output
3

Test 21

Group: 2, 3

Verdict:

input
5000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
4999000000000

user output
3

Test 22

Group: 2, 3

Verdict:

input
5000
5000 5000 5000 5000 5000 5000 ...

correct output
0

user output
3

Test 23

Group: 2, 3

Verdict:

input
5000
4999 4998 4997 4996 4995 4994 ...

correct output
576616581

user output
3

Test 24

Group: 2, 3

Verdict:

input
5000
3343 3711 2568 137 2621 3850 4...

correct output
671570

user output
3

Test 25

Group: 2, 3

Verdict:

input
5000
119 203 420 133 175 334 461 10...

correct output
85700253

user output
3

Test 26

Group: 2, 3

Verdict:

input
5000
8 6 2 1 4 5 7 3 4 2 1 10 3 6 6...

correct output
193210576015

user output
3

Test 27

Group: 2, 3

Verdict:

input
5000
1 2 1 2 2 1 2 2 1 1 1 2 1 2 2 ...

correct output
1576581428593

user output
3

Test 28

Group: 2, 3

Verdict:

input
5000
300 1937 2136 770 429 2388 197...

correct output
3584707

user output
3

Test 29

Group: 2, 3

Verdict:

input
5000
949 46 29 2237 2413 36 42 1162...

correct output
3210354

user output
3

Test 30

Group: 2, 3

Verdict:

input
5000
1557 1727 1787 360 1698 2423 1...

correct output
3177107

user output
3

Test 31

Group: 2, 3

Verdict:

input
5000
484 1991 2309 1326 1901 2426 8...

correct output
4863018

user output
3

Test 32

Group: 2, 3

Verdict:

input
5000
1833 459 1994 2050 272 31 708 ...

correct output
2876923

user output
3

Test 33

Group: 2, 3

Verdict:

input
4999
530 2248 1916 859 2394 1403 24...

correct output
5194452

user output
3

Test 34

Group: 3

Verdict:

input
200000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
199999000000000

user output
3

Test 35

Group: 3

Verdict:

input
200000
200000 200000 200000 200000 20...

correct output
0

user output
3

Test 36

Group: 3

Verdict:

input
200000
199999 199998 199997 199996 19...

correct output
819945000

user output
3

Test 37

Group: 3

Verdict:

input
200000
9036 179861 197509 187949 9444...

correct output
59563

user output
3

Test 38

Group: 3

Verdict:

input
200000
357 1516 141 399 860 1591 544 ...

correct output
247414000

user output
3

Test 39

Group: 3

Verdict:

input
200000
10 4 1 7 1 8 8 4 8 2 2 4 2 4 8...

correct output
7789595210075

user output
3

Test 40

Group: 3

Verdict:

input
200000
1 2 1 1 1 1 2 1 2 2 1 2 2 2 2 ...

correct output
62777824801872

user output
3

Test 41

Group: 3

Verdict:

input
200000
9473 42975 69773 60909 9354 20...

correct output
76814

user output
3

Test 42

Group: 3

Verdict:

input
200000
31087 18493 14158 65333 95850 ...

correct output
180614

user output
3

Test 43

Group: 3

Verdict:

input
200000
66563 17340 2293 5101 35636 96...

correct output
56642

user output
3

Test 44

Group: 3

Verdict:

input
200000
4005 35201 22254 56956 49098 7...

correct output
287201

user output
3

Test 45

Group: 3

Verdict:

input
200000
99266 91407 53419 70750 93505 ...

correct output
54045

user output
3

Test 46

Group: 3

Verdict:

input
199999
23098 95019 27998 22880 40713 ...

correct output
184595

user output
3