結果

問題 No.2968 Final MIGISITA Strike
ユーザー 遭難者遭難者
提出日時 2024-11-06 14:00:46
言語 PyPy3
(7.3.15)
結果
RE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,945 bytes
コンパイル時間 485 ms
コンパイル使用メモリ 82,508 KB
実行使用メモリ 114,084 KB
最終ジャッジ日時 2024-11-06 22:01:07
合計ジャッジ時間 41,721 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
55,160 KB
testcase_01 AC 41 ms
54,316 KB
testcase_02 AC 41 ms
53,660 KB
testcase_03 AC 40 ms
54,160 KB
testcase_04 AC 42 ms
54,796 KB
testcase_05 AC 41 ms
53,812 KB
testcase_06 AC 42 ms
54,580 KB
testcase_07 AC 41 ms
54,056 KB
testcase_08 AC 41 ms
54,908 KB
testcase_09 AC 41 ms
53,756 KB
testcase_10 AC 694 ms
95,124 KB
testcase_11 AC 754 ms
96,004 KB
testcase_12 AC 363 ms
83,188 KB
testcase_13 AC 500 ms
87,584 KB
testcase_14 AC 314 ms
82,880 KB
testcase_15 AC 1,314 ms
104,444 KB
testcase_16 AC 1,240 ms
104,920 KB
testcase_17 AC 1,104 ms
99,772 KB
testcase_18 AC 704 ms
90,492 KB
testcase_19 AC 990 ms
96,092 KB
testcase_20 AC 1,049 ms
101,816 KB
testcase_21 AC 467 ms
84,140 KB
testcase_22 AC 706 ms
87,672 KB
testcase_23 AC 1,349 ms
108,116 KB
testcase_24 AC 1,419 ms
109,824 KB
testcase_25 AC 1,592 ms
114,084 KB
testcase_26 AC 678 ms
87,956 KB
testcase_27 AC 928 ms
99,080 KB
testcase_28 AC 690 ms
87,292 KB
testcase_29 AC 846 ms
92,220 KB
testcase_30 AC 173 ms
78,772 KB
testcase_31 AC 172 ms
78,132 KB
testcase_32 AC 186 ms
78,908 KB
testcase_33 AC 167 ms
78,364 KB
testcase_34 AC 687 ms
89,072 KB
testcase_35 AC 614 ms
87,232 KB
testcase_36 AC 235 ms
79,056 KB
testcase_37 AC 532 ms
89,136 KB
testcase_38 AC 535 ms
88,044 KB
testcase_39 AC 547 ms
86,392 KB
testcase_40 AC 724 ms
90,212 KB
testcase_41 AC 615 ms
81,584 KB
testcase_42 AC 431 ms
83,776 KB
testcase_43 AC 699 ms
86,932 KB
testcase_44 AC 910 ms
93,488 KB
testcase_45 AC 405 ms
80,640 KB
testcase_46 AC 1,114 ms
97,780 KB
testcase_47 AC 786 ms
89,996 KB
testcase_48 AC 756 ms
92,096 KB
testcase_49 AC 77 ms
76,008 KB
testcase_50 AC 450 ms
84,920 KB
testcase_51 AC 659 ms
88,364 KB
testcase_52 AC 612 ms
88,700 KB
testcase_53 AC 894 ms
87,784 KB
testcase_54 AC 359 ms
82,392 KB
testcase_55 AC 1,055 ms
96,992 KB
testcase_56 AC 562 ms
87,608 KB
testcase_57 AC 951 ms
95,704 KB
testcase_58 AC 777 ms
93,220 KB
testcase_59 AC 520 ms
86,520 KB
testcase_60 AC 460 ms
84,696 KB
testcase_61 AC 404 ms
83,276 KB
testcase_62 AC 881 ms
92,200 KB
testcase_63 AC 741 ms
93,264 KB
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 = [0] * N
B = [0] * 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 + 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