結果
問題 | No.934 Explosive energy drink |
ユーザー | McGregorsh |
提出日時 | 2022-07-06 13:06:57 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 646 ms / 2,000 ms |
コード長 | 1,786 bytes |
コンパイル時間 | 284 ms |
コンパイル使用メモリ | 87,164 KB |
実行使用メモリ | 112,796 KB |
平均クエリ数 | 709.58 |
最終ジャッジ日時 | 2023-08-23 10:45:47 |
合計ジャッジ時間 | 12,313 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 266 ms
108,396 KB |
testcase_01 | AC | 633 ms
112,372 KB |
testcase_02 | AC | 254 ms
108,840 KB |
testcase_03 | AC | 451 ms
112,300 KB |
testcase_04 | AC | 635 ms
112,316 KB |
testcase_05 | AC | 259 ms
108,292 KB |
testcase_06 | AC | 259 ms
108,612 KB |
testcase_07 | AC | 256 ms
108,756 KB |
testcase_08 | AC | 255 ms
108,036 KB |
testcase_09 | AC | 255 ms
108,512 KB |
testcase_10 | AC | 256 ms
108,496 KB |
testcase_11 | AC | 257 ms
108,460 KB |
testcase_12 | AC | 268 ms
109,544 KB |
testcase_13 | AC | 278 ms
109,664 KB |
testcase_14 | AC | 286 ms
109,492 KB |
testcase_15 | AC | 405 ms
111,768 KB |
testcase_16 | AC | 301 ms
109,728 KB |
testcase_17 | AC | 348 ms
111,760 KB |
testcase_18 | AC | 361 ms
111,812 KB |
testcase_19 | AC | 427 ms
112,684 KB |
testcase_20 | AC | 522 ms
112,480 KB |
testcase_21 | AC | 530 ms
112,032 KB |
testcase_22 | AC | 633 ms
112,796 KB |
testcase_23 | AC | 646 ms
112,192 KB |
ソースコード
import sys, re 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 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(): n = int(input()) ans = [] now = 0 while now < n: print('?', n-1, flush=True) kotae = [] for i in range(1, n+1): if i-1 == now: continue kotae.append(i) print(*kotae, flush=True) num = int(input()) if num == 0: ans.append(now+1) if now == n-1: print('!', len(ans), flush=True) print(*ans) exit() now += 1 if __name__ == '__main__': main()