結果
問題 | No.762 PDCAパス |
ユーザー | McGregorsh |
提出日時 | 2022-07-03 21:50:46 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,084 bytes |
コンパイル時間 | 2,070 ms |
コンパイル使用メモリ | 86,656 KB |
実行使用メモリ | 92,732 KB |
最終ジャッジ日時 | 2023-08-19 22:58:32 |
合計ジャッジ時間 | 11,280 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 234 ms
92,652 KB |
testcase_01 | AC | 235 ms
92,732 KB |
testcase_02 | AC | 230 ms
92,400 KB |
testcase_03 | AC | 228 ms
92,536 KB |
testcase_04 | AC | 231 ms
92,624 KB |
testcase_05 | AC | 235 ms
92,540 KB |
testcase_06 | AC | 237 ms
92,452 KB |
testcase_07 | AC | 238 ms
92,728 KB |
testcase_08 | AC | 233 ms
92,440 KB |
testcase_09 | AC | 238 ms
92,696 KB |
testcase_10 | AC | 237 ms
92,432 KB |
testcase_11 | AC | 234 ms
92,560 KB |
testcase_12 | AC | 238 ms
92,540 KB |
testcase_13 | AC | 240 ms
92,672 KB |
testcase_14 | AC | 234 ms
92,560 KB |
testcase_15 | AC | 231 ms
92,544 KB |
testcase_16 | AC | 238 ms
92,720 KB |
testcase_17 | AC | 238 ms
92,656 KB |
testcase_18 | AC | 238 ms
92,532 KB |
testcase_19 | AC | 239 ms
92,720 KB |
testcase_20 | AC | 235 ms
92,536 KB |
testcase_21 | AC | 239 ms
92,432 KB |
testcase_22 | TLE | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
ソースコード
import sys, re 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 = input() ok = [['P', 'D'], ['D', 'C'], ['C', 'A'], ['D', 'P'], ['C', 'D'], ['A', 'C']] nums = [[] for i in range(n)] for i in range(m): a, b = i_map() a -= 1 b -= 1 if [s[a], s[b]] in ok: nums[a].append(b) nums[b].append(a) start = [] for i in range(n): if s[i] == 'P': start.append(i) def dfs(now, p, mozi): mozi += s[now] if len(mozi) > 4: return 0 ret = 0 if mozi == 'PDCA': ret = 1 if mozi == 'P' or mozi == 'PD' or mozi == 'PDC': for i in nums[now]: ret += dfs(i, now, mozi) return ret ans = 0 for i in range(len(start)): ans += dfs(start[i], -1, '') print(ans % MOD) if __name__ == '__main__': main()