結果
問題 | No.1890 Many Sequences Sum Queries |
ユーザー | McGregorsh |
提出日時 | 2022-07-27 21:14:36 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 534 ms / 2,000 ms |
コード長 | 1,722 bytes |
コンパイル時間 | 290 ms |
コンパイル使用メモリ | 87,260 KB |
実行使用メモリ | 106,684 KB |
最終ジャッジ日時 | 2023-09-24 09:38:37 |
合計ジャッジ時間 | 11,580 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 505 ms
106,684 KB |
testcase_01 | AC | 534 ms
106,472 KB |
testcase_02 | AC | 246 ms
92,420 KB |
testcase_03 | AC | 240 ms
92,516 KB |
testcase_04 | AC | 243 ms
92,964 KB |
testcase_05 | AC | 249 ms
92,652 KB |
testcase_06 | AC | 251 ms
97,416 KB |
testcase_07 | AC | 370 ms
106,080 KB |
testcase_08 | AC | 313 ms
106,288 KB |
testcase_09 | AC | 314 ms
106,300 KB |
testcase_10 | AC | 509 ms
106,276 KB |
testcase_11 | AC | 402 ms
106,564 KB |
testcase_12 | AC | 446 ms
106,112 KB |
testcase_13 | AC | 450 ms
106,404 KB |
testcase_14 | AC | 368 ms
106,472 KB |
testcase_15 | AC | 242 ms
92,556 KB |
testcase_16 | AC | 242 ms
92,280 KB |
testcase_17 | AC | 243 ms
92,404 KB |
testcase_18 | AC | 245 ms
92,648 KB |
testcase_19 | AC | 240 ms
92,540 KB |
testcase_20 | AC | 242 ms
92,644 KB |
testcase_21 | AC | 240 ms
92,560 KB |
testcase_22 | AC | 246 ms
92,584 KB |
testcase_23 | AC | 241 ms
92,448 KB |
testcase_24 | AC | 240 ms
92,620 KB |
testcase_25 | AC | 242 ms
92,396 KB |
ソースコード
import sys, re from fractions import Fraction 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 from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] 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 ###関数コピーしたか?### def main(): n, q = i_map() A = i_list() nums = [] for i in range(n): for j in range(A[i]): nums.append(j+1) accumu_nums = list(accumulate(nums)) for i in range(q): point = int(input()) score = bisect_left(accumu_nums, point) if score == len(accumu_nums): print(-1) else: print(score+1) if __name__ == '__main__': main()