結果
問題 | No.594 壊れた宝物発見機 |
ユーザー | McGregorsh |
提出日時 | 2023-07-04 22:49:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 375 ms / 2,000 ms |
コード長 | 2,132 bytes |
コンパイル時間 | 276 ms |
コンパイル使用メモリ | 86,836 KB |
実行使用メモリ | 105,908 KB |
平均クエリ数 | 94.00 |
最終ジャッジ日時 | 2023-09-25 22:11:35 |
合計ジャッジ時間 | 9,371 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 368 ms
105,580 KB |
testcase_01 | AC | 365 ms
105,436 KB |
testcase_02 | AC | 370 ms
105,552 KB |
testcase_03 | AC | 357 ms
105,388 KB |
testcase_04 | AC | 364 ms
105,668 KB |
testcase_05 | AC | 359 ms
105,856 KB |
testcase_06 | AC | 352 ms
105,604 KB |
testcase_07 | AC | 355 ms
105,732 KB |
testcase_08 | AC | 361 ms
105,768 KB |
testcase_09 | AC | 372 ms
105,428 KB |
testcase_10 | AC | 357 ms
105,528 KB |
testcase_11 | AC | 369 ms
105,848 KB |
testcase_12 | AC | 358 ms
105,700 KB |
testcase_13 | AC | 360 ms
105,736 KB |
testcase_14 | AC | 371 ms
105,728 KB |
testcase_15 | AC | 359 ms
105,840 KB |
testcase_16 | AC | 367 ms
105,796 KB |
testcase_17 | AC | 366 ms
105,564 KB |
testcase_18 | AC | 357 ms
105,380 KB |
testcase_19 | AC | 375 ms
105,908 KB |
ソースコード
import sys from sys import stdin from fractions import Fraction import math 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, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) 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 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' def main(): def solve(num, i): if i == 0: print('?', num, 0, 0) elif i == 1: print('?', 0, num, 0) else: print('?', 0, 0, num) D = int(input()) return D while True: ans = [] for i in range(3): logs = [] l = -200 r = 200 while l + 2 < r: c1 = l + (r - l) // 3 c2 = r - (r - l) // 3 if solve(c1, i) < solve(c2, i): r = c2 else: l = c1 for num in range(l, r+1): if i == 0: print('?', num, 0, 0) elif i == 1: print('?', 0, num, 0) else: print('?', 0, 0, num) D = int(input()) logs.append([D, num]) logs.sort() ans.append(logs[0][1]) print('!', *ans) exit() if __name__ == '__main__': main()