結果
問題 |
No.3040 Aoiスコア
|
ユーザー |
![]() |
提出日時 | 2025-02-28 21:59:29 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 548 ms / 1,000 ms |
コード長 | 1,797 bytes |
コンパイル時間 | 403 ms |
コンパイル使用メモリ | 82,520 KB |
実行使用メモリ | 78,680 KB |
最終ジャッジ日時 | 2025-06-20 20:57:40 |
合計ジャッジ時間 | 4,545 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] # inf = -1-(-1 << 31) inf = -1-(-1 << 62) # md = 10**9+7 md = 998244353 def nCr(com_n, com_r): if com_r < 0: return 0 if com_n < com_r: return 0 return fac[com_n]*ifac[com_r]%md*ifac[com_n-com_r]%md n_max = 6000 fac = [1] for i in range(1, n_max+1): fac.append(fac[-1]*i%md) ifac = [1]*(n_max+1) ifac[n_max] = pow(fac[n_max], md-2, md) for i in range(n_max-1, 1, -1): ifac[i] = ifac[i+1]*(i+1)%md pw26 = [1] for _ in range(6000): pw26.append(pw26[-1]*26%md) pw24 = [1] for _ in range(6000): pw24.append(pw24[-1]*24%md) n, m = LI() s = ["ai?o".find(c) for c in SI()] to = [[] for _ in range(n)] for _ in range(m): u, v = LI1() to[u].append(v) to[v].append(u) q = s.count(2) ans = 0 for u in range(n): if s[u] > 1: cnt = [0]*5 for v in to[u]: cnt[s[v]] += 1 cur = 0 for a in range(cnt[2]+1): for b in range(cnt[2]+1-a): cur += (cnt[0]+a)*(cnt[1]+b)%md*nCr(cnt[2], a)%md*nCr(cnt[2]-a, b)%md*pw24[cnt[2]-a-b]%md cur %= md ans += cur*pw26[q-cnt[2]-(s[u] == 2)]%md ans %= md print(ans)