結果

問題 No.62 リベリオン(Extra)
ユーザー Mao-betaMao-beta
提出日時 2024-03-03 22:03:13
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 232 ms / 5,000 ms
コード長 3,634 bytes
コンパイル時間 241 ms
コンパイル使用メモリ 82,192 KB
実行使用メモリ 79,296 KB
最終ジャッジ日時 2024-09-29 17:08:30
合計ジャッジ時間 1,907 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 3
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys
import math
import bisect
from heapq import heapify, heappop, heappush
from collections import deque, defaultdict, Counter
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD99 = 998244353
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
SMI = lambda: input().split()
SLI = lambda: list(SMI())
EI = lambda m: [NLI() for _ in range(m)]
def extgcd(a, b):
if b:
d, y, x = extgcd(b, a % b)
y -= (a // b)*x
return d, x, y
return a, 1, 0
def main():
Q = NI()
for qi in range(Q):
W, H, D, Mx, My, Hx, Hy, Vx, Vy = NMI()
if Vx < 0:
Vx *= -1
Hx = W - Hx
Mx = W - Mx
if Vy < 0:
Vy *= -1
Hy = H - Hy
My = H - My
if Vx == 0:
if Hx != Mx:
print("Miss")
else:
if My < Hy:
My = 2*H - My
if Vy * D < My - Hy:
print("Miss")
else:
print("Hit")
continue
if Vy == 0:
if Hy != My:
print("Miss")
else:
if Mx < Hx:
Mx = 2*W - Mx
if Vx * D < Mx - Hx:
print("Miss")
else:
print("Hit")
continue
vg = math.gcd(Vx, Vy)
Vx //= vg
Vy //= vg
D *= vg
# Vx > 0, Vy > 0,
# (Mx + 2W*i, My + 2H*j)
# (2W-Mx + 2W*i, My + 2H*j)
# (Mx + 2W*i, 2H-My + 2H*j)
# (2W-Mx + 2W*i, 2H-My + 2H*j)
# Vy(x-Hx) - Vx(y-Hy) = 0
# Vy(Mx-Hx + 2W*i) - Vx(My-Hy + 2H*j) = 0
# 2Vy*W*i - 2Vx*H*j = -Vy(Mx-Hx) + Vx(My-Hy)
# i, j
# g=gcd(2Vy*W, -2Vx*H)
# ai+bj = Rextgcdi,j(p, q)
# a(i-p) + b(j-q) = 0
# ipbHxVx
# ibx2W*b, jay-2H*a
# mx + (2W*b) * k > Hx my + (2H*a) * k > Hyk
# k > (Hx - mx) / (2W*b), k > (Hy - my) / (2H*a)
MXS = [Mx, Mx, 2*W-Mx, 2*W-Mx]
MYS = [My, 2*H-My, My, 2*H-My]
ok = False
for MX, MY in zip(MXS, MYS):
# if ok:
# break
R = -Vy*(MX-Hx) + Vx*(MY-Hy)
g = math.gcd(2*Vy*W, -2*Vx*H)
if R % g:
continue
a = 2*Vy*W // g
b = -2*Vx*H // g
d, p, q = extgcd(a, b)
p *= R // g // d
q *= R // g // d
# print(a, p, b, q, R//g)
assert a * p + b * q == R//g, (a * p + b * q, R//g, d)
mx = MX + 2*W * p
my = MY + 2*H * q
kx = (Hx-mx) // (2*W*b)
mx += kx * 2*W*b
my += -kx * 2*H*a
if mx - Hx <= Vx * D:
# print(f"H: {(Hx, Hy)}, M: {(mx, my)}, V: {(Vx, Vy)}, a*p+b*q=R//g: ({a})*({p})+({b})*({q})={R//g}")
ok = True
if ok:
# print("#")
print("Hit")
else:
# print("#")
print("Miss")
if __name__ == "__main__":
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0