CSES - Datatähti 2020 alku - Results
Submission details
Task:Mastot
Sender:CursedTomb
Submission time:2019-10-13 16:13:22 +0300
Language:CPython2
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1, 2, 3details
#20.01 s1, 2, 3details
#30.02 s1, 2, 3details
#40.02 s1, 2, 3details
#50.02 s1, 2, 3details
#60.02 s1, 2, 3details
#70.02 s1, 2, 3details
#80.02 s1, 2, 3details
#90.02 s1, 2, 3details
#100.02 s1, 2, 3details
#110.02 s1, 2, 3details
#120.02 s1, 2, 3details
#130.02 s1, 2, 3details
#140.02 s1, 2, 3details
#150.02 s1, 2, 3details
#160.02 s1, 2, 3details
#170.02 s1, 2, 3details
#180.02 s1, 2, 3details
#190.02 s1, 2, 3details
#200.02 s1, 2, 3details
#21--2, 3details
#22--2, 3details
#23--2, 3details
#24--2, 3details
#25--2, 3details
#26--2, 3details
#27--2, 3details
#28--2, 3details
#29--2, 3details
#30--2, 3details
#31--2, 3details
#32--2, 3details
#33--2, 3details
#34--3details
#35--3details
#36--3details
#37--3details
#38--3details
#39--3details
#40--3details
#41--3details
#42--3details
#43--3details
#44--3details
#45--3details
#46--3details

Code

x = input() 
distance = list(map(int, raw_input().strip().split()))
cost = [0]
a = list(map(int, raw_input().strip().split()))
#x = 6
#distance = [2,2,3,1,2,4]
#a = [4,1,3,4,2]
for i in a:
	cost.append(i)

dictionary = {}
for i in range(x):
	dictionary[i]=[]

for i in range(x):
	for connections in range(i+1, i+distance[i]+1):
		if connections > x:
			break
		dictionary[i].append(connections)
	dictionary[i]= dictionary[i], cost[i]


visited = {0:0}
path = {}
nodes = set(range(x))

while nodes:
	min_node = None
	for node in nodes:
		if node in visited:
			if min_node is None:
				min_node= node
			elif visited[node] < visited[min_node]:
				min_node = node

	if min_node is None:
		break

	nodes.remove(min_node)
	weight = visited[min_node]
	for edge in dictionary[min_node][0]:
		weight = weight + dictionary[min_node][1]
		if edge not in visited or weight < visited[edge]:
			visited[edge] = weight
			path[edge] = min_node
sum = 0
#print visited
for values in path.values():
	sum  += values

#print dictionary
print sum - path[x]-path[x-1]-1

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
-1

Test 3

Group: 1, 2, 3

Verdict:

input
2
2 1
1

correct output
0

user output
-1

Test 4

Group: 1, 2, 3

Verdict:

input
3
2 2 1
1 2

correct output
1

user output
-1

Test 5

Group: 1, 2, 3

Verdict:

input
3
2 2 1
2 1

correct output
1

user output
-1

Test 6

Group: 1, 2, 3

Verdict:

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

correct output
3000000000

user output
0

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
152

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
151

Test 9

Group: 1, 2, 3

Verdict:

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

correct output
0

user output
-1

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
5

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
137

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
133

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
132

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
111

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
103

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
107

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
121

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
122

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
42

Test 20

Group: 1, 2, 3

Verdict:

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

correct output
660514815

user output
-1

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

Test 22

Group: 2, 3

Verdict:

input
5000
5000 5000 5000 5000 5000 5000 ...

correct output
0

user output
(empty)

Test 23

Group: 2, 3

Verdict:

input
5000
4999 4998 4997 4996 4995 4994 ...

correct output
576616581

user output
(empty)

Test 24

Group: 2, 3

Verdict:

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

correct output
671570

user output
(empty)

Test 25

Group: 2, 3

Verdict:

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

correct output
85700253

user output
(empty)

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

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

Test 28

Group: 2, 3

Verdict:

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

correct output
3584707

user output
(empty)

Test 29

Group: 2, 3

Verdict:

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

correct output
3210354

user output
(empty)

Test 30

Group: 2, 3

Verdict:

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

correct output
3177107

user output
(empty)

Test 31

Group: 2, 3

Verdict:

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

correct output
4863018

user output
(empty)

Test 32

Group: 2, 3

Verdict:

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

correct output
2876923

user output
(empty)

Test 33

Group: 2, 3

Verdict:

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

correct output
5194452

user output
(empty)

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

Test 35

Group: 3

Verdict:

input
200000
200000 200000 200000 200000 20...

correct output
0

user output
(empty)

Test 36

Group: 3

Verdict:

input
200000
199999 199998 199997 199996 19...

correct output
819945000

user output
(empty)

Test 37

Group: 3

Verdict:

input
200000
9036 179861 197509 187949 9444...

correct output
59563

user output
(empty)

Test 38

Group: 3

Verdict:

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

correct output
247414000

user output
(empty)

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

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

Test 41

Group: 3

Verdict:

input
200000
9473 42975 69773 60909 9354 20...

correct output
76814

user output
(empty)

Test 42

Group: 3

Verdict:

input
200000
31087 18493 14158 65333 95850 ...

correct output
180614

user output
(empty)

Test 43

Group: 3

Verdict:

input
200000
66563 17340 2293 5101 35636 96...

correct output
56642

user output
(empty)

Test 44

Group: 3

Verdict:

input
200000
4005 35201 22254 56956 49098 7...

correct output
287201

user output
(empty)

Test 45

Group: 3

Verdict:

input
200000
99266 91407 53419 70750 93505 ...

correct output
54045

user output
(empty)

Test 46

Group: 3

Verdict:

input
199999
23098 95019 27998 22880 40713 ...

correct output
184595

user output
(empty)