結果
問題 | No.1190 Points |
ユーザー | tamato |
提出日時 | 2020-08-24 21:41:25 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,443 bytes |
コンパイル時間 | 411 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 123,496 KB |
最終ジャッジ日時 | 2024-11-06 10:45:06 |
合計ジャッジ時間 | 10,155 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
54,272 KB |
testcase_01 | AC | 47 ms
54,400 KB |
testcase_02 | AC | 46 ms
54,272 KB |
testcase_03 | AC | 337 ms
104,464 KB |
testcase_04 | AC | 308 ms
97,760 KB |
testcase_05 | AC | 294 ms
101,932 KB |
testcase_06 | AC | 434 ms
113,300 KB |
testcase_07 | AC | 451 ms
116,004 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 92 ms
86,016 KB |
testcase_15 | WA | - |
testcase_16 | AC | 132 ms
81,536 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 87 ms
86,784 KB |
testcase_20 | WA | - |
testcase_21 | AC | 185 ms
87,500 KB |
testcase_22 | AC | 109 ms
88,448 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 347 ms
105,812 KB |
testcase_26 | AC | 150 ms
94,412 KB |
testcase_27 | AC | 371 ms
105,924 KB |
ソースコード
mod = 1000000007 eps = 10**-9 def main(): import sys from collections import deque input = sys.stdin.buffer.readline N, M, P = map(int, input().split()) S, G = map(int, input().split()) adj = [[] for _ in range(N+1)] for _ in range(M): a, b = map(int, input().split()) adj[a].append(b) adj[b].append(a) def dist(v0): que = deque() que.append(v0) seen = [10**10] * (N+1) seen[v0] = 0 par = [0] * (N+1) child = [[] for _ in range(N+1)] seq = [] V = set() while que: v = que.popleft() seq.append(v) for u in adj[v]: if seen[u] == 10**10: seen[u] = seen[v] + 1 par[u] = v child[v].append(u) que.append(u) elif seen[u] == seen[v]: V.add(u) V.add(v) elif seen[u] == seen[v] + 1: child[v].append(u) seq.reverse() add = [10**11] * (N+1) for v in V: add[v] = 1 que.append(v) while que: vv = que.popleft() for u in child[vv]: if add[u] == 1: continue que.append(u) add[u] = 1 while True: updated = 0 for v in seq: val = 10**10 for u in child[v]: val = min(val, add[u] + 2) if add[v] != val: updated = 1 add[v] = val seq.reverse() for v in seq: for u in child[v]: if add[u] > add[v]: updated = 1 add[u] = min(add[u], add[v]) seq.reverse() if not updated: break return seen, add ds, adds = dist(S) dg, addg = dist(G) ans = [] for v in range(1, N+1): if ds[v] + dg[v] <= P: if (ds[v] + dg[v])%2 == P%2: ans.append(v) else: if ds[v] + dg[v] + min(adds[v], addg[v]) <= P: ans.append(v) if ans: print(len(ans)) for a in ans: print(a) else: print(-1) if __name__ == '__main__': main()