1872021-02-04 00:09:36mraronZenehallgatáspython3Runtime error 15/50141ms52028 KiB
import itertools, sys
import bisect
def main():
	tokens = sys.stdin.read().split()
	n = int(tokens[0])
	t = [int(i) for i in tokens[2:2+n]]
	pre = list(itertools.accumulate(t))
	mod=pre[-1]
	p = [int(i) for i in tokens[2+n:]]
	print(*[bisect.bisect(pre, (i-1)%mod)+1 for i in p])

main()
SubtaskSumTestVerdictTimeMemory
base15/50
1Accepted0/019ms11456 KiB
2Runtime error0/068ms48484 KiB
3Accepted2/218ms12964 KiB
4Accepted2/219ms13076 KiB
5Accepted2/218ms13184 KiB
6Accepted3/318ms13204 KiB
7Accepted3/318ms13240 KiB
8Accepted3/318ms13408 KiB
9Runtime error0/275ms49952 KiB
10Runtime error0/268ms49940 KiB
11Runtime error0/278ms50288 KiB
12Runtime error0/274ms50424 KiB
13Runtime error0/281ms50812 KiB
14Runtime error0/275ms50808 KiB
15Runtime error0/275ms51136 KiB
16Runtime error0/275ms50252 KiB
17Runtime error0/274ms51572 KiB
18Runtime error0/264ms50296 KiB
19Runtime error0/264ms50156 KiB
20Runtime error0/2119ms51528 KiB
21Runtime error0/2120ms51568 KiB
22Runtime error0/3122ms51516 KiB
23Runtime error0/3133ms51848 KiB
24Runtime error0/3141ms52028 KiB