結果
問題 | No.1545 [Cherry 2nd Tune N] Anthem |
ユーザー | ygd. |
提出日時 | 2021-06-15 23:17:23 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,400 bytes |
コンパイル時間 | 296 ms |
コンパイル使用メモリ | 87,172 KB |
実行使用メモリ | 241,844 KB |
最終ジャッジ日時 | 2023-08-27 20:06:58 |
合計ジャッジ時間 | 34,892 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 91 ms
71,588 KB |
testcase_01 | AC | 89 ms
71,672 KB |
testcase_02 | AC | 91 ms
71,192 KB |
testcase_03 | AC | 91 ms
71,188 KB |
testcase_04 | AC | 206 ms
87,188 KB |
testcase_05 | AC | 582 ms
126,448 KB |
testcase_06 | AC | 499 ms
112,252 KB |
testcase_07 | AC | 257 ms
90,624 KB |
testcase_08 | AC | 915 ms
116,224 KB |
testcase_09 | AC | 664 ms
101,472 KB |
testcase_10 | AC | 215 ms
92,628 KB |
testcase_11 | AC | 334 ms
107,224 KB |
testcase_12 | AC | 402 ms
113,464 KB |
testcase_13 | AC | 217 ms
85,456 KB |
testcase_14 | AC | 227 ms
103,892 KB |
testcase_15 | AC | 167 ms
86,996 KB |
testcase_16 | AC | 258 ms
112,092 KB |
testcase_17 | AC | 617 ms
92,912 KB |
testcase_18 | AC | 465 ms
138,728 KB |
testcase_19 | AC | 385 ms
106,564 KB |
testcase_20 | AC | 381 ms
88,920 KB |
testcase_21 | AC | 302 ms
117,272 KB |
testcase_22 | AC | 318 ms
135,576 KB |
testcase_23 | AC | 456 ms
101,044 KB |
testcase_24 | AC | 211 ms
82,772 KB |
testcase_25 | AC | 206 ms
80,700 KB |
testcase_26 | AC | 110 ms
77,628 KB |
testcase_27 | AC | 189 ms
79,836 KB |
testcase_28 | AC | 210 ms
81,012 KB |
testcase_29 | AC | 223 ms
81,564 KB |
testcase_30 | AC | 208 ms
81,256 KB |
testcase_31 | AC | 224 ms
81,564 KB |
testcase_32 | AC | 170 ms
78,880 KB |
testcase_33 | AC | 244 ms
83,020 KB |
testcase_34 | AC | 229 ms
81,328 KB |
testcase_35 | AC | 288 ms
81,948 KB |
testcase_36 | AC | 291 ms
83,012 KB |
testcase_37 | AC | 175 ms
79,048 KB |
testcase_38 | AC | 251 ms
80,692 KB |
testcase_39 | AC | 186 ms
78,676 KB |
testcase_40 | AC | 223 ms
80,984 KB |
testcase_41 | AC | 170 ms
78,528 KB |
testcase_42 | AC | 237 ms
82,000 KB |
testcase_43 | AC | 230 ms
81,628 KB |
testcase_44 | AC | 119 ms
79,328 KB |
testcase_45 | AC | 92 ms
71,632 KB |
testcase_46 | AC | 237 ms
87,460 KB |
testcase_47 | AC | 238 ms
88,072 KB |
testcase_48 | AC | 303 ms
96,316 KB |
testcase_49 | AC | 381 ms
91,284 KB |
testcase_50 | AC | 529 ms
97,212 KB |
testcase_51 | AC | 229 ms
102,400 KB |
testcase_52 | AC | 543 ms
97,568 KB |
testcase_53 | AC | 285 ms
89,172 KB |
testcase_54 | AC | 188 ms
95,108 KB |
testcase_55 | AC | 461 ms
94,048 KB |
testcase_56 | AC | 118 ms
79,136 KB |
testcase_57 | AC | 438 ms
102,936 KB |
testcase_58 | AC | 303 ms
89,004 KB |
testcase_59 | AC | 210 ms
89,940 KB |
testcase_60 | AC | 143 ms
85,900 KB |
testcase_61 | AC | 253 ms
89,984 KB |
testcase_62 | AC | 378 ms
96,104 KB |
testcase_63 | AC | 302 ms
97,016 KB |
testcase_64 | TLE | - |
testcase_65 | AC | 523 ms
90,872 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]: if dp[u][n+1] <= cost + X[u] + dp[v][n]: continue dp[u][n+1] = cost + X[u] + dp[v][n] prev[u][n+1] = v heappush(PQ,(dp[u][n+1], u, n+1)) 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()