Submission #190

2021-02-04 12:24:45

nim

Accepted 50/50

111ms

51800 KiB

import strscans, strutils, sequtils, sugar, algorithm

var n,k:int
discard scanf(stdin.readLine(),"$i$s$i",n,k)
var T = stdin.readLine().split().map(x=>parseInt(x))
var P = stdin.readLine().split().map(x=>parseInt(x))

var s=0
for i in 0 ..< n:
  s += T[i]
  T[i] = s

for i in 0 ..< k:
  let p = P[i]
  if 0 == p:
    P[i]=1
    continue
  let r = p mod s
  if 0 == r:
    P[i]=n
    continue
  P[i]=lowerBound(T,r)+1 

P.join(" ").echo

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	2ms	1960 KiB
		2	Accepted	0/0	89ms	36040 KiB
		3	Accepted	2/2	3ms	4112 KiB
		4	Accepted	2/2	2ms	4036 KiB
		5	Accepted	2/2	2ms	4088 KiB
		6	Accepted	3/3	3ms	4180 KiB
		7	Accepted	3/3	2ms	4120 KiB
		8	Accepted	3/3	2ms	4104 KiB
		9	Accepted	2/2	111ms	40052 KiB
		10	Accepted	2/2	92ms	41500 KiB
		11	Accepted	2/2	86ms	42964 KiB
		12	Accepted	2/2	92ms	41876 KiB
		13	Accepted	2/2	79ms	45616 KiB
		14	Accepted	2/2	86ms	47020 KiB
		15	Accepted	2/2	90ms	48204 KiB
		16	Accepted	2/2	82ms	49680 KiB
		17	Accepted	2/2	89ms	51800 KiB
		18	Accepted	2/2	82ms	50940 KiB
		19	Accepted	2/2	104ms	51632 KiB
		20	Accepted	2/2	82ms	49580 KiB
		21	Accepted	2/2	82ms	51584 KiB
		22	Accepted	3/3	93ms	51520 KiB
		23	Accepted	3/3	86ms	51628 KiB
		24	Accepted	3/3	85ms	51672 KiB