結果
問題 | No.306 さいたま2008 |
ユーザー | McGregorsh |
提出日時 | 2023-05-15 22:14:23 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,814 bytes |
コンパイル時間 | 367 ms |
コンパイル使用メモリ | 86,844 KB |
実行使用メモリ | 92,864 KB |
最終ジャッジ日時 | 2023-08-20 21:18:21 |
合計ジャッジ時間 | 8,323 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 247 ms
92,676 KB |
testcase_01 | AC | 250 ms
92,584 KB |
testcase_02 | AC | 254 ms
92,572 KB |
testcase_03 | AC | 251 ms
92,864 KB |
testcase_04 | AC | 251 ms
92,524 KB |
testcase_05 | AC | 251 ms
92,516 KB |
testcase_06 | AC | 251 ms
92,584 KB |
testcase_07 | AC | 254 ms
92,560 KB |
testcase_08 | AC | 254 ms
92,532 KB |
testcase_09 | AC | 249 ms
92,744 KB |
testcase_10 | AC | 249 ms
92,572 KB |
testcase_11 | AC | 248 ms
92,524 KB |
testcase_12 | AC | 254 ms
92,592 KB |
testcase_13 | AC | 253 ms
92,596 KB |
testcase_14 | AC | 249 ms
92,516 KB |
testcase_15 | AC | 253 ms
92,656 KB |
testcase_16 | AC | 255 ms
92,540 KB |
testcase_17 | AC | 255 ms
92,604 KB |
testcase_18 | AC | 248 ms
92,580 KB |
testcase_19 | AC | 251 ms
92,636 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 250 ms
92,520 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 = 0 r = 1100 while l + pow(10, -8) < 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()