結果

問題 No.2578 Jewelry Store
ユーザー suisensuisen
提出日時 2023-01-11 19:35:39
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,367 bytes
コンパイル時間 421 ms
コンパイル使用メモリ 81,572 KB
実行使用メモリ 136,400 KB
最終ジャッジ日時 2023-12-05 23:31:42
合計ジャッジ時間 18,489 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
68,228 KB
testcase_01 AC 59 ms
68,228 KB
testcase_02 AC 118 ms
78,048 KB
testcase_03 AC 110 ms
77,920 KB
testcase_04 AC 154 ms
78,020 KB
testcase_05 WA -
testcase_06 AC 119 ms
78,048 KB
testcase_07 AC 157 ms
78,020 KB
testcase_08 AC 107 ms
77,920 KB
testcase_09 AC 156 ms
78,020 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 107 ms
78,048 KB
testcase_13 AC 108 ms
78,132 KB
testcase_14 AC 102 ms
78,020 KB
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 150 ms
78,020 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 156 ms
78,148 KB
testcase_21 AC 162 ms
78,020 KB
testcase_22 AC 109 ms
78,048 KB
testcase_23 WA -
testcase_24 AC 98 ms
77,892 KB
testcase_25 AC 110 ms
77,904 KB
testcase_26 AC 107 ms
77,920 KB
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 AC 547 ms
79,160 KB
testcase_31 WA -
testcase_32 AC 254 ms
114,644 KB
testcase_33 WA -
testcase_34 AC 335 ms
117,984 KB
testcase_35 AC 155 ms
92,008 KB
testcase_36 AC 280 ms
120,060 KB
testcase_37 AC 198 ms
78,540 KB
testcase_38 AC 219 ms
78,676 KB
testcase_39 WA -
testcase_40 AC 219 ms
78,944 KB
testcase_41 WA -
testcase_42 AC 205 ms
78,300 KB
testcase_43 AC 247 ms
78,408 KB
testcase_44 WA -
testcase_45 AC 222 ms
78,684 KB
testcase_46 WA -
testcase_47 AC 1,013 ms
82,868 KB
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 AC 211 ms
78,412 KB
testcase_52 AC 479 ms
79,032 KB
testcase_53 AC 115 ms
77,772 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
from typing import List

input = sys.stdin.readline

#BEGIN: https://qiita.com/Kiri8128/items/eca965fe86ea5f4cbb98

def gcd(a: int, b: int) -> int:
    while b: a, b = b, a % b
    return a

def isPrimeMR(n: int):
    d = n - 1
    d = d // (d & -d)
    L = [2]
    for a in L:
        t = d
        y = pow(a, t, n)
        if y == 1: continue
        while y != n - 1:
            y = (y * y) % n
            if y == 1 or t == n - 1: return 0
            t <<= 1
    return 1

def findFactorRho(n: int):
    m = 1 << n.bit_length() // 8
    for c in range(1, 99):
        f = lambda x: (x * x + c) % n
        y, r, q, g = 2, 1, 1, 1
        x = ys = y
        while g == 1:
            x = y
            for i in range(r):
                y = f(y)
            k = 0
            while k < r and g == 1:
                ys = y
                for i in range(min(m, r - k)):
                    y = f(y)
                    q = q * abs(x - y) % n
                g = gcd(q, n)
                k += m
            r <<= 1
        if g == n:
            g = 1
            while g == 1:
                ys = f(ys)
                g = gcd(abs(x - ys), n)
        if g < n:
            if isPrimeMR(g): return g
            elif isPrimeMR(n // g): return n // g
            return findFactorRho(g)

def primeFactor(n):
    i = 2
    ret = {}
    rhoFlg = 0
    while i*i <= n:
        k = 0
        while n % i == 0:
            n //= i
            k += 1
        if k: ret[i] = k
        i += 1 + i % 2
        if i == 101 and n >= 2 ** 20:
            while n > 1:
                if isPrimeMR(n):
                    ret[n], n = 1, 1
                else:
                    rhoFlg = 1
                    j = findFactorRho(n)
                    k = 0
                    while n % j == 0:
                        n //= j
                        k += 1
                    ret[j] = k

    if n > 1: ret[n] = 1
    if rhoFlg: ret = {x: ret[x] for x in sorted(ret)}
    return ret

#END: https://qiita.com/Kiri8128/items/eca965fe86ea5f4cbb98

def divisors(factorized):
    res = [1]
    for p, c in factorized:
        siz = len(res)
        for i in range(siz):
            d = res[i]
            for _ in range(c):
                d *= p
                res.append(d)
    res.sort()
    return res

P = 998244353

t, m = map(int, input().split())
pf = primeFactor(m).keys()
k = len(pf)

m_div_p = [m // p for p in pf]

parity = [bin(s).count('1') & 1 for s in range(1 << k)]

def subset_zeta_product(f: List[int]):
    block = 1
    while block < 1 << k:
        offset = 0
        while offset < 1 << k:
            for i in range(offset, offset + block):
                f[i + block] = f[i + block] * f[i] % P
            offset += 2 * block
        block <<= 1

def solve():
    _, x0, c, d = map(int, input().split())

    zeta = [1] * (1 << k)

    wi = x0
    for ai in map(int, input().split()):
        if m % ai == 0:
            t = 0
            for j, mp in enumerate(m_div_p):
                t |= (mp % ai != 0) << j

            zeta[t] = zeta[t] * (1 + wi) % P
        wi = (c * wi + d) % P
    
    subset_zeta_product(zeta)

    ans = 0
    for s in range(1 << k):
        if parity[s]:
            ans -= zeta[s]
        else:
            ans += zeta[s]
    if m == 1:
        ans -= 1

    print(ans % P)

for _ in range(t):
    solve()
0