結果

問題 No.2628 Shrinkage
ユーザー katonyonkokatonyonko
提出日時 2024-02-16 21:43:49
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 1,430 bytes
コンパイル時間 182 ms
コンパイル使用メモリ 82,592 KB
実行使用メモリ 57,640 KB
最終ジャッジ日時 2024-09-28 19:57:19
合計ジャッジ時間 2,143 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 1 WA * 27
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math
_INPUT = """\
6
3
0 6 6 6 2 2 4 2
3 1 4 1 5 9 2 6
1 1 2 2 3 3 4 4
"""
def input():
return sys.stdin.readline()[:-1]
def solve(test):
t=int(input())
for _ in range(t):
x1,y1,x2,y2,X1,Y1,X2,Y2=map(int, input().split())
if x1==X1 and y1==Y1 and x2==X2 and y2==Y2: print("Yes")
else:
if (x1-x2)**2+(y1-y2)**2>(X1-X2)**2+(Y1-Y2)**2 and (X1-X2)*(y1-y2)==(Y1-Y2)*(x1-x2):
print("Yes")
else:
print("No")
def random_input():
from random import randint,shuffle
N=randint(1,10)
M=randint(1,N)
A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
shuffle(A)
return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3
def simple_solve():
return []
def main(test):
if test==0:
solve(0)
elif test==1:
sys.stdin = io.StringIO(_INPUT)
case_no=int(input())
for _ in range(case_no):
solve(0)
else:
for i in range(1000):
sys.stdin = io.StringIO(random_input())
x=solve(1)
y=simple_solve()
if x!=y:
print(i,x,y)
print(*[line for line in sys.stdin],sep='')
break
#0:1:2:
main(0)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0