結果

問題 No.1097 Remainder Operation
ユーザー McGregorshMcGregorsh
提出日時 2023-07-13 13:20:39
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 474 ms / 2,000 ms
コード長 2,331 bytes
コンパイル時間 305 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 135,040 KB
最終ジャッジ日時 2024-09-15 00:07:05
合計ジャッジ時間 10,569 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 158 ms
88,448 KB
testcase_01 AC 155 ms
88,192 KB
testcase_02 AC 158 ms
88,064 KB
testcase_03 AC 157 ms
88,448 KB
testcase_04 AC 159 ms
88,320 KB
testcase_05 AC 158 ms
88,576 KB
testcase_06 AC 157 ms
88,320 KB
testcase_07 AC 261 ms
89,856 KB
testcase_08 AC 213 ms
89,856 KB
testcase_09 AC 215 ms
89,728 KB
testcase_10 AC 215 ms
89,984 KB
testcase_11 AC 216 ms
89,728 KB
testcase_12 AC 425 ms
103,552 KB
testcase_13 AC 436 ms
103,168 KB
testcase_14 AC 430 ms
103,168 KB
testcase_15 AC 433 ms
103,424 KB
testcase_16 AC 430 ms
103,296 KB
testcase_17 AC 430 ms
103,552 KB
testcase_18 AC 450 ms
134,528 KB
testcase_19 AC 461 ms
134,912 KB
testcase_20 AC 463 ms
135,040 KB
testcase_21 AC 461 ms
132,224 KB
testcase_22 AC 474 ms
132,224 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
from sys import stdin
from fractions import Fraction
import math
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, lru_cache
from decimal import Decimal, getcontext, ROUND_HALF_UP
def i_input(): return int(stdin.readline())
def i_map(): return map(int, stdin.readline().split())
def i_list(): return list(i_map())
def s_input(): return stdin.readline()[:-1]
def s_map(): return s_input().split()
def s_list(): return list(s_map())
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
alpa = 'abcdefghijklmnopqrstuvwxyz'
ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'


def main():
   
   N = int(input())
   A = i_list()
   
   logs = []
   nums = set()
   
   now = 0
   point = INF
   while True:
   	  p = now % N
   	  now += A[p]
   	  if p in nums:
   	  	  point = p
   	  	  break
   	  else:
   	  	  logs.append(p)
   	  	  nums.add(p)
   
   s = 0
   for i in range(len(logs)):
   	  if logs[i] == point:
   	  	  s = i
   	  	  break
   
   dist = logs[:s]
   cycle = logs[s:]
   lendist = len(dist)
   lencycle = len(cycle)
   distcost = []
   for i in range(lendist):
   	  distcost.append(A[dist[i]])
   AD = list(accumulate(distcost))
   
   cyclecost = []
   for i in range(lencycle):
   	  cyclecost.append(A[cycle[i]])
   CD = list(accumulate(cyclecost))
   
   Q = int(input())
   for i in range(Q):
   	  K = int(input())
   	  K -= 1
   	  if K < lendist:
   	  	  print(AD[K])
   	  else:
   	  	  if lendist > 0:
   	  	  	  a = AD[-1]
   	  	  else:
   	  	  	  a = 0
   	  	  amari = K - lendist
   	  	  aamari = amari % lencycle
   	  	  camari = amari // lencycle
   	  	  B = camari * CD[-1]
   	  	  C = CD[aamari]
   	  	  print(a + B + C)
   	  
   	  
   	  
   
if __name__ == '__main__':
    main()
0