結果
問題 | No.55 正方形を描くだけの簡単なお仕事です。 |
ユーザー | McGregorsh |
提出日時 | 2022-06-14 12:00:58 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,276 bytes |
コンパイル時間 | 190 ms |
コンパイル使用メモリ | 82,524 KB |
実行使用メモリ | 92,148 KB |
最終ジャッジ日時 | 2024-04-10 05:09:52 |
合計ジャッジ時間 | 5,257 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 232 ms
91,608 KB |
testcase_01 | AC | 124 ms
83,980 KB |
testcase_02 | AC | 235 ms
91,564 KB |
testcase_03 | AC | 238 ms
92,048 KB |
testcase_04 | AC | 122 ms
83,612 KB |
testcase_05 | AC | 123 ms
83,792 KB |
testcase_06 | AC | 123 ms
83,628 KB |
testcase_07 | AC | 124 ms
83,536 KB |
testcase_08 | AC | 122 ms
83,828 KB |
testcase_09 | AC | 123 ms
83,824 KB |
testcase_10 | AC | 122 ms
83,828 KB |
testcase_11 | AC | 196 ms
91,144 KB |
testcase_12 | AC | 122 ms
83,796 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 121 ms
83,836 KB |
testcase_16 | WA | - |
testcase_17 | AC | 123 ms
83,840 KB |
testcase_18 | AC | 121 ms
84,168 KB |
testcase_19 | AC | 123 ms
83,920 KB |
testcase_20 | WA | - |
testcase_21 | AC | 229 ms
91,676 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
ソースコード
import sys, re from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d sys.setrecursionlimit(10 ** 6) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): x1, y1, x2, y2, x3, y3 = i_map() nums = [] nums.append(get_distance(x1, y1, x2, y2)) nums.append(get_distance(x2, y2, x3, y3)) nums.append(get_distance(x1, y1, x3, y3)) nums.sort() if nums[0] != nums[1] or nums[0] * (2**0.5) != nums[2]: print(-1) exit() for i in range(-100, 101): for j in range(-100, 101): lines = deepcopy(nums) lines.append(get_distance(x1, y1, i, j)) lines.append(get_distance(x2, y2, i, j)) lines.append(get_distance(x3, y3, i, j)) count = Counter(lines) if len(count) == 2: #if i == 1 and j == 1: # print(len(count)) ans1 = 0 ans2 = 0 for key, value in count.items(): if value == 4: ans1 = key else: ans2 = key #if i == 1 and j == 1: # print(ans1, ans2) if ans1 != 0 and ans2 != 0: if ans1*(2**0.5) == ans2: print(i, j) exit() print(-1) if __name__ == '__main__': main()