結果
問題 | No.1805 Approaching Many Typhoon |
ユーザー | McGregorsh |
提出日時 | 2022-07-27 08:48:18 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 279 ms / 2,000 ms |
コード長 | 2,080 bytes |
コンパイル時間 | 281 ms |
コンパイル使用メモリ | 86,772 KB |
実行使用メモリ | 93,900 KB |
最終ジャッジ日時 | 2023-09-23 17:21:41 |
合計ジャッジ時間 | 12,316 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 234 ms
92,204 KB |
testcase_01 | AC | 229 ms
92,252 KB |
testcase_02 | AC | 230 ms
92,256 KB |
testcase_03 | AC | 233 ms
92,228 KB |
testcase_04 | AC | 230 ms
92,300 KB |
testcase_05 | AC | 235 ms
92,304 KB |
testcase_06 | AC | 232 ms
92,352 KB |
testcase_07 | AC | 239 ms
92,396 KB |
testcase_08 | AC | 238 ms
92,216 KB |
testcase_09 | AC | 239 ms
92,296 KB |
testcase_10 | AC | 240 ms
92,032 KB |
testcase_11 | AC | 241 ms
92,368 KB |
testcase_12 | AC | 242 ms
92,192 KB |
testcase_13 | AC | 238 ms
92,376 KB |
testcase_14 | AC | 237 ms
92,328 KB |
testcase_15 | AC | 243 ms
92,164 KB |
testcase_16 | AC | 236 ms
92,188 KB |
testcase_17 | AC | 239 ms
92,068 KB |
testcase_18 | AC | 244 ms
92,184 KB |
testcase_19 | AC | 241 ms
92,168 KB |
testcase_20 | AC | 242 ms
92,192 KB |
testcase_21 | AC | 241 ms
92,200 KB |
testcase_22 | AC | 242 ms
92,400 KB |
testcase_23 | AC | 242 ms
92,220 KB |
testcase_24 | AC | 244 ms
92,080 KB |
testcase_25 | AC | 240 ms
92,180 KB |
testcase_26 | AC | 240 ms
92,356 KB |
testcase_27 | AC | 242 ms
92,148 KB |
testcase_28 | AC | 277 ms
93,616 KB |
testcase_29 | AC | 279 ms
93,900 KB |
testcase_30 | AC | 272 ms
93,856 KB |
testcase_31 | AC | 269 ms
93,788 KB |
testcase_32 | AC | 243 ms
92,072 KB |
testcase_33 | AC | 242 ms
92,168 KB |
testcase_34 | AC | 248 ms
92,288 KB |
testcase_35 | AC | 247 ms
92,348 KB |
testcase_36 | AC | 253 ms
93,028 KB |
testcase_37 | AC | 239 ms
92,336 KB |
testcase_38 | AC | 237 ms
92,240 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 ###関数コピーしたか?### def main(): n, m = i_map() s, g = i_map() s -= 1 g -= 1 nums = [[] for i in range(n)] for i in range(m): f, t = i_map() f -= 1 t -= 1 nums[f].append(t) nums[t].append(f) u = int(input()) I = i_list() bat = set() for i in range(u): bat.add(I[i]-1) grid = [[] for i in range(n)] for i in range(n): if i in bat: continue else: for j in nums[i]: if j not in bat: grid[i].append(j) def dfs(start, p): if start == g: print('Yes') exit() for i in grid[start]: if i == p: continue dfs(i, start) dfs(s, -1) print('No') if __name__ == '__main__': main()