結果
問題 | No.1545 [Cherry 2nd Tune N] Anthem |
ユーザー |
![]() |
提出日時 | 2021-06-11 22:14:19 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,829 ms / 3,000 ms |
コード長 | 1,520 bytes |
コンパイル時間 | 508 ms |
コンパイル使用メモリ | 82,044 KB |
実行使用メモリ | 172,492 KB |
最終ジャッジ日時 | 2024-12-15 00:13:38 |
合計ジャッジ時間 | 23,007 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 67 |
ソースコード
import syssys.setrecursionlimit(200005)int1 = lambda x: int(x)-1p2D = lambda x: print(*x, sep="\n")def II(): return int(sys.stdin.buffer.readline())def LI(): return list(map(int, sys.stdin.buffer.readline().split()))def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))def LLI(rows_number): return [LI() for _ in range(rows_number)]def LLI1(rows_number): return [LI1() for _ in range(rows_number)]def BI(): return sys.stdin.buffer.readline().rstrip()def SI(): return sys.stdin.buffer.readline().rstrip().decode()dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]inf = 10**16# md = 998244353# md = 10**9+7from heapq import *n, s, t, k = LI()s, t = s-1, t-1xx = LI()m = II()to = [[] for _ in range(n)]for _ in range(m):u, v, c = LI1()to[u].append((v, c+1))dist = [[inf]*k for _ in range(n)]pre = [[(-1, -1) for _ in range(k)] for _ in range(n)]dist[s][0] = xx[s]hp = [(xx[s], s, 0)]while hp:d, u, f = heappop(hp)if u == t and f == k-1:print("Possible")print(d)pp = []while u != -1:pp.append(u+1)u, f = pre[u][f]print(len(pp))print(*pp[::-1])exit()if d > dist[u][f]: continuefor v, c in to[u]:nd = d+c+xx[v]nf = min(f+1, k-1)if nd >= dist[v][nf]: continuedist[v][nf] = ndpre[v][nf] = (u, f)heappush(hp,(nd,v,nf))print("Impossible")