Task: | Lennot |
Sender: | ollpu |
Submission time: | 2015-10-10 12:09:13 +0300 |
Language: | Python2 |
Status: | READY |
Result: | 24 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 24 |
#2 | RUNTIME ERROR | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.06 s | 1 | details |
#2 | ACCEPTED | 0.05 s | 1 | details |
#3 | ACCEPTED | 0.06 s | 1 | details |
#4 | ACCEPTED | 0.06 s | 1 | details |
#5 | ACCEPTED | 0.06 s | 1 | details |
#6 | ACCEPTED | 0.07 s | 2 | details |
#7 | ACCEPTED | 0.06 s | 2 | details |
#8 | RUNTIME ERROR | 0.07 s | 2 | details |
#9 | ACCEPTED | 0.08 s | 2 | details |
#10 | ACCEPTED | 0.07 s | 2 | details |
#11 | TIME LIMIT EXCEEDED | -- | 3 | details |
#12 | TIME LIMIT EXCEEDED | -- | 3 | details |
#13 | TIME LIMIT EXCEEDED | -- | 3 | details |
#14 | TIME LIMIT EXCEEDED | -- | 3 | details |
#15 | RUNTIME ERROR | 0.85 s | 3 | details |
#16 | RUNTIME ERROR | 0.81 s | 3 | details |
#17 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#!/usr/bin/env python # -*- coding: utf-8 -*- import sys from sys import stdin from sys import stdout import gc # import profile # debug maxint = sys.maxint def readline(): return stdin.readline().strip() line1 = readline().split(' ') # Kaupunkeja n = int(line1[0]) # Lentoja m = int(line1[1]) # Tuple indexes fl_from = 0 fl_to = 1 fl_price = 2 ct_total_price_even = 0 ct_even_price_set = 1 ct_total_price_odd = 2 ct_odd_price_set = 3 ct_total_price = 4 ct_calculated = 5 ct_con_to = 6 ct_in_uncalc = 7 ct_aid = 8 def init_city(aid): return [maxint, False, maxint, False, maxint, False, [], False, aid] # class City: # def __init__(self, aid): # self.total_price_even = maxint # self.even_price_set = False # self.total_price_odd = maxint # self.odd_price_set = False # self.total_price = maxint # self.calculated = False # self.con_to = [] # self.in_uncalc = False # self.aid = aid def run(): cities = [] for c in xrange(n): cities.append(init_city(c)) for f in xrange(m): row = readline().split(' ') flight = (cities[int(row[0])-1], cities[int(row[1])-1], int(row[2])) flight[fl_from][ct_con_to].append(flight) # Purge all unnecessary cities removes = [] for city_i in xrange(1, n-1): city = cities[city_i] if len(city[ct_con_to]) == 0: removes.append(city) for city in removes: cities.remove(city) gc.collect() start = cities[0] end = cities[-1] current = start uncalculated = [current] current[ct_total_price_even] = 0 current[ct_even_price_set] = True def select_next(): if len(uncalculated) != 0: smallest_price = maxint for city in reversed(uncalculated): # cityprice = city.total_price_even + city.total_price_odd cityprice = city[ct_total_price] if cityprice < smallest_price: smallest = city smallest_price = cityprice return smallest found = False while not found: for flight in current[ct_con_to]: city = flight[fl_to] price_changed = False if current[ct_even_price_set]: new_odd_price = current[ct_total_price_even] + flight[fl_price] if new_odd_price < city[ct_total_price_odd]: city[ct_total_price_odd] = new_odd_price city[ct_odd_price_set] = True price_changed = True if current[ct_odd_price_set]: new_even_price = current[ct_total_price_odd] if new_even_price < city[ct_total_price_even]: city[ct_total_price_even] = new_even_price city[ct_even_price_set] = True price_changed = True if price_changed: price = city[ct_total_price] = min(city[ct_total_price_even], city[ct_total_price_odd]) if city[ct_calculated]: city[ct_calculated] = False uncalculated.append(city) city[ct_in_uncalc] = True if not city[ct_in_uncalc]: uncalculated.append(city) city[ct_in_uncalc] = True uncalculated.remove(current) current[ct_calculated] = True if current[ct_aid] == end[ct_aid]: found = True print(end[ct_total_price]) break current = select_next() # profile.run('run()') run()
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: RUNTIME ERROR
input |
---|
1000 2000 340 237 43690066 217 141 453160975 744 202 639037814 605 926 404985542 ... |
correct output |
---|
3126797692 |
user output |
---|
(empty) |
Error:
Traceback (most recent call last): File "input/code.py", line 137, in <module> run() File "input/code.py", line 127, in run uncalculated.remove(current) RuntimeError: maximum recursion depth exceeded in cmp
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: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
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: RUNTIME ERROR
input |
---|
99993 199980 1 3 1 3 2 1 1 4 1 4 2 1 ... |
correct output |
---|
2 |
user output |
---|
(empty) |
Error:
Traceback (most recent call last): File "input/code.py", line 137, in <module> run() File "input/code.py", line 127, in run uncalculated.remove(current) RuntimeError: maximum recursion depth exceeded in cmp
Test 16
Group: 3
Verdict: RUNTIME ERROR
input |
---|
100000 149994 93867 98509 1755709 85029 99843 1347591 10305 35305 6447 75638 80585 1829972 ... |
correct output |
---|
1124960 |
user output |
---|
(empty) |
Error:
Traceback (most recent call last): File "input/code.py", line 137, in <module> run() File "input/code.py", line 127, in run uncalculated.remove(current) RuntimeError: maximum recursion depth exceeded in cmp
Test 17
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 200000 70413 71496 49 15963 40963 18635 81291 89420 1850028 8848 33848 17316 ... |
correct output |
---|
110298 |
user output |
---|
(empty) |