CSES - Datatähti 2016 alku - Results
Submission details
Task:Lennot
Sender:AnttiR
Submission time:2015-10-10 20:33:26
Language:Python3
Status:READY
Result:61
Feedback
groupverdictscore
#1ACCEPTED24
#2ACCEPTED37
#30
Test results
testverdicttimegroup
#1ACCEPTED0.09 s1details
#2ACCEPTED0.09 s1details
#3ACCEPTED0.08 s1details
#4ACCEPTED0.08 s1details
#5ACCEPTED0.08 s1details
#6ACCEPTED0.25 s2details
#7ACCEPTED0.48 s2details
#8ACCEPTED0.15 s2details
#9ACCEPTED0.35 s2details
#10ACCEPTED0.19 s2details
#11--3details
#12--3details
#13--3details
#14--3details
#15--3details
#16--3details
#17--3details

Code

highestPrice = 10**12
class Node:
	def __init__(self):
		self.connections = [] # Tuples of node 's and ints (prices)
		self.cheapest = [highestPrice,highestPrice] #even, odd
		# If moving from a node's odd cost, the flight is free!

nodes, connections = [int(x) for x in input().split(" ")]
notFoundNodes = []
for ni in range(0,nodes):
	newNode = Node()
	notFoundNodes.append(newNode)

for ci in range(0,connections):
	o,t,p = [int(x) for x in input().split(" ")]
	notFoundNodes[o-1].connections.append((notFoundNodes[t-1],p))
  
notFoundNodes[0].cheapest[0] = 0

cheapestTotalPrice = 0

# Djikstra with a few modifications
while True:
	smallestPrice = highestPrice
	smallestPriceNode = []
	
	# Find cheapest node
	for nd in notFoundNodes:
		evenPrice = nd.cheapest[0]
		oddPrice = nd.cheapest[1]
		if evenPrice == -1:
			if oddPrice != -1:
				if oddPrice < smallestPrice:
					smallestPriceNode = [nd,1]
					smallestPrice = oddPrice
		elif oddPrice == -1:
			if evenPrice != -1:
				if evenPrice < smallestPrice:
					smallestPriceNode = [nd,0]
					smallestPrice = evenPrice
		else:
			if oddPrice < evenPrice:
				if oddPrice < smallestPrice:
					smallestPriceNode = [nd,1]
					smallestPrice = oddPrice
			else:
				if evenPrice < smallestPrice:
					smallestPriceNode = [nd,0]
					smallestPrice = evenPrice
					
	# Update connections of cheapest node
	cn = smallestPriceNode[0]
	if cn is notFoundNodes[-1]:
		cheapestTotalPrice = smallestPrice
		break
	oe = (smallestPriceNode[1] + 1) % 2
	for co in cn.connections:
		cost = smallestPrice + co[1] * oe
		target = co[0]
		if target.cheapest[oe] > cost:
			target.cheapest[oe] = cost
			
	# Nullify the current node
	cn.cheapest[smallestPriceNode[1]] = -1
	if cn.cheapest[0] == -1 and cn.cheapest[1] == -1:
		notFoundNodes.remove(cn)

print (cheapestTotalPrice)

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: ACCEPTED

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

correct output
30248963445

user output
30248963445

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: ACCEPTED

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

correct output
18416073173

user output
18416073173

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)

Test 15

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)