CSES - Datatähti 2016 alku - Results
Submission details
Task:Lennot
Sender:ollpu
Submission time:2015-10-03 14:26:22 +0300
Language:Python2
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.06 s1details
#20.05 s1details
#30.06 s1details
#4ACCEPTED0.06 s1details
#50.06 s1details
#60.17 s2details
#70.28 s2details
#80.10 s2details
#90.20 s2details
#100.15 s2details
#110.40 s3details
#120.40 s3details
#130.40 s3details
#140.40 s3details
#150.40 s3details
#160.40 s3details
#170.41 s3details

Code

#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys
from sys import stdin
from sys import stdout

def readline():
    return stdin.readline().strip()

line1 = readline().split(' ')
# Kaupunkeja
n = int(line1[0])
# Lentoja
m = int(line1[1])

class Flight:
    def __init__(self, a, b, h):
        self.fr = a
        self.to = b
        self.price = int(h)

class City:
    def __init__(self, aid):
        self.total_price_even = sys.maxint
        self.total_price_odd = sys.maxint
        self.calculated = False
        self.con_fr = []
        self.con_to = []
        self.aid = aid
        self.remove = False
    def __eq__(self, other):
        return (isinstance(other, self.__class__)
            and self.aid == other.aid)


flights = []
cities = []
for c in xrange(n):
    cities.append(City(c))

uncalculated = list(cities)

for f in xrange(m):
    row = readline().split(' ')
    flight = Flight(cities[int(row[0])-1], cities[int(row[1])-1], row[2])
    flights.append(flight)
    flight.fr.con_to.append(flight)
    flight.to.con_fr.append(flight)

# Purge all unnecessary cities
removes = []
for city_i in xrange(n):
    if city_i > 0:
        if city_i < len(cities)-1:
            city = cities[city_i]
            if len(city.con_to) == 0 or len(city.con_fr) == 0:
                for flight in city.con_to:
                    flights.remove(flight)
                for flight in city.con_fr:
                    flights.remove(flight)
                removes.append(city)
        else:
            break
for city in removes:
    cities.remove(city)

start = cities[0]
end = cities[-1]
current = cities[0]

current.total_price_even = 0
current.total_price_odd = 0


found = False
while not found:
    for flight in current.con_to:
        city = flight.to
        if not city.calculated:
            new_odd_price = current.total_price_even + flight.price
            if new_odd_price < city.total_price_odd:
                city.total_price_odd = new_odd_price
            
            new_even_price = current.total_price_odd
            if new_even_price < city.total_price_even:
                city.total_price_even = new_even_price
    uncalculated.remove(current)
    current.calculated = True
    if current == end:
        found = True
        print(min(current.total_price_even, current.total_price_odd))
        break
    
    smallest_price = sys.maxint
    for city in uncalculated:
        cityprice = city.total_price_even + city.total_price_odd
        if cityprice < smallest_price:
            smallest = city
            smallest_price = cityprice
    
    current = smallest

Test details

Test 1

Group: 1

Verdict:

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

correct output
8

user output
4

Test 2

Group: 1

Verdict:

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

correct output
9

user output
0

Test 3

Group: 1

Verdict:

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

correct output
8

user output
3

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:

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

correct output
4

user output
0

Test 6

Group: 2

Verdict:

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

correct output
11893353673

user output
12430518298

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
31520815312

Test 8

Group: 2

Verdict:

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

correct output
3126797692

user output
3673014602

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
19337432110

Test 10

Group: 2

Verdict:

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

correct output
6399349335

user output
6794239183

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)