結果
問題 |
No.762 PDCAパス
|
ユーザー |
|
提出日時 | 2020-11-01 02:11:24 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 236 ms / 2,000 ms |
コード長 | 840 bytes |
コンパイル時間 | 250 ms |
コンパイル使用メモリ | 81,924 KB |
実行使用メモリ | 87,864 KB |
最終ジャッジ日時 | 2024-07-22 05:35:47 |
合計ジャッジ時間 | 6,748 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 38 |
ソースコード
from collections import defaultdict mod = 10**9+7 n, m = map(int,input().split()) S = input() ind = defaultdict(list) for i, s in enumerate(S): ind[s].append(i) edge = [[] for _ in range(n)] for _ in range(m): u, v = map(lambda x:int(x)-1,input().split()) if (S[u] == "P" and S[v] == "D") or (S[u] == "D" and S[v] == "C") or (S[u] == "C" and S[v] == "A"): edge[u].append(v) elif (S[u] == "D" and S[v] == "P") or (S[u] == "C" and S[v] == "D") or (S[u] == "A" and S[v] == "C"): edge[v].append(u) dp = [0]*n for p in ind["P"]: dp[p] = 1 for to in edge[p]: dp[to] += dp[p] for d in ind["D"]: for to in edge[d]: dp[to] += dp[d] for c in ind["C"]: for to in edge[c]: dp[to] += dp[c] ans = 0 for key in ind["A"]: ans += dp[key] print(ans%mod)