結果
問題 | No.1097 Remainder Operation |
ユーザー | MasKoaTS |
提出日時 | 2022-03-12 15:54:16 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 514 ms / 2,000 ms |
コード長 | 1,077 bytes |
コンパイル時間 | 388 ms |
コンパイル使用メモリ | 81,836 KB |
実行使用メモリ | 188,520 KB |
最終ジャッジ日時 | 2023-10-16 23:28:12 |
合計ジャッジ時間 | 10,054 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 126 ms
85,772 KB |
testcase_01 | AC | 125 ms
85,772 KB |
testcase_02 | AC | 138 ms
88,416 KB |
testcase_03 | AC | 138 ms
88,424 KB |
testcase_04 | AC | 145 ms
88,416 KB |
testcase_05 | AC | 142 ms
88,424 KB |
testcase_06 | AC | 140 ms
88,424 KB |
testcase_07 | AC | 182 ms
95,596 KB |
testcase_08 | AC | 178 ms
95,708 KB |
testcase_09 | AC | 177 ms
95,576 KB |
testcase_10 | AC | 176 ms
95,868 KB |
testcase_11 | AC | 178 ms
95,508 KB |
testcase_12 | AC | 473 ms
178,752 KB |
testcase_13 | AC | 482 ms
179,960 KB |
testcase_14 | AC | 486 ms
180,384 KB |
testcase_15 | AC | 514 ms
179,084 KB |
testcase_16 | AC | 492 ms
180,864 KB |
testcase_17 | AC | 449 ms
183,748 KB |
testcase_18 | AC | 295 ms
174,336 KB |
testcase_19 | AC | 400 ms
188,520 KB |
testcase_20 | AC | 397 ms
188,512 KB |
testcase_21 | AC | 446 ms
174,404 KB |
testcase_22 | AC | 445 ms
174,400 KB |
ソースコード
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)