結果

問題 No.762 PDCAパス
ユーザー 双六
提出日時 2020-08-08 03:41:12
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 471 ms / 2,000 ms
コード長 1,210 bytes
コンパイル時間 84 ms
コンパイル使用メモリ 12,672 KB
実行使用メモリ 26,248 KB
最終ジャッジ日時 2024-09-25 06:37:12
合計ジャッジ時間 10,206 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 38
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

# import sys; input = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**7)
from collections import defaultdict
from collections import deque
con = 10 ** 9 + 7; INF = float("inf")
def getlist():
return list(map(int, input().split()))
class Graph(object):
def __init__(self):
self.graph = defaultdict(list)
def __len__(self):
return len(self.graph)
def add_edge(self, a, b):
self.graph[a].append(b)
#
def main():
N, M = getlist()
S = input()
G = Graph()
DP = [0] * N
for i in range(N):
if S[i] == "P":
DP[i] = 1
for i in range(M):
a, b = getlist()
a -= 1; b -= 1
if (S[a] == "P" and S[b] =="D") or (S[a] == "D" and S[b] =="C") or (S[a] == "C" and S[b] =="A"):
G.add_edge(a, b)
if (S[a] == "A" and S[b] =="C") or (S[a] == "C" and S[b] =="D") or (S[a] == "D" and S[b] =="P"):
G.add_edge(b, a)
for i in range(N):
if S[i] == "P":
for v in G.graph[i]:
DP[v] += DP[i]
for i in range(N):
if S[i] == "D":
for v in G.graph[i]:
DP[v] += DP[i]
for i in range(N):
if S[i] == "C":
for v in G.graph[i]:
DP[v] += DP[i]
ans = 0
for i in range(N):
if S[i] == "A":
ans += DP[i]
print(ans % con)
if __name__ == '__main__':
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0