結果

問題 No.2628 Shrinkage
ユーザー rlangevin
提出日時 2024-02-18 12:50:22
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 1,204 bytes
コンパイル時間 148 ms
コンパイル使用メモリ 82,460 KB
実行使用メモリ 55,556 KB
最終ジャッジ日時 2024-09-29 00:22:51
合計ジャッジ時間 2,034 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 20 WA * 8
権限があれば一括ダウンロードができます

ソースコード

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

import sys
input = sys.stdin.readline
from math import gcd
def frac(x, y):
if x == 0:
return (0, 1)
if y == 0:
return (1, 0)
g = gcd(x, y)
x, y = x // g, y // g
if x < 0:
return (-x, -y)
return (x, y)
class Point:
def __init__(self, x, y):
self.x = x
self.y = y
def cross(a, b, c, d):
s = (a.x - b.x) * (c.y - a.y) - (a.y - b.y) * (c.x - a.x)
t = (a.x - b.x) * (d.y - a.y) - (a.y - b.y) * (d.x - a.x)
if s * t > 0:
return False
s = (c.x - d.x) * (a.y - c.y) - (c.y - d.y) * (a.x - c.x)
t = (c.x - d.x) * (b.y - c.y) - (c.y - d.y) * (b.x - c.x)
if s * t > 0:
return False
return True
T = int(input())
for _ in range(T):
x1, y1, x2, y2, X1, Y1, X2, Y2 = map(int, input().split())
dx1 = X1 - x1
dx2 = X2 - x2
dy1 = Y1 - y1
dy2 = Y2 - y2
a = Point(x1, y1)
b = Point(x2, y2)
c = Point(X1, Y1)
d = Point(X2, Y2)
if cross(a, c, b, d) or (frac(x2 - x1, y2 - y1) != frac(X2 - X1, Y2 - Y1)):
print("No")
elif (x2 - x1) ** 2 + (y2 - y1) ** 2 <= (X2 - X1) ** 2 + (Y2 - Y1) ** 2:
print("No")
else:
print("Yes")
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0