結果
問題 | No.1187 皇帝ペンギン |
ユーザー | McGregorsh |
提出日時 | 2023-05-18 22:36:52 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 264 ms / 1,000 ms |
コード長 | 1,757 bytes |
コンパイル時間 | 513 ms |
コンパイル使用メモリ | 87,140 KB |
実行使用メモリ | 108,712 KB |
平均クエリ数 | 21.94 |
最終ジャッジ日時 | 2023-08-22 13:31:03 |
合計ジャッジ時間 | 19,344 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 260 ms
108,312 KB |
testcase_01 | AC | 263 ms
107,684 KB |
testcase_02 | AC | 259 ms
108,320 KB |
testcase_03 | AC | 259 ms
107,948 KB |
testcase_04 | AC | 260 ms
108,360 KB |
testcase_05 | AC | 263 ms
108,444 KB |
testcase_06 | AC | 259 ms
108,396 KB |
testcase_07 | AC | 262 ms
108,084 KB |
testcase_08 | AC | 258 ms
108,116 KB |
testcase_09 | AC | 258 ms
108,036 KB |
testcase_10 | AC | 255 ms
108,156 KB |
testcase_11 | AC | 254 ms
108,584 KB |
testcase_12 | AC | 257 ms
108,056 KB |
testcase_13 | AC | 257 ms
108,436 KB |
testcase_14 | AC | 261 ms
108,488 KB |
testcase_15 | AC | 264 ms
107,988 KB |
testcase_16 | AC | 261 ms
108,560 KB |
testcase_17 | AC | 255 ms
108,564 KB |
testcase_18 | AC | 257 ms
107,624 KB |
testcase_19 | AC | 257 ms
107,764 KB |
testcase_20 | AC | 253 ms
108,212 KB |
testcase_21 | AC | 259 ms
108,284 KB |
testcase_22 | AC | 255 ms
108,188 KB |
testcase_23 | AC | 256 ms
108,608 KB |
testcase_24 | AC | 254 ms
108,500 KB |
testcase_25 | AC | 261 ms
108,332 KB |
testcase_26 | AC | 257 ms
108,012 KB |
testcase_27 | AC | 253 ms
108,320 KB |
testcase_28 | AC | 255 ms
108,196 KB |
testcase_29 | AC | 259 ms
107,768 KB |
testcase_30 | AC | 253 ms
108,104 KB |
testcase_31 | AC | 256 ms
108,712 KB |
testcase_32 | AC | 261 ms
107,948 KB |
testcase_33 | AC | 254 ms
108,012 KB |
testcase_34 | AC | 257 ms
107,928 KB |
testcase_35 | AC | 260 ms
107,860 KB |
testcase_36 | AC | 260 ms
108,288 KB |
testcase_37 | AC | 258 ms
108,548 KB |
testcase_38 | AC | 260 ms
108,068 KB |
testcase_39 | AC | 258 ms
108,156 KB |
testcase_40 | AC | 258 ms
108,572 KB |
testcase_41 | AC | 264 ms
107,944 KB |
testcase_42 | AC | 259 ms
108,652 KB |
testcase_43 | AC | 256 ms
108,356 KB |
testcase_44 | AC | 259 ms
108,580 KB |
testcase_45 | AC | 256 ms
107,968 KB |
testcase_46 | AC | 256 ms
107,836 KB |
testcase_47 | AC | 258 ms
108,560 KB |
testcase_48 | AC | 263 ms
108,524 KB |
testcase_49 | AC | 258 ms
108,604 KB |
testcase_50 | AC | 256 ms
108,664 KB |
testcase_51 | AC | 257 ms
107,696 KB |
testcase_52 | AC | 263 ms
108,176 KB |
testcase_53 | AC | 257 ms
108,028 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(): top = 1000 under = 1 while top - under > 1: mid = (top + under) // 2 print('?', mid) S = input() print('?', mid+1) D = input() if not (S == 'out' and D == 'out'): under = mid else: top = mid for i in range(under, -1, -1): print('?', i) S = input() if S == 'safe': print('!', i) exit() if __name__ == '__main__': main()