結果
| 問題 |
No.2602 Real Collider
|
| ユーザー |
cleantted
|
| 提出日時 | 2023-11-27 05:35:11 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 1,758 bytes |
| コンパイル時間 | 428 ms |
| コンパイル使用メモリ | 82,688 KB |
| 実行使用メモリ | 127,616 KB |
| 最終ジャッジ日時 | 2024-09-26 12:09:09 |
| 合計ジャッジ時間 | 22,525 ms |
|
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 13 WA * 65 |
ソースコード
import copy
import heapq
import itertools
import math
import operator
import sys
from bisect import bisect, bisect_left, bisect_right, insort
from collections import Counter, deque
from fractions import Fraction
from functools import cmp_to_key, lru_cache, partial
from inspect import currentframe
from math import ceil, gcd, log10, pi, sqrt
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
# mod = 10 ** 9 + 7
mod = 998244353
# mod = 1 << 128
# mod = 10 ** 30 + 1
INF = 1 << 61
DIFF = 10 ** -9
DX = [1, 0, -1, 0, 1, 1, -1, -1]
DY = [0, 1, 0, -1, 1, -1, 1, -1]
def read_values(): return tuple(map(int, input().split()))
def read_index(): return tuple(map(lambda x: int(x) - 1, input().split()))
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for _ in range(N)]
def dprint(*values): print(*values, file=sys.stderr)
def dprint2(*values):
names = {id(v): k for k, v in currentframe().f_back.f_locals.items()}
dprint(", ".join(f"{names.get(id(value), '???')}={repr(value)}" for value in values))
def main():
Q = int(input())
XA, YA, XB, YB, XC, YC = read_list()
L = read_lists(Q)
def dist2(x1, y1, x2, y2):
return (x1 - x2) ** 2 + (y1 - y2) ** 2
def f(x1, y1, x2, y2):
px = (x1 + x2) / 2
py = (y1 + y2) / 2
return dist2(px, py, x1, y1), px, py
d, px, py = max(
f(XA, YA, XB, YB),
f(XB, YB, XC, YC),
f(XC, YC, XA, YA),
)
res = []
for x, y in L:
d2 = dist2(x, y, px, py)
if d + DIFF >= d2:
res.append("Yes")
else:
res.append("No")
print(*res, sep="\n")
if __name__ == "__main__":
main()
cleantted