結果

問題 No.2968 Final MIGISITA Strike
ユーザー 遭難者遭難者
提出日時 2024-11-05 10:17:12
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,600 ms / 2,525 ms
コード長 3,970 bytes
コンパイル時間 576 ms
コンパイル使用メモリ 81,948 KB
実行使用メモリ 113,736 KB
最終ジャッジ日時 2024-11-15 22:58:09
合計ジャッジ時間 45,401 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
53,088 KB
testcase_01 AC 39 ms
53,696 KB
testcase_02 AC 41 ms
54,196 KB
testcase_03 AC 40 ms
54,556 KB
testcase_04 AC 40 ms
53,780 KB
testcase_05 AC 40 ms
54,272 KB
testcase_06 AC 39 ms
53,016 KB
testcase_07 AC 40 ms
53,936 KB
testcase_08 AC 40 ms
53,560 KB
testcase_09 AC 39 ms
53,856 KB
testcase_10 AC 706 ms
95,068 KB
testcase_11 AC 797 ms
95,848 KB
testcase_12 AC 343 ms
83,132 KB
testcase_13 AC 509 ms
87,940 KB
testcase_14 AC 309 ms
82,692 KB
testcase_15 AC 1,288 ms
104,644 KB
testcase_16 AC 1,250 ms
104,980 KB
testcase_17 AC 1,109 ms
100,140 KB
testcase_18 AC 716 ms
90,188 KB
testcase_19 AC 986 ms
95,648 KB
testcase_20 AC 1,075 ms
102,016 KB
testcase_21 AC 464 ms
84,028 KB
testcase_22 AC 700 ms
87,636 KB
testcase_23 AC 1,376 ms
107,784 KB
testcase_24 AC 1,442 ms
109,432 KB
testcase_25 AC 1,600 ms
113,736 KB
testcase_26 AC 689 ms
88,312 KB
testcase_27 AC 940 ms
100,144 KB
testcase_28 AC 709 ms
88,564 KB
testcase_29 AC 856 ms
92,200 KB
testcase_30 AC 180 ms
78,444 KB
testcase_31 AC 172 ms
78,352 KB
testcase_32 AC 189 ms
78,748 KB
testcase_33 AC 173 ms
78,296 KB
testcase_34 AC 701 ms
88,836 KB
testcase_35 AC 621 ms
87,308 KB
testcase_36 AC 244 ms
78,972 KB
testcase_37 AC 546 ms
88,148 KB
testcase_38 AC 543 ms
87,820 KB
testcase_39 AC 545 ms
86,408 KB
testcase_40 AC 748 ms
89,972 KB
testcase_41 AC 624 ms
81,108 KB
testcase_42 AC 445 ms
83,936 KB
testcase_43 AC 711 ms
86,880 KB
testcase_44 AC 914 ms
93,568 KB
testcase_45 AC 402 ms
81,168 KB
testcase_46 AC 1,162 ms
97,972 KB
testcase_47 AC 808 ms
90,292 KB
testcase_48 AC 786 ms
91,736 KB
testcase_49 AC 75 ms
75,976 KB
testcase_50 AC 454 ms
84,132 KB
testcase_51 AC 666 ms
88,764 KB
testcase_52 AC 632 ms
88,984 KB
testcase_53 AC 894 ms
87,584 KB
testcase_54 AC 367 ms
82,548 KB
testcase_55 AC 1,098 ms
96,512 KB
testcase_56 AC 577 ms
87,472 KB
testcase_57 AC 992 ms
95,648 KB
testcase_58 AC 786 ms
93,172 KB
testcase_59 AC 530 ms
86,816 KB
testcase_60 AC 460 ms
84,592 KB
testcase_61 AC 404 ms
83,452 KB
testcase_62 AC 878 ms
92,136 KB
testcase_63 AC 781 ms
92,844 KB
testcase_64 AC 42 ms
54,504 KB
testcase_65 AC 224 ms
84,068 KB
testcase_66 AC 232 ms
85,680 KB
権限があれば一括ダウンロードができます

ソースコード

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 = [0 for _ in range(N)]
B = [0 for _ in range(M)]
x, y = [0] * N, [0] * N
for i in range(N):
    x[i], y[i], A[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], 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 + min_hp - 1) // -now_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