結果
問題 | No.1869 Doubling? |
ユーザー | McGregorsh |
提出日時 | 2022-07-27 19:15:56 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 240 ms / 2,000 ms |
コード長 | 1,806 bytes |
コンパイル時間 | 419 ms |
コンパイル使用メモリ | 87,260 KB |
実行使用メモリ | 92,532 KB |
最終ジャッジ日時 | 2023-09-24 08:01:50 |
合計ジャッジ時間 | 13,584 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 234 ms
92,220 KB |
testcase_01 | AC | 231 ms
92,248 KB |
testcase_02 | AC | 235 ms
92,360 KB |
testcase_03 | AC | 233 ms
92,384 KB |
testcase_04 | AC | 240 ms
92,200 KB |
testcase_05 | AC | 239 ms
92,372 KB |
testcase_06 | AC | 237 ms
92,416 KB |
testcase_07 | AC | 235 ms
92,412 KB |
testcase_08 | AC | 232 ms
92,116 KB |
testcase_09 | AC | 236 ms
92,516 KB |
testcase_10 | AC | 235 ms
92,128 KB |
testcase_11 | AC | 234 ms
92,404 KB |
testcase_12 | AC | 234 ms
92,336 KB |
testcase_13 | AC | 234 ms
92,124 KB |
testcase_14 | AC | 233 ms
92,468 KB |
testcase_15 | AC | 229 ms
92,504 KB |
testcase_16 | AC | 230 ms
92,244 KB |
testcase_17 | AC | 229 ms
92,504 KB |
testcase_18 | AC | 240 ms
92,436 KB |
testcase_19 | AC | 236 ms
92,128 KB |
testcase_20 | AC | 231 ms
92,396 KB |
testcase_21 | AC | 231 ms
92,176 KB |
testcase_22 | AC | 233 ms
92,240 KB |
testcase_23 | AC | 232 ms
92,500 KB |
testcase_24 | AC | 234 ms
92,332 KB |
testcase_25 | AC | 231 ms
92,456 KB |
testcase_26 | AC | 236 ms
92,228 KB |
testcase_27 | AC | 230 ms
92,532 KB |
testcase_28 | AC | 234 ms
92,400 KB |
testcase_29 | AC | 235 ms
92,308 KB |
testcase_30 | AC | 237 ms
92,392 KB |
testcase_31 | AC | 237 ms
92,240 KB |
testcase_32 | AC | 237 ms
92,280 KB |
testcase_33 | AC | 236 ms
92,152 KB |
testcase_34 | AC | 236 ms
92,248 KB |
testcase_35 | AC | 234 ms
92,324 KB |
testcase_36 | AC | 234 ms
92,416 KB |
testcase_37 | AC | 237 ms
92,424 KB |
testcase_38 | AC | 239 ms
92,348 KB |
testcase_39 | AC | 235 ms
92,324 KB |
testcase_40 | AC | 234 ms
92,500 KB |
testcase_41 | AC | 235 ms
92,324 KB |
testcase_42 | AC | 237 ms
92,532 KB |
testcase_43 | AC | 231 ms
92,268 KB |
testcase_44 | AC | 235 ms
92,228 KB |
testcase_45 | AC | 231 ms
92,288 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 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, m = i_map() if n <= 60 and 2 ** (n-1) < m: num = 1 score = 1 for i in range(n-1): num *= 2 score += num print(score) exit() ans = m cou = 1 now = m while now > 1 and cou < n: if now % 2 == 0: now //= 2 else: now //= 2 now += 1 cou += 1 ans += now #print(now) nokori = n - cou print(ans + nokori) if __name__ == '__main__': main()