結果
問題 | No.187 中華風 (Hard) |
ユーザー | い |
提出日時 | 2023-09-21 02:09:12 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 523 ms / 3,000 ms |
コード長 | 2,615 bytes |
コンパイル時間 | 361 ms |
コンパイル使用メモリ | 11,076 KB |
実行使用メモリ | 30,972 KB |
最終ジャッジ日時 | 2023-09-21 02:09:21 |
合計ジャッジ時間 | 7,627 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 153 ms
30,676 KB |
testcase_01 | AC | 142 ms
30,616 KB |
testcase_02 | AC | 186 ms
30,960 KB |
testcase_03 | AC | 184 ms
30,972 KB |
testcase_04 | AC | 187 ms
30,968 KB |
testcase_05 | AC | 187 ms
30,684 KB |
testcase_06 | AC | 191 ms
30,788 KB |
testcase_07 | AC | 187 ms
30,724 KB |
testcase_08 | AC | 189 ms
30,572 KB |
testcase_09 | AC | 187 ms
30,724 KB |
testcase_10 | AC | 189 ms
30,668 KB |
testcase_11 | AC | 195 ms
30,696 KB |
testcase_12 | AC | 190 ms
30,628 KB |
testcase_13 | AC | 186 ms
30,632 KB |
testcase_14 | AC | 183 ms
30,544 KB |
testcase_15 | AC | 462 ms
30,856 KB |
testcase_16 | AC | 523 ms
30,692 KB |
testcase_17 | AC | 147 ms
30,320 KB |
testcase_18 | AC | 147 ms
30,660 KB |
testcase_19 | AC | 149 ms
30,272 KB |
testcase_20 | AC | 182 ms
30,568 KB |
testcase_21 | AC | 146 ms
30,268 KB |
testcase_22 | AC | 200 ms
30,620 KB |
testcase_23 | AC | 146 ms
30,236 KB |
testcase_24 | AC | 148 ms
30,304 KB |
ソースコード
import sys V = sys.version_info _39 = False _310 = False _311 = False if V.major == 3: _39 = V.minor >= 9 _310 = V.minor >= 10 _311 = V.minor >= 11 if _39: li = list tup = tuple dic = dict st = set ty = type else: from typing import ( List, Tuple, Type, Dict, Set, ) li = List tup = Tuple dic = Dict st = Set ty = Type from sys import stdin read = stdin.buffer.read rl = stdin.buffer.readline rb = lambda: rl().split() rls = stdin.buffer.readlines from typing import ( TypeVar, Sequence as Seq, Iterable as Iter, Protocol as Proto, Generic as Gen, ) from typing import Callable as Fn from typing import Iterable def prints( a: Iterable[object], sep: str = "\n", ) -> None: print(sep.join(map(str, a))) import numpy as np def egcd( a: int, b: int, ) -> tup[int, int, int]: if not b: if a < 0: return -a, -1, 0 return a, 1, 0 q, r = divmod(a, b) g, s, t = egcd(b, r) return g, t, s - q * t def crt_mod( m: np.ndarray, r: np.ndarray, mod: int, ) -> int: l = len(m) assert len(r) == l m = np.append(m, mod) p = np.ones(l + 1, np.int64) x = np.zeros(l + 1, np.int64) for i in range(l): n = m[i] assert n > 0 g, ip, _ = egcd(p[i], n) q, a = divmod(r[i] - x[i], g) if a: return -1 n //= g t = q % n * ip % n x += t * p x %= m p *= n p %= m return x[-1] def factorize(n: int) -> li[tup[int, int]]: f = [] for i in range(2, n): if i * i > n: break if n % i: continue c = 0 while n % i == 0: n //= i c += 1 f.append((i, c)) if n > 1: f.append((n, 1)) return f def factorize_lcm( a: Iter[int], ) -> dic[int, int]: f = dict() for x in a: for p, e in factorize(x): c = f.get(p, 0) f[p] = max(c, e) return f def lcm_mod(m: int, a: Iter[int]) -> int: l = 1 for p, e in factorize_lcm(a).items(): l = l * pow(p, e, m) % m return l def solve() -> None: n = int(rl()) rm = [map(int, rb()) for _ in range(n)] r, m = list(zip(*rm)) mod = 10**9 + 7 if max(r) == 0: print(lcm_mod(mod, m)) else: m = np.array(m) r = np.array(r) print(crt_mod(m, r, mod)) def main() -> None: t = 1 # t = int(rl()) for _ in range(t): solve() main()