結果
問題 | No.566 だいたい完全二分木 |
ユーザー | McGregorsh |
提出日時 | 2022-06-29 14:45:04 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 255 ms / 2,000 ms |
コード長 | 1,588 bytes |
コンパイル時間 | 388 ms |
コンパイル使用メモリ | 87,048 KB |
実行使用メモリ | 93,904 KB |
最終ジャッジ日時 | 2023-08-14 17:55:19 |
合計ジャッジ時間 | 4,255 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 237 ms
92,388 KB |
testcase_01 | AC | 235 ms
92,752 KB |
testcase_02 | AC | 236 ms
92,720 KB |
testcase_03 | AC | 238 ms
92,476 KB |
testcase_04 | AC | 240 ms
92,696 KB |
testcase_05 | AC | 237 ms
92,540 KB |
testcase_06 | AC | 236 ms
92,756 KB |
testcase_07 | AC | 238 ms
92,672 KB |
testcase_08 | AC | 240 ms
93,272 KB |
testcase_09 | AC | 247 ms
93,904 KB |
testcase_10 | AC | 255 ms
93,672 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(): k = int(input()) def dfs(num, base): ans.append(num) if num % 2 == 1: return dfs(num-base, base//2) dfs(num+base, base//2) ans = [] dfs((2**k-1)//2+1, ((2**k-1)//2+1)//2) ans.remove((2**k-1)//2) print(*[(2**k-1)//2] + ans) if __name__ == '__main__': main()