結果

問題 No.2067 ±2^k operations
ユーザー chineristAC
提出日時 2022-09-02 23:17:37
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,847 ms / 2,000 ms
コード長 2,116 bytes
コンパイル時間 557 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 275,368 KB
最終ジャッジ日時 2024-11-16 06:11:31
合計ジャッジ時間 21,803 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys,random,bisect
from collections import deque,defaultdict,Counter
from heapq import heapify,heappop,heappush
from itertools import cycle, permutations
from math import log,gcd
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
memo = {}
def calc(n):
if n <= 1:
return n
if n in memo:
return memo[n]
if n&1 == 1:
memo[n] = 1 + min(calc(n//2),calc((n+1)//2))
else:
memo[n] = calc(n//2)
return memo[n]
A = [calc(i) for i in range(101)]
def calc2(n):
if n <= 1:
return n
if n&1:
if (n//2) & 1:
return 1 + calc2((n+1)//2)
else:
return 1 + calc2((n)//2)
else:
return calc2(n//2)
memo3 = {}
def calc3(n):
if n in memo3:
return memo3[n]
if n <= 1:
return n
if n&1:
if n%4 == 3:
memo3[n] = 1 + calc3((n+1)//2)
return 1 + calc3((n+1)//2)
else:
memo3[n] = 1 + calc3((n)//2)
return 1 + calc3((n)//2)
else:
memo3[n] = calc3((n)//2)
return calc3(n//2)
memo = {}
def f(n):
if n in memo:
return memo[n]
"""
sum calc(i) for i in 0...n
"""
q,r = (n+1)//4,(n+1)%4
res = 0
for i in range(r):
res += calc3(4*q+i)
"""
sum calc(i) for i in 0123,4567,...,(4*q-4),(4*q-3),(4*q-2),(4*q-1)
r
0: calc(0) + calc(4//2) + calc(8//2) + ... calc((4*q-4)//2) = calc(0) + calc(1) + calc(2) + ... calc(q-1)
1: calc(0) + calc(4//2) + calc(8//2) + ... calc((4*q-4)//2) = calc(0) + calc(1) + calc(2) + ... calc(q-1) + q
2: calc(2//2) + calc(6//2) + calc(10//2) + ... calc((4*q-2)//2) = calc(1) + calc(3) + calc(5) + ... calc(2*q-1)
3: calc(4//2) + calc(8//2) + ... calc((4*q)//2) = calc(1) + calc(2) + ... + calc(q) + q
sum = f(q-1) + f(2*q-1) + f(q)
"""
if q!=0:
res += 2 * f(q-1) + f(2*q-1) + calc3(q) + 2*q
memo[n] = res
return res
for _ in range(int(input())):
print(f(int(input())))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0