結果
問題 | No.3004 ヤング図形 |
ユーザー | lif4635 |
提出日時 | 2025-01-17 22:06:01 |
言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
結果 |
MLE
|
実行時間 | - |
コード長 | 3,186 bytes |
コンパイル時間 | 170 ms |
コンパイル使用メモリ | 12,544 KB |
実行使用メモリ | 820,608 KB |
最終ジャッジ日時 | 2025-01-17 22:06:41 |
合計ジャッジ時間 | 33,188 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | MLE * 3 |
other | MLE * 25 |
ソースコード
# inputimport sysinput = sys.stdin.readlineII = lambda : int(input())MI = lambda : map(int, input().split())LI = lambda : list(map(int, input().split()))SI = lambda : input().rstrip()LLI = lambda n : [list(map(int, input().split())) for _ in range(n)]LSI = lambda n : [input().rstrip() for _ in range(n)]MI_1 = lambda : map(lambda x:int(x)-1, input().split())LI_1 = lambda : list(map(lambda x:int(x)-1, input().split()))def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]:edge = [set() for i in range(n+1+index)]for _ in range(m):a,b = map(int, input().split())a += indexb += indexedge[a].add(b)if not dir:edge[b].add(a)return edgedef graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]:edge = [set() for i in range(n+1+index)]for _ in range(m):a,b,c = map(int, input().split())a += indexb += indexedge[a].add((b,c))if not dir:edge[b].add((a,c))return edgemod = 998244353inf = 1001001001001001001ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97yes = lambda : print("Yes")no = lambda : print("No")yn = lambda flag : print("Yes" if flag else "No")def acc(a:list[int]):sa = [0]*(len(a)+1)for i in range(len(a)):sa[i+1] = a[i] + sa[i]return saprinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)alplow = "abcdefghijklmnopqrstuvwxyz"alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]# import pypyjit# pypyjit.set_param('max_unroll_recursion=-1')# sys.setrecursionlimit(10**7)sys.set_int_max_str_digits(0)class Comb:def __init__(self, lim:int, mod:int = mod):"""mod : prime"""self.fac = [1]*(lim+1)self.finv = [1]*(lim+1)self.mod = modfor i in range(2,lim+1):self.fac[i] = self.fac[i-1]*i%self.modself.finv[lim] = pow(self.fac[lim],-1,mod)for i in range(lim,2,-1):self.finv[i-1] = self.finv[i]*i%self.moddef C(self, a, b):assert b >= 0, "The second argument is negative."if a < b: return 0if a < 0: return 0return self.fac[a]*self.finv[b]%self.mod*self.finv[a-b]%self.moddef P(self, a, b):assert b >= 0, "The second argument is negative."if a < b: return 0if a < 0: return 0return self.fac[a]*self.finv[a-b]%self.moddef H(self, a, b): return self.C(a+b-1,b)def F(self, a): return self.fac[a]def Fi(self, a): return self.finv[a]comb = Comb(10**8)k = II()sm = 0ans = 1for i in range(k):l,m = MI()sm += l*mans *= pow(comb.Fi(l),m,mod) * comb.Fi(m)%modans %= modans *= comb.F(sm)print(ans%mod)