結果
問題 | No.306 さいたま2008 |
ユーザー | McGregorsh |
提出日時 | 2023-05-15 22:14:23 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,814 bytes |
コンパイル時間 | 243 ms |
コンパイル使用メモリ | 81,944 KB |
実行使用メモリ | 90,088 KB |
最終ジャッジ日時 | 2024-05-08 03:38:05 |
合計ジャッジ時間 | 4,645 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 138 ms
89,696 KB |
testcase_01 | AC | 155 ms
89,720 KB |
testcase_02 | AC | 135 ms
89,828 KB |
testcase_03 | AC | 137 ms
89,448 KB |
testcase_04 | AC | 136 ms
89,900 KB |
testcase_05 | AC | 135 ms
89,696 KB |
testcase_06 | AC | 138 ms
89,500 KB |
testcase_07 | AC | 137 ms
89,780 KB |
testcase_08 | AC | 140 ms
89,608 KB |
testcase_09 | AC | 137 ms
89,820 KB |
testcase_10 | AC | 137 ms
89,768 KB |
testcase_11 | AC | 136 ms
89,584 KB |
testcase_12 | AC | 136 ms
89,736 KB |
testcase_13 | AC | 138 ms
89,780 KB |
testcase_14 | AC | 136 ms
89,688 KB |
testcase_15 | AC | 134 ms
89,760 KB |
testcase_16 | AC | 141 ms
89,724 KB |
testcase_17 | AC | 138 ms
89,760 KB |
testcase_18 | AC | 137 ms
89,844 KB |
testcase_19 | AC | 138 ms
89,744 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 136 ms
89,628 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()