結果

問題 No.1097 Remainder Operation
ユーザー 已经死了
提出日時 2024-09-06 13:51:20
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 993 ms / 2,000 ms
コード長 2,369 bytes
コンパイル時間 427 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 174,836 KB
最終ジャッジ日時 2024-12-27 06:24:30
合計ジャッジ時間 14,827 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

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

import os,sys,random,threading
#sys.exit() 退
#sys.setrecursionlimit(10**6) #
from random import randint,choice,shuffle
#randint(a,b)[a,b]
#choice(seq)seq,,seq
#shuffle(x)x
from copy import deepcopy
from io import BytesIO,IOBase
from types import GeneratorType
from functools import lru_cache,reduce
#reduce(op,)
from bisect import bisect_left,bisect_right
#bisect_left(x) x
#bisect_right(x) x
from collections import Counter,defaultdict,deque
from itertools import accumulate,combinations,permutations
#accumulate(a)alist[0]
#combinations(a,k)ak
#permutations(a,k)ak
from heapq import heapify,heappop,heappush
#heapify
from typing import Generic,Iterable,Iterator,TypeVar,Union,List
from string import ascii_lowercase,ascii_uppercase,digits
#
from math import ceil,floor,sqrt,pi,factorial,gcd,log,log10,log2,inf
#ceilfloor sqrt factorial
from decimal import Decimal,getcontext
#Decimal(s) Decimal,使
#getcontext().prec=100
from sys import stdin, stdout, setrecursionlimit
input = lambda: sys.stdin.readline().rstrip("\r\n")
MI = lambda :map(int,input().split())
li = lambda :list(MI())
ii = lambda :int(input())
mod = int(1e9 + 7) #998244353
inf = 1<<60
py = lambda :print("YES")
pn = lambda :print("NO")
DIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] #
DIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),(-1, 1)] # →↘↓↙←↖↑↗
n=ii()
a=li()
dp=[[0]*40 for _ in range(n)]
fa=[[0]*40 for _ in range(n)]
for i in range(n):
fa[i][0]=(i+a[i])%n
dp[i][0]=a[i]
for i in range(1,40):
for j in range(n):
fa[j][i] = fa[ fa[j][i-1] ][i-1]
dp[j][i] = dp[j][i-1] + dp[ fa[j][i-1] ][i-1]
q=ii()
for _ in range(q):
k=ii()
res=0
node=0
for i in range(39,-1,-1):
if k>>i&1:
res+=dp[node][i]
node=fa[node][i]
print(res)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0