CSES - Datatähti 2016 alku - Results
 Task: Lennot Sender: Pohjantahti Submission time: 2015-10-02 22:56:25 Language: Python3 Status: READY Result: 24
Feedback
groupverdictscore
#1ACCEPTED24
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.10 s1details
#2ACCEPTED0.09 s1details
#3ACCEPTED0.09 s1details
#4ACCEPTED0.08 s1details
#5ACCEPTED0.10 s1details
#6ACCEPTED0.17 s2details
#70.67 s2details
#8ACCEPTED0.31 s2details
#90.38 s2details
#10ACCEPTED0.39 s2details
#11--3details
#12--3details
#13--3details
#14--3details
#15--3details
#16--3details
#17--3details

### Code

```from heapq import heappush, heappop

class Node:
def __init__(self):
self.neighbors = [] # tuple, [noden numero, matkan hinta]
self.stepNum = 0 # monesko node reitillä

# onko seuraava lento ilmainen
def nextFree(node):
return node.stepNum % 2 != 0

# etsi pienin hinta
def dijkstraSearch(nodes, startNode, endNode, infiniteVal, checkCycles, startingDistance, startingStep):
q = []
t = [0] * len(nodes)
e = [infiniteVal] * len(nodes)
e[startNode] = startingDistance
cycleNodes = []
nodes[startNode].stepNum = startingStep

heappush(q, (startingDistance, startNode))

while len(q) != 0:
current = heappop(q)

x = current[0] # etäisyysarvio
s = current[1] # noden numero
# print ('In node {} with distance {}'.format(s + 1, x))
if t[s] != 0:
continue
t[s] = 1

for i in range(0, len(nodes[s].neighbors)):
u = nodes[s].neighbors[i][0] # tämänhetkisen viereisen noden numero
# print ('Checking subnode {}'.format(u + 1))
dist = 0
if not nodes[s].nextFree():
dist = nodes[s].neighbors[i][1]
if x + dist < e[u]:
e[u] = x + dist
nodes[u].stepNum = nodes[s].stepNum + 1
heappush(q, (e[u], u))
# print ('Set node {} to {}'.format(u + 1, e[u]))
elif checkCycles and ((nodes[s].stepNum + 1) % 2 != nodes[u].stepNum % 2):
cycleNodes.append((u, x + dist, nodes[s].stepNum + 1))
# print ('Forced node {}'.format(u + 1))

distances = []
distances.append(e[endNode])

if checkCycles:
for i in range(0, len(cycleNodes)):
for j in range(0, len(nodes)):
nodes[j].stepNum = 0
distances.append(dijkstraSearch(nodes, cycleNodes[i][0], endNode, infiniteVal, False, cycleNodes[i][1], cycleNodes[i][2]))

return min(distances)

cityCount, flightCount = [int(x) for x in input().split(" ")]

nodes = [Node() for i in range(0, cityCount)] # kaupunki i on node i - 1 ts. kaupunki 1 on nodes[0]

for i in range(0, flightCount):
startCity, endCity, price = [int(x) for x in input().split(" ")]
nodes[startCity - 1].neighbors.append((endCity - 1, price))

infiniteVal = 1000000000 * flightCount + 1
cheapest = dijkstraSearch(nodes, 0, cityCount - 1, infiniteVal, True, 0, 0)

print (cheapest)```

### Test details

#### Test 1

Group: 1

Verdict: ACCEPTED

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

correct output
8

user output
8

#### Test 2

Group: 1

Verdict: ACCEPTED

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

correct output
9

user output
9

#### Test 3

Group: 1

Verdict: ACCEPTED

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

correct output
8

user output
8

#### Test 4

Group: 1

Verdict: ACCEPTED

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

correct output
13

user output
13

#### Test 5

Group: 1

Verdict: ACCEPTED

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

correct output
4

user output
4

#### Test 6

Group: 2

Verdict: ACCEPTED

input
1000 2000
91 828 365044406
17 984 445675537
251 852 100987451
907 487 58830088
...

correct output
11893353673

user output
11893353673

#### Test 7

Group: 2

Verdict:

input
1000 2000
722 939 530579090
404 606 268877348
133 750 760086153
506 46 582310443
...

correct output
30248963445

user output
32171097245

#### Test 8

Group: 2

Verdict: ACCEPTED

input
1000 2000
340 237 43690066
217 141 453160975
744 202 639037814
605 926 404985542
...

correct output
3126797692

user output
3126797692

#### Test 9

Group: 2

Verdict:

input
1000 2000
88 312 190442306
480 402 411574469
29 901 397491243
636 459 323246996
...

correct output
18416073173

user output
20018541839

#### Test 10

Group: 2

Verdict: ACCEPTED

input
1000 2000
333 228 718389176
796 286 323493090
743 43 751876815
128 554 175625940
...

correct output
6399349335

user output
6399349335

#### Test 11

Group: 3

Verdict:

input
100000 200000
28264 92686 186865663
92570 33956 925976418
87377 71249 644757113
16701 81203 922125505
...

correct output
518249578675

user output
(empty)

#### Test 12

Group: 3

Verdict:

input
100000 200000
95740 71482 846654568
44131 16806 670712211
3967 49254 424174139
39369 53007 830346557
...

correct output
920862321580

user output
(empty)

#### Test 13

Group: 3

Verdict:

input
100000 200000
79947 25489 71554257
59184 25577 328436360
82945 73554 4942918
22380 92385 874250042
...

correct output
399407698440

user output
(empty)

#### Test 14

Group: 3

Verdict:

input
100000 200000
31139 12960 580545990
27744 95556 747296719
46969 42578 840321561
5638 28960 513805324
...

correct output
165235287505

user output
(empty)

Group: 3

Verdict:

input
99993 199980
1 3 1
3 2 1
1 4 1
4 2 1
...

correct output
2

user output
(empty)

#### Test 16

Group: 3

Verdict:

input
100000 149994
93867 98509 1755709
85029 99843 1347591
10305 35305 6447
75638 80585 1829972
...

correct output
1124960

user output
(empty)

#### Test 17

Group: 3

Verdict:

input
100000 200000
70413 71496 49
15963 40963 18635
81291 89420 1850028
8848 33848 17316
...

correct output
110298

user output
(empty)