結果

問題 No.1097 Remainder Operation
ユーザー MasKoaTS
提出日時 2022-03-12 15:54:16
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 517 ms / 2,000 ms
コード長 1,077 bytes
コンパイル時間 231 ms
コンパイル使用メモリ 82,228 KB
実行使用メモリ 189,112 KB
最終ジャッジ日時 2024-09-16 23:11:16
合計ジャッジ時間 9,253 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

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

import itertools as iter
import collections as coll
import heapq as hq
import bisect as bis
from decimal import Decimal as dec
from functools import cmp_to_key
import math
import sys
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10 ** 6)
inp = sys.stdin.readline
input = lambda : inp().rstrip()
getN = lambda : int(inp())
getNs = lambda : map(int, inp().split())
getList = lambda :list(map(int, inp().split()))
getStrs = lambda n : [input() for _ in [0] * n]
def yexit(): print("Yes"); exit(0)
def nexit(): print("No"); exit(0)
pi = 3.141592653589793
mod = 10 ** 9 + 7
MOD = 998244353
INF = 10 ** 18
dx = [1, 0, -1, 0]; dy = [0, 1, 0, -1]
"""
Main Code
"""
n = getN()
a = getList()
q = getN()
query = [getN() for _ in [0] * q]
def calc(db, now):
next = [0] * n
for i in range(n):
next[i] = now[i] + db[(i + now[i]) % n]
return next
m = 50
db = [a[:] for _ in [0] * m]
for i in range(m - 1):
db[i + 1] = calc(db[i], db[i])
for t in query:
ans = 0
for i in range(m):
if(t & 1):
ans += db[i][ans % n]
t >>= 1
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0