Task: | Lennot |
Sender: | 6502 |
Submission time: | 2015-09-30 21:04:43 +0300 |
Language: | Python3 |
Status: | READY |
Result: | 24 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 24 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.11 s | 1 | details |
#2 | ACCEPTED | 0.08 s | 1 | details |
#3 | ACCEPTED | 0.08 s | 1 | details |
#4 | ACCEPTED | 0.17 s | 1 | details |
#5 | ACCEPTED | 0.10 s | 1 | details |
#6 | TIME LIMIT EXCEEDED | -- | 2 | details |
#7 | TIME LIMIT EXCEEDED | -- | 2 | details |
#8 | TIME LIMIT EXCEEDED | -- | 2 | details |
#9 | TIME LIMIT EXCEEDED | -- | 2 | details |
#10 | TIME LIMIT EXCEEDED | -- | 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 | TIME LIMIT EXCEEDED | -- | 3 | details |
#16 | TIME LIMIT EXCEEDED | -- | 3 | details |
#17 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
__import__("sys").setrecursionlimit(10000) def rec_price(city,free,paid_cities,dpaid_cities): p=2147483647 if city==n: return 0 for f in flights[city]: if f[0] not in dpaid_cities: t,d=paid_cities[:],dpaid_cities[:] if not free: if city in t: d+=[city] else: t+=[city] x=rec_price(f[0],not free,t,d)+f[1]*(not free) p=min(p,x) return p def ite_price(city=1): free = False paid_cities = [0 for _ in range(n+1)] cities = [] prices = [2147483647] fprices = [] iteras = [] i = 0 depth = 1 added = 0 while depth > 0: added = 0 flightlist = flights[city] if city == n: prices[-1]=0 else: while i < len(flightlist): f = flightlist[i] if paid_cities[f[0]] < 2: if not free: paid_cities[f[0]]+=1 fprices.append(f[1]) else: fprices.append(0) added = 1 cities.append(city) iteras.append(i+1) if len(prices) <= depth: prices.append(2147483647) city=f[0] i=0 depth+=1 free = not free break i += 1 if not added: if depth > 1: free = not free if not free: paid_cities[city]-=1 i = iteras.pop() pr = prices.pop() fp = fprices.pop() city = cities.pop() prices[-1] = min(prices[-1],pr+fp) depth -= 1 return prices[0] n,m=map(int,input().split(" ")) flights=[[] for _ in range(n+1)] for i in range(m): l=list(map(int,input().split(" "))) flights[l[0]]+=[l[1:]] rec = False if rec: print(rec_price(1,False,[],[])) else: print(ite_price())
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: TIME LIMIT EXCEEDED
input |
---|
1000 2000 91 828 365044406 17 984 445675537 251 852 100987451 907 487 58830088 ... |
correct output |
---|
11893353673 |
user output |
---|
(empty) |
Test 7
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 2000 722 939 530579090 404 606 268877348 133 750 760086153 506 46 582310443 ... |
correct output |
---|
30248963445 |
user output |
---|
(empty) |
Test 8
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 2000 340 237 43690066 217 141 453160975 744 202 639037814 605 926 404985542 ... |
correct output |
---|
3126797692 |
user output |
---|
(empty) |
Test 9
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 2000 88 312 190442306 480 402 411574469 29 901 397491243 636 459 323246996 ... |
correct output |
---|
18416073173 |
user output |
---|
(empty) |
Test 10
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000 2000 333 228 718389176 796 286 323493090 743 43 751876815 128 554 175625940 ... |
correct output |
---|
6399349335 |
user output |
---|
(empty) |
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: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
input |
---|
100000 200000 70413 71496 49 15963 40963 18635 81291 89420 1850028 8848 33848 17316 ... |
correct output |
---|
110298 |
user output |
---|
(empty) |