結果
問題 | No.2527 H and W |
ユーザー | StanMarsh |
提出日時 | 2023-11-03 21:50:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 291 ms / 2,000 ms |
コード長 | 6,076 bytes |
コンパイル時間 | 236 ms |
コンパイル使用メモリ | 81,884 KB |
実行使用メモリ | 121,348 KB |
最終ジャッジ日時 | 2023-11-03 21:51:01 |
合計ジャッジ時間 | 7,421 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 141 ms
89,468 KB |
testcase_01 | AC | 151 ms
89,468 KB |
testcase_02 | AC | 272 ms
121,308 KB |
testcase_03 | AC | 150 ms
89,468 KB |
testcase_04 | AC | 254 ms
121,004 KB |
testcase_05 | AC | 249 ms
121,060 KB |
testcase_06 | AC | 251 ms
121,344 KB |
testcase_07 | AC | 149 ms
89,464 KB |
testcase_08 | AC | 267 ms
121,292 KB |
testcase_09 | AC | 200 ms
105,376 KB |
testcase_10 | AC | 199 ms
105,376 KB |
testcase_11 | AC | 280 ms
121,300 KB |
testcase_12 | AC | 258 ms
121,300 KB |
testcase_13 | AC | 258 ms
121,312 KB |
testcase_14 | AC | 277 ms
121,312 KB |
testcase_15 | AC | 253 ms
121,308 KB |
testcase_16 | AC | 267 ms
121,308 KB |
testcase_17 | AC | 265 ms
121,348 KB |
testcase_18 | AC | 291 ms
121,308 KB |
testcase_19 | AC | 226 ms
108,036 KB |
testcase_20 | AC | 224 ms
108,328 KB |
testcase_21 | AC | 226 ms
105,692 KB |
testcase_22 | AC | 221 ms
105,684 KB |
testcase_23 | AC | 223 ms
105,688 KB |
testcase_24 | AC | 239 ms
109,300 KB |
testcase_25 | AC | 199 ms
103,652 KB |
ソースコード
from random import getrandbits, randrange from string import ascii_lowercase, ascii_uppercase import sys from math import ceil, floor, sqrt, pi, factorial, gcd, log, log10, log2, inf, cos, sin from copy import deepcopy, copy 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 lru_cache, reduce from decimal import Decimal, getcontext from typing import List, Tuple, Optional inf = float("inf") def ceil_div(a, b): return (a + b - 1) // b def isqrt(num): res = int(sqrt(num)) while res * res > num: res -= 1 while (res + 1) * (res + 1) <= num: res += 1 return res def int1(s): return int(s) - 1 from types import GeneratorType def bootstrap(f, stack=[]): def wrapped(*args, **kwargs): if stack: return f(*args, **kwargs) else: to = f(*args, **kwargs) while True: if type(to) is GeneratorType: stack.append(to) to = next(to) else: stack.pop() if not stack: break to = stack[-1].send(to) return to return wrapped import sys import os input = lambda: sys.stdin.readline().rstrip("\r\n") print = lambda *args, end="\n", sep=" ": sys.stdout.write( sep.join(map(str, args)) + end ) def II(): return int(input()) def MII(base=0): return map(lambda s: int(s) - base, input().split()) def LII(base=0): return list(MII(base)) def NA(): n = II() a = LII() return n, a def read_graph(n, m, base=0, directed=False, return_edges=False): g = [[] for _ in range(n)] edges = [] for _ in range(m): a, b = MII(base) if return_edges: edges.append((a, b)) g[a].append(b) if not directed: g[b].append(a) if return_edges: return g, edges return g def read_graph_with_weight(n, m, base=0, directed=False, return_edges=False): g = [[] for _ in range(n)] edges = [] for _ in range(m): a, b, w = MII() a, b = a - base, b - base if return_edges: edges.append((a, b, w)) g[a].append((b, w)) if not directed: g[b].append((a, w)) if return_edges: return g, edges return g def iterate_tokens(): for line in sys.stdin: for word in line.split(): yield word tokens = None def NI(): global tokens if tokens is None: tokens = iterate_tokens() return int(next(tokens)) def LNI(n): return [NI() for _ in range(n)] def yes(res): print("Yes" if res else "No") def YES(res): print("YES" if res else "NO") def pairwise(a): n = len(a) for i in range(n - 1): yield a[i], a[i + 1] def factorial(n): return reduce(lambda x, y: x * y, range(1, n + 1)) def cmin(dp, i, x): if x < dp[i]: dp[i] = x def cmax(dp, i, x): if x > dp[i]: dp[i] = x def alp_a_to_i(s): return ord(s) - ord("a") def alp_A_to_i(s): return ord(s) - ord("A") def alp_i_to_a(i): return chr(ord("a") + i) def alp_i_to_A(i): return chr(ord("A") + i) d4 = [(1, 0), (0, 1), (-1, 0), (0, -1)] d8 = [(1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1)] def ranges(n, m): return ((i, j) for i in range(n) for j in range(m)) def valid(i, j, n, m): return 0 <= i < n and 0 <= j < m def ninj(i, j, n, m): return [(i + di, j + dj) for di, dj in d4 if valid(i + di, j + dj, n, m)] def gen(x, *args): if len(args) == 1: return [x] * args[0] if len(args) == 2: return [[x] * args[1] for _ in [0] * args[0]] if len(args) == 3: return [[[x] * args[2] for _ in [0] * args[1]] for _ in [0] * args[0]] if len(args) == 4: return [ [[[x] * args[3] for _ in [0] * args[2]] for _ in [0] * args[1]] for _ in [0] * args[0] ] list2d = lambda a, b, v: [[v] * b for _ in range(a)] list3d = lambda a, b, c, v: [[[v] * c for _ in range(b)] for _ in range(a)] class Debug: def __init__(self, debug=False): self.debug = debug cur_path = os.path.dirname(os.path.abspath(__file__)) self.local = os.path.exists(cur_path + "/.cph") def get_ic(self): if self.debug and self.local: from icecream import ic return ic else: return lambda *args, **kwargs: ... class Factorial: def __init__(self, N, mod) -> None: N += 1 self.mod = mod self.f = [1 for _ in range(N)] self.g = [1 for _ in range(N)] for i in range(1, N): self.f[i] = self.f[i - 1] * i % self.mod self.g[-1] = pow(self.f[-1], mod - 2, mod) for i in range(N - 2, -1, -1): self.g[i] = self.g[i + 1] * (i + 1) % self.mod def fac(self, n): return self.f[n] def fac_inv(self, n): return self.g[n] def comb(self, n, m): if n < m or m < 0 or n < 0: return 0 return self.f[n] * self.g[m] % self.mod * self.g[n - m] % self.mod def perm(self, n, m): if n < m or m < 0 or n < 0: return 0 return self.f[n] * self.g[n - m] % self.mod def catalan(self, n): return (self.comb(2 * n, n) - self.comb(2 * n, n - 1)) % self.mod def inv(self, n): return self.f[n - 1] * self.g[n] % self.mod mod = 998244353 ic = Debug(0).get_ic() n, m, k = MII() fact = Factorial(n + m, mod=mod) res = 0 for i in range(n + 1): if n * m - i * m < k: break j = (n * m - i * m - k) // (n - i) if (n - i) * j != n * m - i * m - k: continue ic(i, j) res += fact.comb(n, i) * fact.comb(m, j) res %= mod ic(res) print(res)