結果
問題 | No.1545 [Cherry 2nd Tune N] Anthem |
ユーザー | ygd. |
提出日時 | 2021-06-15 23:35:04 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,440 bytes |
コンパイル時間 | 277 ms |
コンパイル使用メモリ | 87,128 KB |
実行使用メモリ | 252,096 KB |
最終ジャッジ日時 | 2023-08-27 20:32:35 |
合計ジャッジ時間 | 34,994 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
71,452 KB |
testcase_01 | AC | 93 ms
71,776 KB |
testcase_02 | AC | 92 ms
71,660 KB |
testcase_03 | AC | 92 ms
71,844 KB |
testcase_04 | AC | 197 ms
87,344 KB |
testcase_05 | AC | 587 ms
126,420 KB |
testcase_06 | AC | 512 ms
112,184 KB |
testcase_07 | AC | 253 ms
90,600 KB |
testcase_08 | AC | 977 ms
116,584 KB |
testcase_09 | AC | 689 ms
101,004 KB |
testcase_10 | AC | 214 ms
92,572 KB |
testcase_11 | AC | 349 ms
107,392 KB |
testcase_12 | AC | 421 ms
114,088 KB |
testcase_13 | AC | 218 ms
85,452 KB |
testcase_14 | AC | 231 ms
103,944 KB |
testcase_15 | AC | 170 ms
87,648 KB |
testcase_16 | AC | 271 ms
112,372 KB |
testcase_17 | AC | 696 ms
94,276 KB |
testcase_18 | AC | 469 ms
138,572 KB |
testcase_19 | AC | 401 ms
106,680 KB |
testcase_20 | AC | 388 ms
88,704 KB |
testcase_21 | AC | 300 ms
117,236 KB |
testcase_22 | AC | 324 ms
135,512 KB |
testcase_23 | AC | 465 ms
100,692 KB |
testcase_24 | AC | 217 ms
82,720 KB |
testcase_25 | AC | 204 ms
80,560 KB |
testcase_26 | AC | 111 ms
77,452 KB |
testcase_27 | AC | 186 ms
80,020 KB |
testcase_28 | AC | 211 ms
81,532 KB |
testcase_29 | AC | 226 ms
81,544 KB |
testcase_30 | AC | 209 ms
81,336 KB |
testcase_31 | AC | 228 ms
81,664 KB |
testcase_32 | AC | 171 ms
79,000 KB |
testcase_33 | AC | 251 ms
83,376 KB |
testcase_34 | AC | 234 ms
82,216 KB |
testcase_35 | AC | 289 ms
82,600 KB |
testcase_36 | AC | 278 ms
82,732 KB |
testcase_37 | AC | 165 ms
79,116 KB |
testcase_38 | AC | 240 ms
81,536 KB |
testcase_39 | AC | 179 ms
78,952 KB |
testcase_40 | AC | 216 ms
80,820 KB |
testcase_41 | AC | 165 ms
79,132 KB |
testcase_42 | AC | 241 ms
83,044 KB |
testcase_43 | AC | 244 ms
82,228 KB |
testcase_44 | AC | 119 ms
79,240 KB |
testcase_45 | AC | 93 ms
71,760 KB |
testcase_46 | AC | 243 ms
87,364 KB |
testcase_47 | AC | 243 ms
88,184 KB |
testcase_48 | AC | 304 ms
96,748 KB |
testcase_49 | AC | 382 ms
91,236 KB |
testcase_50 | AC | 533 ms
97,472 KB |
testcase_51 | AC | 230 ms
102,236 KB |
testcase_52 | AC | 541 ms
97,236 KB |
testcase_53 | AC | 292 ms
89,832 KB |
testcase_54 | AC | 189 ms
93,620 KB |
testcase_55 | AC | 463 ms
93,868 KB |
testcase_56 | AC | 125 ms
79,120 KB |
testcase_57 | AC | 444 ms
103,420 KB |
testcase_58 | AC | 310 ms
89,292 KB |
testcase_59 | AC | 215 ms
89,888 KB |
testcase_60 | AC | 141 ms
85,884 KB |
testcase_61 | AC | 256 ms
89,884 KB |
testcase_62 | AC | 381 ms
96,284 KB |
testcase_63 | AC | 294 ms
96,976 KB |
testcase_64 | TLE | - |
testcase_65 | AC | 517 ms
91,888 KB |
testcase_66 | WA | - |
ソースコード
from heapq import heapify, heappop, heappush from collections import deque def main(): N,S,T,K = map(int,input().split()); INF = float("inf") S-=1;T-=1 #0-index X = list(map(int,input().split())) G = [[] for _ in range(N)] M = int(input()) for _ in range(M): A,B,Y = map(int,input().split()) A-=1;B-=1 G[A].append((Y,B)) Q = deque([]) Q.append(S) d_bfs = [INF]*N d_bfs[S] = 1 while Q: v = Q.popleft() for cost, u in G[v]: if d_bfs[u] != INF: continue d_bfs[u] = d_bfs[v] + 1 Q.append(u) if d_bfs[T] == INF: print("Impossible");exit() def dijkstra_heap2(s,G,t,K): INF = float("inf") #S:start, V: node, E: Edge, G: Graph V = len(G) #dp[i][j]: i番目の歌を歌って今j曲目(i番目の歌を含む) if K <= 10: MAX = 20 elif K <= 130: MAX = 1000 else: MAX = pow(10,5) dp = [[INF]*MAX for _ in range(V)] #d = [INF for _ in range(V)] dp[s][1] = X[s] prev = [[-1]*MAX for _ in range(V)] PQ = [] heappush(PQ,(X[s],s,1)) #時間, 位置, 何曲目 while PQ: c,v,n = heappop(PQ) if v == t and n >= K: break if dp[v][n] < c: continue dp[v][n] = c #if n+1 >= MAX: #これ以上は配列外参照 # continue for cost,u in G[v]: nxt = min(n+1, MAX-1) if dp[u][nxt] <= cost + X[u] + dp[v][n]: continue dp[u][nxt] = cost + X[u] + dp[v][n] prev[u][nxt] = v heappush(PQ,(dp[u][nxt], u, nxt)) return dp, prev d, keiro = dijkstra_heap2(S,G,T,K) #print(d) #print(keiro) ans = INF num = INF #何曲か for i in range(K,len(d[T])): if d[T][i] < ans: ans = d[T][i] num = i if ans == INF: print("Impossible") else: print("Possible") print(ans) print(num) ret = [T+1] #1-index #num -= 1 now = T while num > 1: pre = keiro[now][num] ret.append(pre+1) #1-index now = pre num -= 1 ret.reverse() print(*ret) if __name__ == '__main__': main()