結果

問題 No.2602 Real Collider
ユーザー strangerxxxstrangerxxx
提出日時 2024-05-01 17:44:43
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 5,859 bytes
コンパイル時間 283 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 84,492 KB
最終ジャッジ日時 2024-11-21 23:19:51
合計ジャッジ時間 51,096 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
53,504 KB
testcase_01 AC 40 ms
54,016 KB
testcase_02 AC 40 ms
54,016 KB
testcase_03 AC 47 ms
55,808 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 665 ms
82,200 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 521 ms
79,368 KB
testcase_16 AC 693 ms
80,936 KB
testcase_17 AC 804 ms
82,028 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 310 ms
78,392 KB
testcase_27 WA -
testcase_28 AC 406 ms
78,456 KB
testcase_29 WA -
testcase_30 WA -
testcase_31 AC 689 ms
80,124 KB
testcase_32 AC 621 ms
80,988 KB
testcase_33 AC 695 ms
80,088 KB
testcase_34 AC 743 ms
82,808 KB
testcase_35 AC 497 ms
79,840 KB
testcase_36 AC 304 ms
78,656 KB
testcase_37 AC 723 ms
80,804 KB
testcase_38 AC 773 ms
80,708 KB
testcase_39 AC 714 ms
80,128 KB
testcase_40 AC 446 ms
79,864 KB
testcase_41 AC 781 ms
81,176 KB
testcase_42 AC 678 ms
80,736 KB
testcase_43 AC 675 ms
82,660 KB
testcase_44 AC 824 ms
81,956 KB
testcase_45 AC 603 ms
81,356 KB
testcase_46 AC 541 ms
79,348 KB
testcase_47 AC 715 ms
80,136 KB
testcase_48 AC 610 ms
80,248 KB
testcase_49 AC 535 ms
79,492 KB
testcase_50 AC 486 ms
79,360 KB
testcase_51 AC 496 ms
79,904 KB
testcase_52 AC 412 ms
79,332 KB
testcase_53 AC 674 ms
80,540 KB
testcase_54 AC 611 ms
80,092 KB
testcase_55 AC 636 ms
81,128 KB
testcase_56 AC 610 ms
80,284 KB
testcase_57 AC 590 ms
79,924 KB
testcase_58 AC 435 ms
80,476 KB
testcase_59 AC 651 ms
79,988 KB
testcase_60 AC 446 ms
78,564 KB
testcase_61 AC 657 ms
81,632 KB
testcase_62 AC 764 ms
81,712 KB
testcase_63 AC 856 ms
84,492 KB
testcase_64 AC 825 ms
81,428 KB
testcase_65 AC 604 ms
81,404 KB
testcase_66 AC 758 ms
80,848 KB
testcase_67 AC 535 ms
82,268 KB
testcase_68 AC 585 ms
82,216 KB
testcase_69 AC 506 ms
81,132 KB
testcase_70 AC 508 ms
80,000 KB
testcase_71 AC 526 ms
79,900 KB
testcase_72 AC 678 ms
80,760 KB
testcase_73 AC 694 ms
81,496 KB
testcase_74 AC 677 ms
80,992 KB
testcase_75 AC 798 ms
81,464 KB
testcase_76 AC 648 ms
80,460 KB
testcase_77 AC 670 ms
80,720 KB
testcase_78 AC 802 ms
82,004 KB
testcase_79 AC 782 ms
83,720 KB
testcase_80 AC 876 ms
83,596 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import math


def resolve():
    import sys

    input = sys.stdin.readline
    MOD = 1000000007
    q = int(input())
    xa, ya, xb, yb, xc, yc = map(int, input().split())
    c = circumcenter2((xa, ya), (xb, yb), (xc, yc))
    d = distance(c, (xa, ya))
    for _ in range(q):
        x, y = map(int, input().split())
        print("Yes" if distance(c, (x, y)) <= d else "No")


class Fraction:
    def __init__(self, a: int = 0, b: int = 1) -> None:
        if isinstance(a, Fraction):
            self.a, self.b = a.a, a.b
            return
        a, b = int(a), int(b)
        if b == 0:
            raise ZeroDivisionError(f"{a}/{b}")
        if b < 0:
            a, b = -a, -b
        self.a, self.b = a, b
        self._reducion()

    def _reducion(self):
        g = math.gcd(self.a, self.b)
        self.a //= g
        self.b //= g

    def __add__(self, other):
        if isinstance(other, Fraction):
            g = math.gcd(self.b, other.b)
            x = other.b // g * self.a
            y = self.b // g * other.a
            return Fraction(x + y, self.b // g * other.b)
        return Fraction(self.a + other * self.b, self.b)

    def __iadd__(self, other):
        if isinstance(other, Fraction):
            g = math.gcd(self.b, other.b)
            self.a *= other.b // g
            self.a += self.b // g * other.a
            self.b *= other.b // g
        else:
            self.a += other * self.b
        self._reducion()
        return self

    __radd__ = __add__

    def __sub__(self, other):
        if isinstance(other, Fraction):
            return self.__add__(-other)
        return self.__add__(-other)

    def __isub__(self, other):
        if isinstance(other, Fraction):
            return self.__iadd__(-other.a, other.b)
        return self.__iadd__(-other)

    def __rsub__(self, other):
        return -self + other

    def __mul__(self, other):
        if isinstance(other, Fraction):
            return Fraction(self.a * other.a, self.b * other.b)
        else:
            return Fraction(self.a * other, self.b)

    def __imul__(self, other):
        if isinstance(other, Fraction):
            self.a *= other.a
            self.b *= other.b
        else:
            self.a *= other
        self._reducion()
        return self

    __rmul__ = __mul__

    def __floordiv__(self, other):
        if isinstance(other, Fraction):
            return self.__mul__(other.inverse())
        return Fraction(self.a, self.b * other)

    def __ifloordiv__(self, other):
        if isinstance(other, Fraction):
            return self.__imul__(other.inverse())
        self.b *= other
        self._reducion()
        return self

    def __rfloordiv__(self, other):
        return self.inverse() * other

    __truediv__ = __floordiv__
    __itruediv__ = __ifloordiv__
    __rtruediv__ = __rfloordiv__

    def __pow__(self, other):
        if isinstance(other, Fraction):
            if other.b == 1:
                return self.__pow__(other.a)
            raise NotImplementedError
        return Fraction(self.a**other, self.b**other)

    def __ipow__(self, other):
        if isinstance(other, Fraction):
            if other.b == 1:
                return self.__ipow__(other.a)
            raise NotImplementedError
        self.a **= other
        self.b **= other
        return self

    def __rpow__(self, other):
        if self.b != 1:
            raise NotImplementedError
        return other**self.a

    def __floor__(self) -> int:
        return self.a // self.b

    def __ceil__(self) -> int:
        return (self.a + self.b - 1) // self.b

    __int__ = __floor__

    def __float__(self):
        return self.a / self.b

    def inverse(self):
        if self.a == 0:
            raise ZeroDivisionError(f"tring to calcuate inverse of {self.a}/{self.b}")
        return Fraction(self.b, self.a)

    def __pos__(self):
        return Fraction(self.a, self.b)

    def __neg__(self):
        return Fraction(-self.a, self.b)

    def __abs__(self):
        return Fraction(abs(self.a), self.b)

    def __eq__(self, other) -> bool:
        if isinstance(other, Fraction):
            return self.a == other.a and self.b == other.b
        return self.a == self.b * other

    def __gt__(self, other):
        if isinstance(other, Fraction):
            return self.a * other.b > other.a * self.b
        return self.a > self.b * other

    def __ge__(self, other):
        if isinstance(other, Fraction):
            return self.a * other.b >= other.a * self.b
        return self.a >= self.b * other

    def __lt__(self, other):
        if isinstance(other, Fraction):
            return self.a * other.b < other.a * self.b
        return self.a < self.b * other

    def __le__(self, other):
        if isinstance(other, Fraction):
            return self.a * other.b <= other.a * self.b
        return self.a <= self.b * other

    def __str__(self) -> str:
        return f"{self.a}/{self.b}"

    __repr__ = __str__

    def __hash__(self) -> int:
        return hash(self.__str__())


def distance(pa, pb):
    return sum([(i - j) ** 2 for i, j in zip(pa, pb)]) ** 0.5


def circumcenter2(pa, pb, pc):
    # 外心
    x0 = (
        (pa[0] ** 2 + pa[1] ** 2) * (pb[1] - pc[1])
        + (pb[0] ** 2 + pb[1] ** 2) * (pc[1] - pa[1])
        + (pc[0] ** 2 + pc[1] ** 2) * (pa[1] - pb[1])
    )
    y0 = 2 * ((pb[1] - pc[1]) * (pa[0] - pb[0]) - (pa[1] - pb[1]) * (pb[0] - pc[0]))
    x1 = (
        (pa[1] ** 2 + pa[0] ** 2) * (pb[0] - pc[0])
        + (pb[1] ** 2 + pb[0] ** 2) * (pc[0] - pa[0])
        + (pc[1] ** 2 + pc[0] ** 2) * (pa[0] - pb[0])
    )
    y1 = 2 * ((pb[0] - pc[0]) * (pa[1] - pb[1]) - (pa[0] - pb[0]) * (pb[1] - pc[1]))
    return (
        Fraction(x0, y0) if y0 else 0,
        Fraction(x1, y1) if y1 else 0,
    )


if __name__ == "__main__":
    resolve()
0