結果
問題 | No.1190 Points |
ユーザー | tamato |
提出日時 | 2020-08-24 20:50:51 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,029 bytes |
コンパイル時間 | 189 ms |
コンパイル使用メモリ | 82,816 KB |
実行使用メモリ | 128,720 KB |
最終ジャッジ日時 | 2024-04-24 03:47:14 |
合計ジャッジ時間 | 7,680 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
54,272 KB |
testcase_01 | AC | 42 ms
54,400 KB |
testcase_02 | AC | 45 ms
54,400 KB |
testcase_03 | AC | 234 ms
104,036 KB |
testcase_04 | AC | 233 ms
101,380 KB |
testcase_05 | AC | 213 ms
99,276 KB |
testcase_06 | AC | 303 ms
113,632 KB |
testcase_07 | AC | 322 ms
115,364 KB |
testcase_08 | AC | 299 ms
123,880 KB |
testcase_09 | WA | - |
testcase_10 | AC | 305 ms
128,720 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 265 ms
99,196 KB |
testcase_14 | AC | 87 ms
85,888 KB |
testcase_15 | AC | 360 ms
113,484 KB |
testcase_16 | AC | 128 ms
81,240 KB |
testcase_17 | AC | 334 ms
113,312 KB |
testcase_18 | AC | 191 ms
89,452 KB |
testcase_19 | AC | 87 ms
87,168 KB |
testcase_20 | AC | 223 ms
98,048 KB |
testcase_21 | AC | 151 ms
87,568 KB |
testcase_22 | AC | 101 ms
88,320 KB |
testcase_23 | AC | 360 ms
107,960 KB |
testcase_24 | AC | 354 ms
113,888 KB |
testcase_25 | AC | 258 ms
107,520 KB |
testcase_26 | AC | 132 ms
94,248 KB |
testcase_27 | AC | 254 ms
107,592 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) seq.reverse() add = [0] * (N+1) for v in V: add[v] = 1 que.append(v) while que: vv = que.popleft() for u in child[vv]: que.append(u) add[u] = 1 for v in seq: if add[v] == 0: val = 10**10 for u in child[v]: val = min(val, add[u] + 2) add[v] = val seq.reverse() for v in seq: for u in child[v]: add[u] = min(add[u], add[v]) 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()