#978362 (PyPy3) No.2602 Real Collider

• 問題: No.2602 Real Collider
• ユーザー: strangerxxx
• 提出日時: 2024-05-01 18:24:58
• 言語: PyPy3 (7.3.15)
• 結果: WA
• 実行時間: -
• コード長: 6,418 bytes
• コンパイル時間: 363 ms
• コンパイル使用メモリ: 81,904 KB
• 実行使用メモリ: 80,460 KB
• 最終ジャッジ日時: 2024-11-22 00:11:47
• 合計ジャッジ時間: 22,610 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 4 WA * 74

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
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:
        d = -1
    da = (
        distance(x, y),
        distance(y, z),
        distance(z, x),
    )
    mx = max(da)
    if mx > d:
        if da[0] == mx:
            c = center(x, y)
            d = distance(x, c)
        elif da[1] == mx:
            c = center(y, z)
            d = distance(y, c)
        else:
            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**2 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()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX