結果

問題 No.2968 Final MIGISITA Strike
ユーザー 遭難者遭難者
提出日時 2024-11-01 13:57:14
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 3,981 bytes
コンパイル時間 260 ms
コンパイル使用メモリ 82,652 KB
実行使用メモリ 69,564 KB
最終ジャッジ日時 2024-11-06 21:59:45
合計ジャッジ時間 7,033 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 RE -
testcase_03 RE -
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 RE -
testcase_42 RE -
testcase_43 RE -
testcase_44 RE -
testcase_45 RE -
testcase_46 RE -
testcase_47 RE -
testcase_48 RE -
testcase_49 RE -
testcase_50 RE -
testcase_51 RE -
testcase_52 RE -
testcase_53 RE -
testcase_54 RE -
testcase_55 RE -
testcase_56 RE -
testcase_57 RE -
testcase_58 RE -
testcase_59 RE -
testcase_60 RE -
testcase_61 RE -
testcase_62 RE -
testcase_63 RE -
testcase_64 RE -
testcase_65 RE -
testcase_66 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

input = sys.stdin.readline
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')


def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y


def crt(bList, mList):
    r, m = 0, 1
    for i in range(len(bList)):
        d, x, y = egcd(m, mList[i])
        if (bList[i] - r) % d != 0:
            return [0, -1]
        tmp = (bList[i] - r) // d * x % (mList[i] // d)
        r += m * tmp
        m *= mList[i] // d
    return (r, m)


MOD = 998244353
H, W, N, M, S, C, X, Y = map(int, input().split())
Y = W - Y
H2, W2 = 2 * H, 2 * W
A = list(map(int, input().split()))
B = list(map(int, input().split()))
x, y = [0] * N, [0] * N
for i in range(N):
    x[i], y[i] = map(int, input().split())
    y[i] = W - y[i]
a, b = [0] * M, [0] * M
for i in range(M):
    a[i], b[i] = map(int, input().split())
    b[i] = W - b[i]
_, syu = crt([0, 0], [H2, W2])


def xy(t):
    xx, yy = (X + t) % H2, (Y + t) % W2
    return min(xx, H2 - xx), min(yy, W2 - yy)


L = []
for i in range(N):
    res, rres = crt([(x[i] - X) % H2, (y[i] - Y) % W2], [H2, W2])
    if rres != -1:
        L.append((res, A[i]))
    res, rres = crt([(-x[i] - X) % H2, (y[i] - Y) % W2], [H2, W2])
    if rres != -1:
        L.append((res, A[i]))
    res, rres = crt([(x[i] - X) % H2, (-y[i] - Y) % W2], [H2, W2])
    if rres != -1:
        L.append((res, A[i]))
    res, rres = crt([(-x[i] - X) % H2, (-y[i] - Y) % W2], [H2, W2])
    if rres != -1:
        L.append((res, A[i]))
for i in range(M):
    res, rres = crt([(a[i] - X) % H2, (b[i] - Y) % W2], [H2, W2])
    if rres != -1:
        L.append((res, -B[i]))
    res, rres = crt([(-a[i] - X) % H2, (b[i] - Y) % W2], [H2, W2])
    if rres != -1:
        L.append((res, -B[i]))
    res, rres = crt([(a[i] - X) % H2, (-b[i] - Y) % W2], [H2, W2])
    if rres != -1:
        L.append((res, -B[i]))
    res, rres = crt([(-a[i] - X) % H2, (-b[i] - Y) % W2], [H2, W2])
    if rres != -1:
        L.append((res, -B[i]))
L.append((0, 0))
L.append((syu, 0))
L.sort()
n = len(L)
now_hp = 0
min_hp = 0
ss, tt = 0, 0
for i in range(1 , n):
    real_hp = now_hp + L[i][1] - C * ((L[i][0] + X) // H + (L[i][0] + Y) // W)
    if S + real_hp - L[i][1] <= 0 or S + real_hp <= 0:
        if S + real_hp - L[i][1] > 0:
            x, y = xy(L[i][0])
            assert L[i][1] < 0
            tt += 1
            print(x, W - y, ss % MOD, tt % MOD)
            exit()
        assert i != 0
        ok, ng = L[i - 1][0], L[i][0]
        while ng - ok != 1:
            vs = (ok + ng) >> 1
            real_hp2 = now_hp - C * ((vs + X) // H + (vs + Y) // W)
            if S + real_hp2 <= 0:
                ng = vs
            else:
                ok = vs
        x, y = xy(ng)
        print(x, W - y, ss % MOD, tt % MOD)
        exit()
    now_hp += L[i][1]
    min_hp = min(min_hp, real_hp)
    if L[i][1] > 0:
        ss += 1
    if L[i][1] < 0:
        tt += 1
now_hp -= C * ((syu + X) // H + (syu + Y) // W)
if now_hp >= 0:
    assert S + min_hp > 0
    print(-1)
    exit()
k = (S + now_hp - 1) // -min_hp + 1
assert k > 0
S += k * now_hp
now_hp = 0
ss, tt = ss * k % MOD, tt * k % MOD
for i in range(1 , n):
    real_hp = now_hp + L[i][1] - C * ((L[i][0] + X) // H + (L[i][0] + Y) // W)
    if S + real_hp - L[i][1] <= 0 or S + real_hp <= 0:
        if S + real_hp - L[i][1] > 0:
            x, y = xy(L[i][0])
            assert L[i][1] < 0
            tt += 1
            print(x, W - y, ss % MOD, tt % MOD)
            exit()
        ok, ng = L[i - 1][0] , L[i][0]
        while ng - ok != 1:
            vs = (ok + ng) >> 1
            real_hp2 = now_hp - C * ((vs + X) // H + (vs + Y) // W)
            if S + real_hp2 <= 0:
                ng = vs
            else:
                ok = vs
        x, y = xy(ng)
        print(x, W - y, ss % MOD, tt % MOD)
        exit()
    now_hp += L[i][1]
    if L[i][1] > 0:
        ss += 1
    if L[i][1] < 0:
        tt += 1
exit(1)
0