結果
問題 | No.306 さいたま2008 |
ユーザー | McGregorsh |
提出日時 | 2023-05-15 22:19:23 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,816 bytes |
コンパイル時間 | 284 ms |
コンパイル使用メモリ | 82,180 KB |
実行使用メモリ | 90,104 KB |
最終ジャッジ日時 | 2024-05-08 03:40:58 |
合計ジャッジ時間 | 4,193 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 131 ms
89,800 KB |
testcase_01 | AC | 129 ms
89,680 KB |
testcase_02 | AC | 124 ms
89,984 KB |
testcase_03 | AC | 128 ms
89,808 KB |
testcase_04 | AC | 130 ms
89,860 KB |
testcase_05 | AC | 126 ms
89,924 KB |
testcase_06 | AC | 134 ms
89,784 KB |
testcase_07 | AC | 125 ms
89,884 KB |
testcase_08 | AC | 127 ms
89,916 KB |
testcase_09 | AC | 125 ms
89,980 KB |
testcase_10 | AC | 127 ms
89,888 KB |
testcase_11 | AC | 132 ms
89,916 KB |
testcase_12 | AC | 129 ms
89,536 KB |
testcase_13 | AC | 130 ms
89,564 KB |
testcase_14 | AC | 127 ms
89,840 KB |
testcase_15 | AC | 128 ms
89,896 KB |
testcase_16 | AC | 123 ms
89,792 KB |
testcase_17 | AC | 128 ms
89,836 KB |
testcase_18 | AC | 127 ms
89,604 KB |
testcase_19 | AC | 128 ms
89,564 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 129 ms
89,544 KB |
ソースコード
import sys, re from fractions import Fraction 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, ROUND_HALF_UP 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 def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def threeserch(ax, ay, bx, by): # 関数 def solve(x, y): a = get_distance(x, y, ax, ay) b = get_distance(x, y, bx, by) return a + b l = -1 r = 1100 while l + pow(10, -10) < r: c1 = l + (r - l) / 3 c2 = r - (r - l) / 3 if solve(0, c1) < solve(0, c2): r = c2 else: l = c1 return l, r def main(): ax, ay = i_map() bx, by = i_map() a, b = threeserch(ax, ay, bx, by) print(a) if __name__ == '__main__': main()