結果

問題 No.2602 Real Collider
ユーザー strangerxxxstrangerxxx
提出日時 2024-05-01 18:35:29
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 929 ms / 2,000 ms
コード長 6,439 bytes
コンパイル時間 390 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 83,624 KB
最終ジャッジ日時 2024-11-22 00:27:02
合計ジャッジ時間 40,915 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
53,504 KB
testcase_01 AC 43 ms
53,632 KB
testcase_02 AC 41 ms
53,632 KB
testcase_03 AC 48 ms
55,296 KB
testcase_04 AC 46 ms
53,632 KB
testcase_05 AC 42 ms
53,504 KB
testcase_06 AC 42 ms
53,504 KB
testcase_07 AC 41 ms
53,632 KB
testcase_08 AC 42 ms
53,632 KB
testcase_09 AC 42 ms
53,888 KB
testcase_10 AC 929 ms
82,944 KB
testcase_11 AC 604 ms
81,472 KB
testcase_12 AC 271 ms
77,948 KB
testcase_13 AC 198 ms
77,100 KB
testcase_14 AC 278 ms
78,024 KB
testcase_15 AC 446 ms
79,744 KB
testcase_16 AC 619 ms
80,768 KB
testcase_17 AC 716 ms
81,024 KB
testcase_18 AC 220 ms
77,696 KB
testcase_19 AC 260 ms
77,696 KB
testcase_20 AC 634 ms
80,744 KB
testcase_21 AC 237 ms
78,328 KB
testcase_22 AC 244 ms
77,792 KB
testcase_23 AC 212 ms
77,796 KB
testcase_24 AC 248 ms
78,152 KB
testcase_25 AC 236 ms
77,800 KB
testcase_26 AC 284 ms
78,004 KB
testcase_27 AC 260 ms
78,068 KB
testcase_28 AC 361 ms
77,644 KB
testcase_29 AC 250 ms
77,940 KB
testcase_30 AC 260 ms
78,156 KB
testcase_31 AC 597 ms
80,000 KB
testcase_32 AC 539 ms
79,744 KB
testcase_33 AC 599 ms
80,256 KB
testcase_34 AC 671 ms
82,216 KB
testcase_35 AC 437 ms
78,848 KB
testcase_36 AC 279 ms
77,588 KB
testcase_37 AC 632 ms
80,128 KB
testcase_38 AC 680 ms
80,896 KB
testcase_39 AC 631 ms
80,512 KB
testcase_40 AC 399 ms
79,232 KB
testcase_41 AC 708 ms
80,384 KB
testcase_42 AC 607 ms
80,384 KB
testcase_43 AC 595 ms
81,804 KB
testcase_44 AC 721 ms
81,408 KB
testcase_45 AC 552 ms
80,728 KB
testcase_46 AC 487 ms
79,616 KB
testcase_47 AC 638 ms
80,768 KB
testcase_48 AC 553 ms
79,872 KB
testcase_49 AC 480 ms
79,616 KB
testcase_50 AC 440 ms
79,744 KB
testcase_51 AC 448 ms
79,360 KB
testcase_52 AC 354 ms
79,676 KB
testcase_53 AC 601 ms
80,512 KB
testcase_54 AC 519 ms
80,452 KB
testcase_55 AC 578 ms
80,176 KB
testcase_56 AC 543 ms
79,488 KB
testcase_57 AC 538 ms
80,116 KB
testcase_58 AC 404 ms
80,116 KB
testcase_59 AC 592 ms
80,512 KB
testcase_60 AC 411 ms
78,348 KB
testcase_61 AC 628 ms
80,640 KB
testcase_62 AC 682 ms
81,152 KB
testcase_63 AC 771 ms
83,016 KB
testcase_64 AC 739 ms
81,408 KB
testcase_65 AC 552 ms
81,340 KB
testcase_66 AC 659 ms
80,128 KB
testcase_67 AC 490 ms
80,412 KB
testcase_68 AC 548 ms
81,048 KB
testcase_69 AC 448 ms
81,640 KB
testcase_70 AC 469 ms
80,740 KB
testcase_71 AC 458 ms
79,360 KB
testcase_72 AC 625 ms
80,640 KB
testcase_73 AC 601 ms
81,536 KB
testcase_74 AC 598 ms
80,128 KB
testcase_75 AC 692 ms
81,664 KB
testcase_76 AC 574 ms
80,256 KB
testcase_77 AC 611 ms
80,876 KB
testcase_78 AC 691 ms
80,384 KB
testcase_79 AC 695 ms
81,444 KB
testcase_80 AC 791 ms
83,624 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import math


def resolve():
    import sys

    input = sys.stdin.readline
    q = int(input())
    xa, ya, xb, yb, xc, yc = map(int, input().split())
    x = (xa, ya)
    y = (xb, yb)
    z = (xc, yc)
    try:
        c = circumcenter2(x, y, z)
        d = distance(c, (xa, ya))
    except ZeroDivisionError:
        c = (0, 0)
        d = float("inf")
    da = (
        distance(x, y),
        distance(y, z),
        distance(z, x),
    )
    if da[0] >= da[1] + da[2]:
        c = center(x, y)
        d = distance(x, c)
    elif da[1] >= da[2] + da[0]:
        c = center(y, z)
        d = distance(y, c)
    elif da[2] >= da[0] + da[1]:
        c = center(z, x)
        d = distance(z, c)
    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)])


def islinear(pa, pb, pc):
    return (pa[0] - pb[0]) * (pa[1] - pc[1]) == (pa[0] - pc[0]) * (pa[1] - pb[1])


def center(x, y):
    return Fraction((x[0] + y[0]), 2), Fraction((x[1] + y[1]), 2)


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[0] ** 2 + pa[1] ** 2) * (pb[0] - pc[0])
        + (pb[0] ** 2 + pb[1] ** 2) * (pc[0] - pa[0])
        + (pc[0] ** 2 + pc[1] ** 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), Fraction(x1, y1)


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