#814027 (PyPy3) No.2119 一般化百五減算

• 問題: No.2119 一般化百五減算
• ユーザー: mkawa2
• 提出日時: 2022-11-04 21:50:13
• 言語: PyPy3 (7.3.15)
• 結果: TLE
• 実行時間: -
• コード長: 1,967 bytes
• コンパイル時間: 126 ms
• コンパイル使用メモリ: 82,388 KB
• 実行使用メモリ: 83,096 KB
• 最終ジャッジ日時: 2024-07-18 19:35:23
• 合計ジャッジ時間: 7,552 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

ファイルパターン	結果
other	AC * 21 TLE * 2 -- * 2

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
import sys
sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353
import typing
def inv_gcd(a, b):
    a %= b
    if a == 0: return b, 0
    s, t = b, a
    m0, m1 = 0, 1
    while t:
        u = s//t
        s -= t*u
        m0 -= m1*u
        s, t = t, s
        m0, m1 = m1, m0
    if m0 < 0: m0 += b//s
    return s, m0
# 複数の「mで割ったらr余る」という条件を満たすxをmod zで返す
# 返り値 x,z（解なしの場合は0,0）
def crt(r: typing.List[int], m: typing.List[int]) -> typing.Tuple[int, int]:
    assert len(r) == len(m)
    n = len(r)
    r0, m0 = 0, 1
    for i in range(n):
        assert 1 <= m[i]
        r1 = r[i]%m[i]
        m1 = m[i]
        if m0 < m1:
            r0, r1 = r1, r0
            m0, m1 = m1, m0
        if m0%m1 == 0:
            if r0%m1 != r1: return 0, 0
            continue
        g, im = inv_gcd(m0, m1)
        u1 = m1//g
        if (r1-r0)%g: return 0, 0
        x = (r1-r0)//g%u1*im%u1
        r0 += x*m0
        m0 *= u1
        if r0 < 0: r0 += m0
        if r0 > N: return 0, 0
    return r0, m0
N = II()
m = II()
bb, cc = [], []
for _ in range(m):
    b, c = LI()
    if b == 1: continue
    c %= b
    bb.append(b)
    cc.append(c)
x, z = crt(cc, bb)
# print(x,z)
if z == 0 or x > N:
    print("NaN")
else:
    print(x)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX