結果

問題 No.762 PDCAパス
ユーザー McGregorshMcGregorsh
提出日時 2022-07-03 22:06:27
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 394 ms / 2,000 ms
コード長 2,030 bytes
コンパイル時間 378 ms
コンパイル使用メモリ 87,112 KB
実行使用メモリ 107,680 KB
最終ジャッジ日時 2023-08-19 23:17:23
合計ジャッジ時間 15,295 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge10
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 237 ms
92,664 KB
testcase_01 AC 235 ms
92,608 KB
testcase_02 AC 234 ms
92,492 KB
testcase_03 AC 238 ms
92,600 KB
testcase_04 AC 233 ms
92,356 KB
testcase_05 AC 235 ms
92,612 KB
testcase_06 AC 233 ms
92,608 KB
testcase_07 AC 236 ms
92,700 KB
testcase_08 AC 238 ms
92,664 KB
testcase_09 AC 241 ms
92,608 KB
testcase_10 AC 237 ms
92,356 KB
testcase_11 AC 238 ms
92,552 KB
testcase_12 AC 240 ms
92,700 KB
testcase_13 AC 242 ms
92,704 KB
testcase_14 AC 241 ms
92,528 KB
testcase_15 AC 239 ms
92,484 KB
testcase_16 AC 242 ms
92,696 KB
testcase_17 AC 239 ms
92,656 KB
testcase_18 AC 237 ms
92,536 KB
testcase_19 AC 242 ms
92,532 KB
testcase_20 AC 240 ms
92,356 KB
testcase_21 AC 239 ms
92,600 KB
testcase_22 AC 374 ms
106,832 KB
testcase_23 AC 377 ms
106,996 KB
testcase_24 AC 362 ms
105,500 KB
testcase_25 AC 364 ms
105,528 KB
testcase_26 AC 380 ms
107,024 KB
testcase_27 AC 382 ms
106,872 KB
testcase_28 AC 387 ms
107,680 KB
testcase_29 AC 386 ms
107,508 KB
testcase_30 AC 386 ms
107,228 KB
testcase_31 AC 380 ms
107,472 KB
testcase_32 AC 384 ms
107,236 KB
testcase_33 AC 387 ms
106,928 KB
testcase_34 AC 388 ms
106,832 KB
testcase_35 AC 383 ms
106,820 KB
testcase_36 AC 394 ms
106,924 KB
testcase_37 AC 384 ms
106,116 KB
testcase_38 AC 383 ms
106,200 KB
testcase_39 AC 385 ms
106,696 KB
testcase_40 AC 387 ms
106,560 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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()
   lines = [i_list() for i in range(m)]
   
   D = [0] * n
   for i in range(m):
   	  a, b = lines[i]
   	  a -= 1
   	  b -= 1
   	  if s[a] == 'P' and s[b] == 'D':
   	  	  D[b] += 1
   	  if s[a] == 'D' and s[b] == 'P':
   	  	  D[a] += 1
   
   C = [0] * n
   for i in range(m):
   	  a, b = lines[i]
   	  a -= 1
   	  b -= 1
   	  if s[a] == 'C' and s[b] == 'A':
   	  	  C[a] += 1
   	  if s[a] == 'A' and s[b] == 'C':
   	  	  C[b] += 1
   
   ans = 0
   for i in range(m):
   	  a, b = lines[i]
   	  a -= 1
   	  b -= 1
   	  if s[a] == 'D' and s[b] == 'C':
   	  	  ans += D[a] * C[b]
   	  if s[a] == 'C' and s[b] == 'D':
   	  	  ans += C[a] * D[b]
   	  ans %= MOD
   print(ans)
   
   
if __name__ == '__main__':
    main()
0