結果
問題 | No.187 中華風 (Hard) |
ユーザー | い |
提出日時 | 2023-09-21 14:31:14 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 685 ms / 3,000 ms |
コード長 | 3,132 bytes |
コンパイル時間 | 302 ms |
コンパイル使用メモリ | 11,236 KB |
実行使用メモリ | 10,860 KB |
最終ジャッジ日時 | 2023-09-21 14:31:27 |
合計ジャッジ時間 | 12,351 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 34 ms
10,672 KB |
testcase_01 | AC | 34 ms
10,600 KB |
testcase_02 | AC | 599 ms
10,832 KB |
testcase_03 | AC | 607 ms
10,860 KB |
testcase_04 | AC | 674 ms
10,668 KB |
testcase_05 | AC | 666 ms
10,600 KB |
testcase_06 | AC | 685 ms
10,732 KB |
testcase_07 | AC | 657 ms
10,732 KB |
testcase_08 | AC | 630 ms
10,668 KB |
testcase_09 | AC | 605 ms
10,780 KB |
testcase_10 | AC | 611 ms
10,780 KB |
testcase_11 | AC | 669 ms
10,672 KB |
testcase_12 | AC | 670 ms
10,636 KB |
testcase_13 | AC | 356 ms
10,604 KB |
testcase_14 | AC | 367 ms
10,568 KB |
testcase_15 | AC | 422 ms
10,532 KB |
testcase_16 | AC | 419 ms
10,688 KB |
testcase_17 | AC | 33 ms
10,100 KB |
testcase_18 | AC | 34 ms
10,564 KB |
testcase_19 | AC | 33 ms
10,040 KB |
testcase_20 | AC | 517 ms
10,544 KB |
testcase_21 | AC | 33 ms
10,132 KB |
testcase_22 | AC | 656 ms
10,784 KB |
testcase_23 | AC | 33 ms
10,104 KB |
testcase_24 | AC | 37 ms
10,156 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: Seq[int], r: Seq[int], mod: int, ) -> int: l = len(m) assert len(r) == l m = list(m) + [mod] p = [1] * (l + 1) x = [0] * (l + 1) for i, (n, b) in enumerate(zip(m, r)): assert n > 0 g, ip, _ = egcd(p[i], n) assert g == 1 t = (b - x[i]) % n * ip % n for j in range(i + 1, l + 1): x[j] += t * p[j] x[j] %= m[j] p[j] = p[j] * n % m[j] 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 from math import gcd def to_coprime( m: int, a: int, n: int, b: int, ) -> tup[int, int, int, int]: g = gcd(m, n) if (a - b) % g: return (-1, -1, -1, -1) m //= g n //= g u = gcd(m, g) v = g // u while g > 1: g = gcd(u, v) u *= g v //= g m *= u n *= v a %= m b %= n return m, a, n, b def to_pairwise_coprime( m: li[int], r: li[int], ) -> bool: n = len(m) assert len(r) == n for i in range(n): for j in range(i): ( m[i], r[i], m[j], r[j], ) = to_coprime( m[i], r[i], m[j], r[j] ) if m[i] == -1: return False return True def solve() -> None: n = int(rl()) rm = [map(int, rb()) for _ in range(n)] r, m = map(list, zip(*rm)) if not to_pairwise_coprime(m, r): print(-1) return mod = 10**9 + 7 if max(r) > 0: x = crt_mod(m, r, mod) print(x) return l = 1 for x in m: l = l * x % mod print(l) def main() -> None: t = 1 # t = int(rl()) for _ in range(t): solve() main()