結果
問題 | No.1429 Simple Dowsing |
ユーザー | McGregorsh |
提出日時 | 2023-05-09 23:00:34 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,807 bytes |
コンパイル時間 | 288 ms |
コンパイル使用メモリ | 87,192 KB |
実行使用メモリ | 109,704 KB |
平均クエリ数 | 2.87 |
最終ジャッジ日時 | 2023-08-17 11:29:49 |
合計ジャッジ時間 | 6,731 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 278 ms
109,400 KB |
testcase_01 | AC | 277 ms
109,456 KB |
testcase_02 | AC | 281 ms
109,000 KB |
testcase_03 | WA | - |
testcase_04 | AC | 279 ms
109,424 KB |
testcase_05 | AC | 277 ms
108,900 KB |
testcase_06 | AC | 280 ms
109,132 KB |
testcase_07 | WA | - |
testcase_08 | AC | 285 ms
109,356 KB |
testcase_09 | AC | 280 ms
109,352 KB |
testcase_10 | AC | 283 ms
109,448 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 276 ms
108,908 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 main(): juge = defaultdict(list) for i in range(101): for j in range(101): p = i ** 2 + j ** 2 juge[p].append([i, j]) #print(juge) print('?', 0, 0) N = int(input()) if len(juge[N]) == 1: a, b = juge[N][0] print('!', a, b) else: a, b = juge[N][0] c, d = juge[N][1] print('?', a, b) N = int(input()) if N == 0: print('!', a, b) else: print('!', c, d) if __name__ == '__main__': main()