結果
問題 | No.1545 [Cherry 2nd Tune N] Anthem |
ユーザー | ygd. |
提出日時 | 2021-06-15 23:33:50 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,440 bytes |
コンパイル時間 | 825 ms |
コンパイル使用メモリ | 87,000 KB |
実行使用メモリ | 195,820 KB |
最終ジャッジ日時 | 2023-08-27 20:31:18 |
合計ジャッジ時間 | 33,609 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 100 ms
71,640 KB |
testcase_01 | AC | 99 ms
71,720 KB |
testcase_02 | AC | 99 ms
71,616 KB |
testcase_03 | AC | 98 ms
71,748 KB |
testcase_04 | AC | 217 ms
87,308 KB |
testcase_05 | AC | 605 ms
126,580 KB |
testcase_06 | RE | - |
testcase_07 | AC | 259 ms
90,664 KB |
testcase_08 | AC | 991 ms
116,420 KB |
testcase_09 | AC | 714 ms
101,024 KB |
testcase_10 | AC | 222 ms
92,864 KB |
testcase_11 | AC | 354 ms
107,320 KB |
testcase_12 | AC | 423 ms
113,980 KB |
testcase_13 | AC | 229 ms
85,408 KB |
testcase_14 | AC | 245 ms
103,772 KB |
testcase_15 | AC | 178 ms
87,304 KB |
testcase_16 | AC | 278 ms
112,344 KB |
testcase_17 | AC | 701 ms
94,412 KB |
testcase_18 | AC | 478 ms
138,476 KB |
testcase_19 | AC | 407 ms
106,964 KB |
testcase_20 | AC | 413 ms
88,748 KB |
testcase_21 | AC | 311 ms
117,292 KB |
testcase_22 | AC | 336 ms
135,312 KB |
testcase_23 | AC | 486 ms
100,816 KB |
testcase_24 | AC | 223 ms
82,452 KB |
testcase_25 | AC | 218 ms
80,524 KB |
testcase_26 | AC | 116 ms
77,644 KB |
testcase_27 | AC | 198 ms
79,924 KB |
testcase_28 | AC | 224 ms
81,448 KB |
testcase_29 | AC | 238 ms
81,448 KB |
testcase_30 | AC | 221 ms
81,132 KB |
testcase_31 | AC | 243 ms
82,028 KB |
testcase_32 | AC | 185 ms
79,096 KB |
testcase_33 | AC | 267 ms
83,064 KB |
testcase_34 | AC | 248 ms
82,516 KB |
testcase_35 | AC | 300 ms
82,432 KB |
testcase_36 | AC | 291 ms
82,824 KB |
testcase_37 | AC | 173 ms
78,856 KB |
testcase_38 | AC | 253 ms
81,248 KB |
testcase_39 | AC | 186 ms
78,928 KB |
testcase_40 | AC | 228 ms
80,856 KB |
testcase_41 | AC | 174 ms
79,168 KB |
testcase_42 | AC | 252 ms
82,984 KB |
testcase_43 | AC | 250 ms
82,084 KB |
testcase_44 | AC | 126 ms
79,236 KB |
testcase_45 | AC | 101 ms
71,796 KB |
testcase_46 | AC | 249 ms
87,780 KB |
testcase_47 | AC | 253 ms
87,904 KB |
testcase_48 | AC | 313 ms
96,912 KB |
testcase_49 | AC | 401 ms
91,212 KB |
testcase_50 | AC | 537 ms
97,452 KB |
testcase_51 | AC | 238 ms
102,592 KB |
testcase_52 | AC | 549 ms
97,356 KB |
testcase_53 | AC | 298 ms
89,728 KB |
testcase_54 | AC | 200 ms
93,892 KB |
testcase_55 | AC | 465 ms
93,940 KB |
testcase_56 | AC | 129 ms
79,296 KB |
testcase_57 | AC | 447 ms
103,100 KB |
testcase_58 | AC | 316 ms
89,312 KB |
testcase_59 | AC | 215 ms
89,748 KB |
testcase_60 | AC | 148 ms
86,076 KB |
testcase_61 | AC | 261 ms
89,576 KB |
testcase_62 | AC | 395 ms
95,940 KB |
testcase_63 | AC | 310 ms
97,184 KB |
testcase_64 | RE | - |
testcase_65 | RE | - |
testcase_66 | RE | - |
ソースコード
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][n+1], 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()