結果

問題 No.2602 Real Collider
ユーザー cleanttedcleantted
提出日時 2023-11-27 06:33:50
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,791 bytes
コンパイル時間 298 ms
コンパイル使用メモリ 81,956 KB
実行使用メモリ 127,440 KB
最終ジャッジ日時 2023-11-27 06:34:17
合計ジャッジ時間 23,670 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 186 ms
91,984 KB
testcase_01 AC 178 ms
90,448 KB
testcase_02 AC 183 ms
91,984 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 254 ms
109,648 KB
testcase_13 AC 253 ms
99,024 KB
testcase_14 AC 265 ms
110,800 KB
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 AC 261 ms
103,504 KB
testcase_19 AC 244 ms
105,040 KB
testcase_20 WA -
testcase_21 AC 237 ms
102,480 KB
testcase_22 AC 270 ms
105,040 KB
testcase_23 AC 230 ms
100,688 KB
testcase_24 AC 245 ms
105,424 KB
testcase_25 AC 242 ms
105,040 KB
testcase_26 WA -
testcase_27 AC 284 ms
107,984 KB
testcase_28 WA -
testcase_29 AC 241 ms
104,784 KB
testcase_30 AC 247 ms
105,808 KB
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
testcase_60 WA -
testcase_61 WA -
testcase_62 WA -
testcase_63 WA -
testcase_64 WA -
testcase_65 WA -
testcase_66 WA -
testcase_67 WA -
testcase_68 WA -
testcase_69 WA -
testcase_70 WA -
testcase_71 WA -
testcase_72 WA -
testcase_73 WA -
testcase_74 WA -
testcase_75 WA -
testcase_76 WA -
testcase_77 WA -
testcase_78 WA -
testcase_79 WA -
testcase_80 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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
    
    def g():
        pxl = -10 ** 9
        pxr = 10 ** 9
        pyl = -10 ** 9
        pyr = 10 ** 9

        def f1(x, y):
            d1 = dist2(x, y, XA, YA)
            d2 = dist2(x, y, XB, YB)
            d3 = dist2(x, y, XC, YC)

            return max(d1, d2, d3) - min(d1, d2, d3)


        for _ in range(10 ** 5):
            px1 = (2 * pxl + pxr)
            px2 = (pxl + 2 * pxr)
            py1 = (2 * pyl + pyr)
            py2 = (pyl + 2 * pyr)

            d1 = f1(px1, py1)
            d2 = f1(px2, py1)
            d3 = f1(px1, py2)
            d4 = f1(px2, py2)

            d = min(d1, d2, d3, d4)
            if d == d1:
                pxr = px2
                pyr = py2
            elif d == d2:
                pxl = px1
                pyr = py2
            elif d == d3:
                pxr = px2
                pyl = py1
            elif d == d4:
                pxl = px1
                pyl = py1
        return dist2(pxl, pyl, XA, YA), pxl, pyl


    d, px, py = min(
        max(
            f(XA, YA, XB, YB),
            f(XB, YB, XC, YC),
            f(XC, YC, XA, YA),
        ),
        g()
    )

    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()
0