結果
問題 | No.2345 max(l,r) |
ユーザー | minimum |
提出日時 | 2023-06-09 23:12:16 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,009 ms / 2,000 ms |
コード長 | 2,488 bytes |
コンパイル時間 | 2,117 ms |
コンパイル使用メモリ | 86,664 KB |
実行使用メモリ | 132,512 KB |
最終ジャッジ日時 | 2023-08-30 14:22:26 |
合計ジャッジ時間 | 27,113 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 219 ms
99,060 KB |
testcase_01 | AC | 548 ms
103,924 KB |
testcase_02 | AC | 454 ms
103,872 KB |
testcase_03 | AC | 450 ms
103,868 KB |
testcase_04 | AC | 457 ms
103,844 KB |
testcase_05 | AC | 459 ms
103,712 KB |
testcase_06 | AC | 464 ms
103,796 KB |
testcase_07 | AC | 459 ms
104,000 KB |
testcase_08 | AC | 463 ms
103,708 KB |
testcase_09 | AC | 459 ms
103,732 KB |
testcase_10 | AC | 457 ms
103,856 KB |
testcase_11 | AC | 457 ms
103,732 KB |
testcase_12 | AC | 457 ms
103,300 KB |
testcase_13 | AC | 458 ms
103,244 KB |
testcase_14 | AC | 463 ms
103,116 KB |
testcase_15 | AC | 468 ms
103,140 KB |
testcase_16 | AC | 462 ms
103,372 KB |
testcase_17 | AC | 454 ms
103,364 KB |
testcase_18 | AC | 466 ms
103,196 KB |
testcase_19 | AC | 440 ms
103,156 KB |
testcase_20 | AC | 463 ms
103,260 KB |
testcase_21 | AC | 449 ms
103,352 KB |
testcase_22 | AC | 285 ms
124,316 KB |
testcase_23 | AC | 279 ms
122,728 KB |
testcase_24 | AC | 219 ms
107,532 KB |
testcase_25 | AC | 227 ms
100,488 KB |
testcase_26 | AC | 230 ms
100,580 KB |
testcase_27 | AC | 231 ms
100,676 KB |
testcase_28 | AC | 219 ms
114,388 KB |
testcase_29 | AC | 232 ms
118,344 KB |
testcase_30 | AC | 208 ms
104,604 KB |
testcase_31 | AC | 250 ms
127,452 KB |
testcase_32 | AC | 215 ms
110,132 KB |
testcase_33 | AC | 221 ms
113,968 KB |
testcase_34 | AC | 195 ms
99,172 KB |
testcase_35 | AC | 208 ms
105,140 KB |
testcase_36 | AC | 218 ms
106,424 KB |
testcase_37 | AC | 217 ms
110,212 KB |
testcase_38 | AC | 252 ms
123,832 KB |
testcase_39 | AC | 275 ms
123,744 KB |
testcase_40 | AC | 269 ms
123,720 KB |
testcase_41 | AC | 258 ms
123,748 KB |
testcase_42 | AC | 256 ms
123,820 KB |
testcase_43 | AC | 250 ms
123,788 KB |
testcase_44 | AC | 269 ms
123,744 KB |
testcase_45 | AC | 312 ms
132,512 KB |
testcase_46 | AC | 296 ms
130,180 KB |
testcase_47 | AC | 249 ms
123,744 KB |
testcase_48 | AC | 247 ms
101,488 KB |
testcase_49 | AC | 245 ms
101,280 KB |
testcase_50 | AC | 253 ms
101,408 KB |
testcase_51 | AC | 258 ms
101,316 KB |
testcase_52 | AC | 249 ms
101,104 KB |
testcase_53 | AC | 255 ms
101,052 KB |
testcase_54 | AC | 253 ms
101,232 KB |
testcase_55 | AC | 255 ms
101,128 KB |
testcase_56 | AC | 259 ms
101,072 KB |
testcase_57 | AC | 258 ms
101,224 KB |
testcase_58 | AC | 272 ms
101,736 KB |
testcase_59 | AC | 273 ms
101,372 KB |
testcase_60 | AC | 269 ms
101,328 KB |
testcase_61 | AC | 267 ms
101,492 KB |
testcase_62 | AC | 270 ms
101,596 KB |
testcase_63 | AC | 271 ms
101,064 KB |
testcase_64 | AC | 269 ms
101,892 KB |
testcase_65 | AC | 273 ms
101,332 KB |
testcase_66 | AC | 277 ms
100,944 KB |
testcase_67 | AC | 279 ms
101,540 KB |
testcase_68 | AC | 1,009 ms
102,864 KB |
ソースコード
from itertools import accumulate class Combination: def __init__(self, MX=10**6, MOD=998244353): self.MX = MX self.MOD = MOD self.fact = [1] * (MX + 1) self.inv = [1] * (MX + 1) self.f_inv = [1] * (MX + 1) for i in range(2, MX + 1): self.fact[i] = (self.fact[i - 1] * i) % self.MOD self.inv[i] = ( - (self.MOD // i) * (self.inv[self.MOD % i])) % self.MOD self.f_inv[i] = (self.f_inv[i - 1] * self.inv[i]) % self.MOD def invs(self, n): if n <= self.MX: return self.inv[n] else: return pow(n, self.MOD - 2, self.MOD) def p(self, n, r): if r > n or r < 0: return 0 return (self.fact[n] * self.f_inv[r]) % self.MOD def c(self, n, r): if r > n or r < 0: return 0 return (self.fact[n] * self.f_inv[r] * self.f_inv[n - r]) % self.MOD com = Combination() def solve(): MOD = 998244353 N, M = map(int, input().split()) A = list(map(int, input().split())) dic = dict() for i in range(N): if N - A[i] not in dic: dic[N - A[i]] = 0 dic[N - A[i]] += 1 ls = list(dic.keys()) ls.sort() lsum = 0 rsum = 0 L, R = [], [] LL, RR = [], [] ans = 1 for i in range(len(ls)): now = ls[i] j = now - lsum k = now - rsum if lsum + dic[now] == now: L.append(dic[now]) LL.append(now) lsum = now if rsum + dic[now] == now and i != len(ls) - 1: ans *= 2 ans %= MOD elif rsum + dic[now] == now: R.append(dic[now]) RR.append(now) rsum = now elif j + k == dic[now] and j > 0 and k > 0: lsum = now rsum = now L.append(j) LL.append(now) R.append(k) RR.append(now) ans *= com.c(dic[now], j) ans %= MOD else: print(0) return S = L + list(reversed(R)) checkl = list(accumulate(S)) checkr = list(reversed(list(accumulate(reversed(S))))) checkmin = [min(checkl[i], checkr[i]) for i in range(len(S))] if checkmin != LL + list(reversed(RR)): print(0) else: ans *= com.c(M, len(L) + len(R)) ans %= MOD print(ans) return T = int(input()) for _ in range(T): solve()