p_id
stringlengths 6
6
| language
stringclasses 10
values | code
stringlengths 11
983k
|
|---|---|---|
p03158 | Python | from itertools import accumulate,zip_longest
from functools import reduce
import bisect
import sys
input = sys.stdin.readline
N,Q = map(int,input().split())
A = list(map(int,input().split()))
X = [int(input()) for i in range(Q)]
B = [2*a+1 for a in A] # right
A = [2*a for a in A] # left
X = [2*x for x in X]
S = list(accumulate(A))
T0 = accumulate(A[::2])
T1 = accumulate(A[1::2])
T = []
for s,t in zip_longest(T0,T1):
T.append(s)
T.append(t)
if T[-1] is None:
T.pop()
maxhigh = 10**16
for x in X:
if x > (A[-1]+A[-2])//2:
print(T[-1]//2)
continue
NG = maxhigh
OK = 0
R = OK
ans = 0
while True:
l = x - R
r = x + R
li = bisect.bisect_left(A,l)
ri = bisect.bisect_right(B,r)
M = ri-li
if ri == N-M:
if li > 0:
ans += T[li-1]
break
if ri == N-M-1:
li -= 1
if li > 0:
ans += T[li-1]
break
if ri < N-M:
OK = R
R = (R + NG)//2
if N-M < ri:
NG = R
R = (R + OK)//2
if ri > 0:
ans += S[N-1] - S[ri-1]
else:
ans += S[N-1]
print(ans//2)
|
p03158 | Python | import sys
input = sys.stdin.readline
from collections import *
from bisect import *
def judge(x):
aoki = N-x-bisect_left(A, 2*X-A[N-x])+1
return x<=aoki
def binary_search():
l, r = 1, N-bisect_left(A, X)
while l<=r:
m = (l+r)//2
if judge(m):
l = m+1
else:
r = m-1
return r
N, Q = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
acc = [0]
acco = [0]
for i in range(N):
acc.append(acc[-1]+A[i])
if i%2==1:
acco.append(acco[-1]+A[i])
else:
acco.append(acco[-1])
for _ in range(Q):
X = int(input())
x = binary_search()
ans = acc[N]-acc[N-x]
if N-2*x>0:
if (N-2*x)%2==0:
ans += acco[N-2*x]
else:
ans += acc[N-2*x]-acco[N-2*x]
print(ans) |
p03158 | Python | from itertools import accumulate
from bisect import bisect_left
N, Q = map(int, input().split())
As = list(map(int, input().split()))
csum = list(accumulate(As, initial = 0))
csum_even = list(accumulate(As[::2], initial = 0))
csum_odd = list(accumulate(As[1::2], initial = 0))
#t回でX以下のAsのみとなってしまうような最小のtを求める。
def calc_t(X):
ok = -1
ng = N+1
while ng - ok > 1:
mid = (ok + ng) // 2
aoki = mid // 2
taka = mid - aoki
aoki_max = As[-taka]
aoki_min_index = bisect_left(As, 2*X - aoki_max)
if N - taka - aoki_min_index < aoki:
ng = mid
else:
ok = mid
return ok
for _ in range(Q):
X = int(input())
t = calc_t(X)
s = csum[N] - csum[N - (t+1)//2]
if N % 2 == 0:
s += csum_odd[(N-t)//2]
else:
s += csum_even[(N-t+1)//2]
print(s)
|
p03158 | Python | import sys
from bisect import *
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]
def solve(x):
l=bisect_left(aa,x)
r=n+1
while l+1<r:
j=(l+r)//2
s=x*2-aa[j-1]
i=bisect_left(aa,s)
if j-i>n-j:r=j
else:l=j
ans=cs[n]-cs[l]
if n-(n-l)*2>0:ans+=+cs2[n-(n-l)*2]
print(ans)
n,q=MI()
aa=LI()
cs=[0]
cs2=[0]*(n+1)
for i,a in enumerate(aa):
cs.append(cs[-1]+a)
if i<2:cs2[i+1]=a
else:cs2[i+1]=cs2[i-1]+a
for _ in range(q):
x=II()
solve(x) |
p03158 | Python | # -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
def read_float():
return float(buff_readline())
def read_float_n():
return list(map(float, buff_readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Bisect:
def __init__(self, func):
self.__func = func
def bisect_left(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if self.__func(mid) < x:
lo = mid+1
else:
hi = mid
return lo
def bisect_right(self, x, lo, hi):
while lo < hi:
mid = (lo+hi)//2
if x < self.__func(mid):
hi = mid
else:
lo = mid+1
return lo
# @mt
def slv(N, Q, A, X):
from itertools import accumulate
sa = [0] + list(accumulate(A))
sea = [0] + list(accumulate(a if i % 2 == 0 else 0 for i, a in enumerate(A)))
soa = [0] + list(accumulate(a if i % 2 == 1 else 0 for i, a in enumerate(A)))
for x in X:
def f(n):
if 2*n-1 > N:
return 1
t = abs(x-A[-n])
a = max(abs(x-A[-n-1]), abs(x-A[-2*n+1]))
if a <= t:
return 0
return 1
n = Bisect(f).bisect_left(1, 1, N) - 1
ans = sa[N] - sa[N-n]
r = max(0, N - 2*n)
if r % 2 == 0:
ans += soa[r] - soa[0]
else:
ans += sea[r] - sea[0]
print(ans)
def main():
N, Q = read_int_n()
A = read_int_n()
X = [read_int() for _ in range(Q)]
slv(N, Q, A, X)
if __name__ == '__main__':
main()
|
p03158 | Python | n,q = map(int,input().split())
A = list(map(int,input().split()))
w = [A[0]]
for i in range(1,n):
w.append(w[-1]+A[i])
w1 = [0]*n
for i in range(n):
if (n-1-i)%2 == 0:
w1[i] = A[i]
if i > 0:
w1[i] += w1[i-1]
def solve(x):
l = 0
r = n+1
while r-l > 1:
m = (r+l)//2
if A[n-m] <= x:
r = m
else:
if 2*m-1 > n:
r = m
else:
if A[n-m]-x >= x-A[n-2*m+1]:
l = m
else:
r = m
ans = w[-1]-w[n-l-1]
if n-2*l-1 >= 0:
ans += w1[n-2*l-1]
print(ans)
for _ in range(q):
solve(int(input())) |
p03158 | Python | n,q = map(int,input().split())
A = list(map(int,input().split()))
w = [A[0]]
for i in range(1,n):
w.append(w[-1]+A[i])
w1 = [0]*n
for i in range(n):
if (n-1-i)%2 == 0:
w1[i] = A[i]
if i > 0:
w1[i] += w1[i-1]
def solve(x):
l = 0
r = n+1
while r-l > 1:
m = (r+l)//2
if A[n-m] <= x:
r = m
else:
if 2*m-1 > n:
r = m
else:
if A[n-m]-x >= x-A[n-2*m+1]:
l = m
else:
r = m
ans = w[-1]-w[n-l-1]
if n-2*l-1 >= 0:
ans += w1[n-2*l-1]
print(ans)
for _ in range(q):
solve(int(input())) |
p03158 | Python | import bisect
n,q = map(int,input().split())
A = list(map(int,input().split()))
dic = {}
w = [A[0]]
for i in range(1,n):
w.append(w[-1]+A[i])
w1 = [A[0],0]
w2 = [0,A[1]]
for i in range(2,n):
if i%2 == 0:
w1.append(w1[-2]+A[i])
w2.append(0)
else:
w2.append(w2[-2]+A[i])
w1.append(0)
def solve(x):
if x in dic:
print(dic[x])
return
if x >= A[-1]:
count = max(w1[-1],w2[-1])
dic[x] = count
print(count)
return
l = 0
r = 10**10
while r > l+1:
m = (r+l)//2
li = bisect.bisect_left(A,x-m)
ri = bisect.bisect_right(A,x+m)
if n-ri == ri-li:
count = w[-1]-w[ri-1]
li -= 1
if li>= 0:
if li%2 == 0:
count += w1[li]
else:
count += w2[li]
dic[x] = count
print(count)
return 0
if n-ri == ri-li+1:
count = w[-1]-w[ri-1]
li -= 2
if li>= 0:
if li%2 == 0:
count += w1[li]
else:
count += w2[li]
dic[x] = count
print(count)
return 0
if A[ri-1] == x+m:
ri2 = ri-1
if n-ri2 == ri2-li:
count = w[-1]-w[ri2-1]
li -= 1
if li>= 0:
if li%2 == 0:
count += w1[li]
else:
count += w2[li]
dic[x] = count
print(count)
return 0
elif n-ri2 == ri2-li+1:
count = w[-1]-w[ri2-1]
li -= 2
if li>= 0:
if li%2 == 0:
count += w1[li]
else:
count += w2[li]
dic[x] = count
print(count)
return 0
if 2*ri > n+li:
r = m
else:
l = m
count = max(w1[-1],w2[-1])
dic[x] = count
print(count)
return
for _ in range(q):
x = int(input())
solve(x)
|
p03158 | Python | import sys
input = sys.stdin.readline
n, q = map(int,input().split())
A = list(map(int,input().split()))[::-1]
X = [int(input()) for i in range(q)]
S = [A[0]]
for i in range(1, n):
S.append(S[-1] + A[i])
AA = A[::-1]
T = [AA[0], AA[1]]
for i in range(2, n):
T.append(T[-2] + AA[i])
su = sum(A)
# print(S,T)
for i in range(q):
l = 0
r = (n+1)//2-1 + 1
m = (l+r)//2
x = X[i]
while r-l > 1:
# print(m,l,r,abs(x-A[m+1]) ,abs(x-A[m*2+1]))
if m == 0 or abs(x-A[m]) >= abs(x-A[m*2]):
l = m
else:
r = m
m = (l+r)//2
ans = S[l]
# print("l", l)
if n - 2*(l+1) > 0:
ans += T[n-2*(l+1)-1]
print(ans)
|
p03158 | Python | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
from bisect import bisect_left as bl, bisect_right as br
n,q = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
def sub(x, i):
# i番目を取れるかどうか
v = a[i]
target = x - (v-x)
num = i - bl(a, target)
return num+1 >= n - i
anss = [None] * q
cumsum1 = [0] * n
cumsum0 = [0] * n
cumsum = [0] * n
for i in range(n):
if i%2:
cumsum1[i] = cumsum1[i-1] + a[i]
cumsum0[i] = cumsum0[i-1]
else:
cumsum0[i] = cumsum0[i-1] + a[i]
cumsum1[i] = cumsum1[i-1]
cumsum[i] = cumsum[i-1] + a[i]
for j in range(q):
x = int(input())
l = 0
r = n-1
while l<r-1:
m = (r+l)//2
if sub(x, m):
r = m
else:
l = m
# rまではxより大きくて取れる
# ans = sum(a[r:])
ans = cumsum[-1] - cumsum[r-1]
ii = r-2 - (n-r-1)
if ii>=0:
if ii%2:
ans += cumsum1[ii]
else:
ans += cumsum0[ii]
anss[j] = ans
write("\n".join(map(str, anss))) |
p03158 | Python | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
from bisect import bisect_left as bl, bisect_right as br
n,q = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
def sub(x, i):
# i番目を取れるかどうか
v = a[i]
target = x - (v-x)
num = i - bl(a, target-0.1)
return num+1 >= n - i
anss = [None] * q
cumsum1 = [0] * n
cumsum0 = [0] * n
cumsum = [0] * n
for i in range(n):
if i%2:
cumsum1[i] = cumsum1[i-1] + a[i]
cumsum0[i] = cumsum0[i-1]
else:
cumsum0[i] = cumsum0[i-1] + a[i]
cumsum1[i] = cumsum1[i-1]
cumsum[i] = cumsum[i-1] + a[i]
for j in range(q):
x = int(input())
l = 0
r = n-1
while l<r-1:
m = (r+l)//2
if sub(x, m):
r = m
else:
l = m
# rまではxより大きくて取れる
# ans = sum(a[r:])
ans = cumsum[-1] - cumsum[r-1]
ii = r-2 - (n-r-1)
if ii>=0:
if ii%2:
ans += cumsum1[ii]
else:
ans += cumsum0[ii]
anss[j] = ans
write("\n".join(map(str, anss))) |
p03158 | Python | import sys
input = sys.stdin.readline
from collections import *
from bisect import *
def judge(x):
tak = N-x
aoki = x-bisect_left(A, 2*X-A[x])+1
return tak<=aoki
def binary_search():
l, r = mark, N-1
while l<=r:
m = (l+r)//2
if judge(m):
r = m-1
else:
l = m+1
return l
N, Q = map(int, input().split())
A = list(map(int, input().split()))
acc = [0]
acc_e = [0]
for i in range(N):
acc.append(acc[-1]+A[i])
acc_e.append(acc_e[-1]+(A[i] if i%2==0 else 0))
for _ in range(Q):
X = int(input())
mark = bisect_left(A, X)
border = binary_search()
ans = acc[-1]-acc[border]
c = N-border
if 2*c>=N:
print(ans)
continue
if (N-2*c-1)%2==0:
ans += acc_e[N-2*c]
else:
ans += acc[N-2*c]-acc_e[N-2*c]
print(ans) |
p03158 | Python | import sys
from bisect import bisect_left
def solve():
input = sys.stdin.readline
N, Q = map(int, input().split())
A = [int(a) for a in input().split()]
X = [int(input()) for _ in range(Q)]
cont = [0] * N
cont[N-1] = A[N-1]
for i in reversed(range(N-1)): cont[i] = cont[i+1] + A[i]
change = [0] * N
change[0] = A[0]
change[1] = A[1]
for i in range(2, N): change[i] = change[i-2] + A[i]
upperBound = [-1] * N
for i in range((N + 1)// 2): #上からi+1個連続でとれるxの最大値
target = A[N-i-1]
lower = A[(N-i-1) - i]
upperBound[N-i-1] = (target + lower) // 2
upperBound[N-1] = 10 ** 10
Ans = [0] * Q
for i, x in enumerate(X):
pos = bisect_left(upperBound, x)
Ans[i] += cont[pos] #連続で取れる数
if N - (N - pos) * 2 - 1 >= 0: Ans[i] += change[N - (N - pos) * 2 - 1]
print(*Ans, sep="\n")
return 0
if __name__ == "__main__":
solve() |
p03158 | Python | import bisect
import sys
input=sys.stdin.readline
N,Q=map(int,input().split())
A=list(map(int,input().split()))
if N%2==1:
data1=[A[i] for i in range(0,N)]
for i in range(1,N):
data1[-i-1]+=data1[-i]
data2=[A[2*i] for i in range(0,N//2+1)]
for i in range(1,len(data2)):
data2[i]+=data2[i-1]
else:
data1=[A[i] for i in range(0,N)]
for i in range(1,N):
data1[-i-1]+=data1[-i]
data2=[A[2*i+1] for i in range(0,N//2)]
for i in range(1,len(data2)):
data2[i]+=data2[i-1]
for _ in range(Q):
x=int(input())
index=bisect.bisect_right(A,x)
start=1
end=N-index
while end-start>1:
test=(end+start)//2
r=N-test-1
l=bisect.bisect_left(A,2*x-A[-test])
if r-l+1>=test-1:
start=test
else:
end=test
r=N-end-1
l=bisect.bisect_left(A,2*x-A[-end])
if r-l+1>=end-1:
m=end
else:
m=start
if m==0:
m=1
ans=data1[-m]
num=(N-2*m+1)//2
if num>0:
ans+=data2[num-1]
print(ans)
|
p03158 | Python | from bisect import *
import sys
input = sys.stdin.readline
n,q = map(int,input().split())
A = list(map(int,input().split()))
every2 = [[0]*(n//2 + 2) for _ in range(2)]
right = [0]*(n+1)
for i in range(n):
odd = i&1
every2[odd][i//2 + 1] = every2[odd][i//2] + A[i]
right[i+1] = right[i] + A[-i-1]
# ans = [0]*q
def ok(y,x):
M = A[-y]
if M <= x:return False
d = M - x
m = x - d
return bisect_left(A,m)+2*y-1 <= n
for i in range(q):
X = int(input())
W = bisect_right(A,X)
top = n - W + 1
bottom = 1
while top - bottom > 1:
mid = (top + bottom)//2
if ok(mid,X):
bottom = mid
else:
top = mid
ans = right[bottom] + every2[1 - (n&1)][(n-1)//2 + 1 - bottom]
print(ans)
# print('\n'.join(ans))
|
p03158 | Python | import sys
input = sys.stdin.readline
from bisect import *
def judge(x):
a = N-x
b = x-bisect_left(A, X-(A[x]-X))+1
return a<=b
def binary_search():
l, r = bisect_left(A, X), N-1
while l<=r:
m = (l+r)//2
if judge(m):
r = m-1
else:
l = m+1
return l
N, Q = map(int, input().split())
A = list(map(int, input().split()))
acc = [0]*(N+1)
eacc = [0]*(N+1)
for i in range(N):
acc[i+1] = acc[i]+A[i]
eacc[i+1] = eacc[i]+(A[i] if i%2==0 else 0)
for _ in range(Q):
X = int(input())
border = binary_search()
ans = acc[N]-acc[border]
if N-2*(N-border)>=0:
if (N-2*(N-border))%2==0:
ans += acc[N-2*(N-border)]-eacc[N-2*(N-border)]
else:
ans += eacc[N-2*(N-border)]
print(ans)
|
p03158 | Python | import sys
input = sys.stdin.readline
from bisect import *
def judge(x):
a = N-x
b = x-bisect_left(A, X-(A[x]-X))+1
return a<=b
def binary_search():
l, r = bisect_left(A, X), N-1
while l<=r:
m = (l+r)//2
if judge(m):
r = m-1
else:
l = m+1
return l
N, Q = map(int, input().split())
A = list(map(int, input().split()))
acc = [0]*(N+1)
eacc = [0]*(N+1)
oacc = [0]*(N+1)
for i in range(N):
acc[i+1] = acc[i]+A[i]
if i%2==0:
eacc[i+1] = eacc[i]+A[i]
oacc[i+1] = oacc[i]
else:
eacc[i+1] = eacc[i]
oacc[i+1] = oacc[i]+A[i]
for _ in range(Q):
X = int(input())
border = binary_search()
ans = acc[N]-acc[border]
if N-2*(N-border)>=0:
if (N-2*(N-border))%2==0:
ans += oacc[N-2*(N-border)]
else:
ans += eacc[N-2*(N-border)]
print(ans) |
p03158 | Python | import bisect
n, q = map(int,input().split())
a = list(map(int,input().split()))
a.reverse()
cums = [0]*(n+1)
cume = [0]*(n+1)
for i in range(n):
cums[i+1] = cums[i] + a[i]
cume[i+1] = cume[i] + a[i]*(1 - i%2)
bo = list()
sc = list()
for i in range(1,(n+1)//2):
b = (a[i] + a[2*i])//2 + 1
bo.append(b)
s = cums[i] + cume[-1] - cume[2*i]
sc.append(s)
sc.append(cums[(n+1)//2])
bo.reverse()
sc.reverse()
for _ in range(q):
i = bisect.bisect(bo, int(input()))
print(sc[i]) |
p03158 | Python | from bisect import bisect_left
N,Q,*L = map(int, open(0).read().split())
A = L[:N]
S = []
M = []
x = 0
y = 0
m = sum(A)
for i in range(N):
if i%2==0:
x += A[i]
S.append(x)
else:
y += A[i]
S.append(y)
for i in range(N):
M.append(m)
m -= A[i]
for q in L[N:]:
i = bisect_left(A,q)
if 0<i<N and q-A[i-1]<=A[i]-q:
i = i-1
if i>=N-1:
print(S[N-1])
continue
l = -1
r = N
while l+1<r:
s = (l+r)//2
k = N-1-s
if s<=i:
l = s
continue
x = s-i+1
if x>k:
r = s
continue
y = k-x
m = i-y-1
if m<0:
l = s
continue
if q-A[m]<=A[s]-q:
r = s
else:
l = s
a = M[r]
cnt = N-r
cnt -= r-i-1
b = i-cnt
if b>=0:
a += S[b]
print(a) |
p03158 | Python | import sys
input = sys.stdin.readline
from itertools import accumulate
import bisect
n,q = map(int,input().split())
if n%2:
a = [0]+list(map(int,input().split()))
n += 1
else:
a = list(map(int,input().split()))
fs = [a[i] if i%2 else 0 for i in range(n)]
accss = [0]*n
accff = list(accumulate(a))
accfs = list(accumulate(fs))
xls = []
xpt = []
for i in range(n//2):
xls.append((a[2*i+1]+a[i+n//2])/2)
if i == 0:
xpt.append(accff[n-1]-accff[n//2-1])
else:
xpt.append(accff[n-1]-accff[i+n//2-1]+accfs[2*i-1])
for _ in range(q):
x = bisect.bisect_left(xls,int(input()))
if x >= n//2:
print(xpt[-1])
else:
print(xpt[x]) |
p03158 | Python | import sys
input = sys.stdin.readline
N, Q = map(int, input().split())
a = list(map(int, input().split()))
a.reverse()
cs = [0] * (N + 1)
cs2 = [0] * (N + 1)
for i in range(N): cs[i + 1] = cs[i] + a[i]
for i in range(0, N, 2): cs2[i + 1] = a[i]
for i in range(N): cs2[i + 1] += cs2[i]
#print(cs, cs2)
for _ in range(Q):
x = int(input())
ok = 0
ng = -(-N // 2)
while ng - ok > 1:
m = (ok + ng) // 2
if a[m] + a[m * 2] >= 2 * x: ok = m
else: ng = m
res = cs[ok + 1]
#print(x)
if (ok + 1) * 2 <= N: res += cs2[-1] - cs2[(ok + 1) * 2]
print(res) |
p03158 | Python | def main():
# アルメリアさんを参考にした いや全然わからん
from itertools import accumulate
from bisect import bisect_left
import sys
input = sys.stdin.buffer.readline
N, Q = (int(i) for i in input().split())
A = [0] + [int(i) for i in input().split()]
cum = [0] + [a for a in accumulate(A[1:])]
cum_e = [e for e in accumulate(A[(1 if N & 1 else 0)::2])]
def binary_search(x):
ng = 0
ok = N
while ok - ng > 1:
mid = ng + (ok - ng) // 2
if A[mid] < x:
ng = mid
else:
upper = N - mid + 1
lower = mid - bisect_left(A, max(1, 2*x-A[mid])) + 1
if upper > lower:
ng = mid
else:
ok = mid
return ok
# print(cum, cum_e)
for query in range(Q):
x = int(input())
ok = binary_search(x)
ans = cum[N] - cum[ok-1]
t = N - (N-ok+1)*2
# print(ok, t)
if t > 0:
ans += cum_e[t//2]
print(ans)
if __name__ == '__main__':
main()
|
p03158 | Python | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10
#solve
def solve():
n, q = LI()
a = LI()
odd = [0] * n
even = [0] * n
def f(mid):
return abs(a[mid] - x) < abs(a[mid - (n - mid - 1)] - x)
for i in range(n):
if i & 1:
odd[i] += odd[i - 1] + a[i]
else:
odd[i] += odd[i - 1]
acc = list(itertools.accumulate(a))
for _ in range(q):
x = II()
ok = 0
ng = n
while abs(ng - ok) > 1:
mid = (ok + ng) // 2
if f(mid):
ok = mid
else:
ng = mid
ok = ng - (n - ng)
ng -= 1
ans = acc[-1] - acc[ng]
if ok < 0:
pass
elif n & 1:
ans += acc[ok]-odd[ok]
else:
ans += odd[ok]
print(ans)
return
#main
if __name__ == '__main__':
solve()
|
p03158 | Python | import sys
input = sys.stdin.readline
def calc(x):
l, r = 0, (N+1)//2
while r - l > 1:
m = (l+r) // 2
if A[m] + A[2*m] >= 2 * x:
l = m
else:
r = m
return l
N, Q = map(int, input().split())
A = [int(a) for a in input().split()][::-1]
B = [A[0]] + [0] * (N-1)
for i in range(1, N):
B[i] = B[i-1] + A[i]
C = [A[0]] + [0] * (N-1)
for i in range(2, N, 2):
C[i] = C[i-2] + A[i]
C[-1] += C[-2]
for _ in range(Q):
x = int(input())
c = calc(x)
print(B[c] + (C[-1] - C[2*c] if c*2<=N else 0))
|
p03158 | Python | from bisect import bisect_left, bisect_right
N, Q = map(int, input().split())
A = list(map(int, input().split()))
X = [int(input()) for _ in range(Q)]
A.reverse()
evenA = [0] * (N + 1)
accA = [0] * (N + 1)
for i in range(1, N + 1):
evenA[i] = evenA[i - 1] + (A[i - 1] if i % 2 == 1 else 0)
accA[i] = accA[i - 1] + A[i - 1]
borders = []
scores = []
for i in range(1, N // 2 + N % 2):
border = (A[i] + A[i * 2]) // 2 + 1
borders.append(border)
score = accA[i] + (evenA[N] - evenA[i * 2])
scores.append(score)
scores.append(accA[N // 2 + N % 2])
borders.reverse()
scores.reverse()
for x in X:
i = bisect_right(borders, x)
print(scores[i])
|
p03158 | Python | def main():
from itertools import accumulate as ac
from bisect import bisect_left as bl
from bisect import bisect_right as br
from sys import stdin
input=stdin.readline
def check(k):
dist=a[-k-1]-ini
if dist<0:
dist=abs(dist)
return k>=br(a,ini+dist)-bl(a,ini-dist)-1
else:
return k>=br(a,ini+dist)-bl(a,ini-dist)
n,q=map(int,input().split())
nn=n//2+1
a=list(map(int,input().split()))
x=[int(input()) for _ in [0]*q]
ix=sorted([[i,j] for i,j in enumerate(x)],key=lambda x:x[1])
ans=[0]*q
aac=[0]+list(ac(a))
aac2=[0]+list(ac(a[(n+1)%2::2]))
k=min(nn,n-1)
for i,ini in ix:
while check(k)==True:k-=1
k+=1
ans[i]=aac[-1]-aac[-k-1]+aac2[-k-1]
for i in ans:
print(i)
main() |
p03158 | Python | def main():
from itertools import accumulate as ac
from bisect import bisect_left as bl
from bisect import bisect_right as br
from sys import stdin
input=stdin.readline
def check(k):
dist=a[-k-1]-ini
if dist<0:
dist=abs(dist)
return k>=br(a,ini+dist)-bl(a,ini-dist)-1
else:
return k>=br(a,ini+dist)-bl(a,ini-dist)
n,q=map(int,input().split())
nn=n//2+1
a=list(map(int,input().split()))
x=[int(input()) for _ in [0]*q]
ix=sorted([[i,j] for i,j in enumerate(x)],key=lambda x:x[1])
ans=[0]*q
aac=[0]+list(ac(a))
aac2=[0]+list(ac(a[(n+1)%2::2]))
k=nn
for i,ini in ix:
l=1
u=k
while l+1<u:
med=(l+u)//2
if check(med):u=med
else:l=med+1
if check(l):k=l
else:k=u
ans[i]=aac[-1]-aac[-k-1]+aac2[-k-1]
for i in ans:
print(i)
main() |
p03158 | Python | from itertools import accumulate,chain
def bisect(ng, ok, judge):
while abs(ng-ok) > 1:
m = (ng+ok)//2
if judge(m):
ok = m
else:
ng = m
return ok
N,Q = map(int,input().split())
if N % 2 == 1:
A = list(chain((0,),map(int,input().split())))
N += 1
else:
A = list(map(int,input().split()))
X = [int(input()) for _ in range(Q)]
oacc = list(chain((0,),accumulate(A[1::2])))
acc = list(chain((0,),accumulate(A)))
check = lambda x: lambda i: x*2 < A[-i]+A[-2*i]
M = N//2
for x in X:
c = check(x)
if c(M):
print(acc[-1]-acc[M])
elif not c(1):
print(oacc[-1])
else:
i = bisect(M, 1, c)
if x*2 <= A[-i-1] + A[-2*i-1]:
i += 1
s = acc[N]-acc[-i-1]
if 2*i < N:
s += oacc[(N-2*i)//2]
print(s)
|
p03158 | Python | n,q = map(int,input().split())
a = list(map(int,input().split()))
query = [int(input()) for i in range(q)]
a = sorted(a)
ruiseki = [0]*(n+1)
for i in range(n):
ruiseki[i+1] = ruiseki[i] + a[i]
ruiseki2 = [0]*(n+1)
if n % 2 == 1:
for i in range(n):
if i % 2 == 0:
ruiseki2[i+1] = ruiseki2[i] + a[i]
else:
ruiseki2[i+1] = ruiseki2[i]
if n % 2 == 0:
for i in range(n):
if i % 2 == 1:
ruiseki2[i+1] = ruiseki2[i] + a[i]
else:
ruiseki2[i+1] = ruiseki2[i]
def solve(mid, num):
r = -((-mid) // 2)
l = mid
r_pos = n - r
l_pos = n - l
if abs(a[l_pos] - num) <= abs(a[r_pos] - num):
return True
else:
return False
for i in range(q):
num = query[i]
ok = 1
ng = n + 1
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if solve(mid, num):
ok = mid
else:
ng = mid
ans = 0
ans += ruiseki[n] - ruiseki[n-(ok+1)//2]
nokori = n - ok
ans += ruiseki2[nokori]
print(ans) |
p03158 | Python | import sys
input = sys.stdin.readline
N, Q = map(int, input().split())
A = list(map(int, input().split()))
Query = [int(input()) for _ in range(Q)]
INF = 10**14
E = [0]
O = [0]
e = 0
o = 0
for i, a in enumerate(A):
if i % 2 == 0:
e += a
else:
o += a
E.append(e)
O.append(o)
S = [0]
s = 0
for a in reversed(A):
s += a
S.append(s)
for X in Query:
ind = N
if X > A[-1]:
l = 0
else:
l = 0
r = N+1
while r-l > 1:
m = (r+l)//2
in_left = A[-m]
in_right = A[-m+m//2-1]
out_left = A[-m-1] if m < N else -INF
out_right = A[-m+m//2] if m > 0 else INF
if X <= out_left:
l = m
elif out_right <= X:
r = m
else:
if abs(X-out_left) <= abs(in_right-X):
l = m
elif abs(X-in_left) > abs(out_right - X):
r = m
else:
l = m
break
ans = S[l-l//2]
if l%2 != (N-l)%2:
ans += E[N-l]
else:
ans += O[N-l]
print(ans)
|
p03158 | Python | from bisect import bisect_left
N, Q = map(int, input().split())
A = [int(i) for i in input().split()]
X = [int(input()) for _ in range(Q)]
i = (N & 1) ^ 1
j = N // 2
st = sum(A[j:])
ret_k = []
ret_v = []
while i < j :
ret_k.append((A[i] + A[j]) // 2)
ret_v.append(st)
st = st - A[j] + A[i]
i += 2
j += 1
ret_k.append(1e+12)
ret_v.append(st)
for x in X :
print(ret_v[bisect_left(ret_k, x)]) |
p03158 | Python | import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
if N<=0:
return [[]]*num
elif num==1:
return [I() for _ in range(N)]
else:
read_all = [tuple(II()) for _ in range(N)]
return map(list, zip(*read_all))
#################
N,Q = II()
A = III()
X = Line(Q,1)
if N==2:
for _ in range(Q):
print(A[-1])
exit()
sum_list = [0]*N
now_odd = 0
now_even = 0
for i in range(N):
if i%2==0:
now_even += A[i]
sum_list[i] = now_even
else:
now_odd += A[i]
sum_list[i] = now_odd
left_sum = [0]*N
now = 0
for i in range(N)[::-1]:
now += A[i]
left_sum[i] = now
for x in X:
left = 0
right = N//2
while (right-left>1):
mid = left + (right-left)//2
if abs(A[N-mid-2]-x)<abs(A[N-2*mid-2]-x):
right = mid
else:
left = mid
right1 = right
left = 0
right = N//2 + 1
while (right-left>1):
mid = left + (right-left)//2
if abs(A[N-mid-1]-x)<abs(A[N-2*mid-1]-x):
right = mid
else:
left = mid
right2 = right
flag = False
if right1 != right2:
flag = True
ans = left_sum[N-right2]
if flag:
if N-right1-right2-2>=0:
ans += sum_list[N-right1-right2-2]
else:
if N-right1-right2-1>=0:
ans += sum_list[N-right1-right2-1]
print(ans) |
p03158 | Python | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
N,Q = map(int,readline().split())
A = np.array(readline().split(),np.int64)
X = np.array(read().split(),np.int64)
INF=10**15
A = np.concatenate([[-INF,-INF,-INF,-INF],A])
"""
・ある数が後手の右端となるのはどのような場合か
・n番目の右側にr>=1個あるとする
・【長さが奇数のときは、先頭に0を追加しておく】
→ 後手は、[n-r+1,n]をとって、先手は[n+1:]およびn-rを回収する。
・n+1番目をとらない iff r-1個自由にとると n+1番目を含まない iff |A_{n+1}-x| >= |A_{n-r+2}-x|
iff r = 1 or x <= (A_{n+1}+A_{n-r+2})/2 iff r = 1 or x <= (A_{n+1}+A_{n-r+2})//2
・n-r番目をとらない iff r個自由にとると、n-r番目を含まない iff |A_n-x| < |A_{n-r}-x|
iff x > (A_n+A_{n-r})/2 iff x > (A_n+A_{n-r})//2
"""
n = np.arange(N+4)
r = N-n+3
ind = (n-r>=0)&(r>=1); n = n[ind]; r = r[ind]
lower = (A[n] + A[n-r])//2 + 1
# upper = (A[n+1] + A[n-r+2])//2 不要
#得点の計算：n+1～の和 + n-rから2つずつ下へ
Acum = np.cumsum(A)
Acum_ev = np.zeros_like(A)
Acum_ev[::2] = A[::2].cumsum()
Acum_ev[1::2] = A[1::2].cumsum()
score = Acum[-1] - Acum[n] + Acum_ev[n-r] + INF + INF
I = np.searchsorted(lower,X,side='right') - 1
answer = score[I]
print('\n'.join(answer.astype(str))) |
p03158 | Python |
import sys
from collections import deque, defaultdict
import copy
import bisect
sys.setrecursionlimit(10 ** 9)
import math
import heapq
from itertools import product, permutations,combinations
import fractions
import sys
def input():
return sys.stdin.readline().strip()
N, Q = list(map(int, input().split()))
A = list(map(int, input().split()))
sum_list = [0]
even_odd_sum = [0, 0]
for i in range(N):
sum_list.append(sum_list[-1] + A[i])
even_odd_sum.append(even_odd_sum[-2] + A[i])
for q in range(Q):
x = int(input())
if x >= A[-1]:
print(even_odd_sum[-1])
else:
loc_min = bisect.bisect_left(A, x)
loc_min = max(loc_min, N // 2)
loc_max = (loc_min + N) // 2
t = (loc_min + loc_max) // 2
#print(x, loc_min, loc_max, t, 2*t - N - 1)
while (loc_min <= loc_max):
if 2*t - N - 1 >= 0 and A[t - 1] - x >= x - A[2*t - N - 1]:
loc_max = t - 1
elif 2*t - N >= 0 and A[t] - x < x - A[2*t - N]:
loc_min = t + 1
elif 2*t - N < 0 and A[t] - x < x - A[0]:
loc_min = t + 1
else:
break
t = (loc_min + loc_max) // 2
ans = sum_list[-1] - sum_list[t] + even_odd_sum[2*t - N - 1 + 2]
print(ans) |
p03158 | Python | # http://kmjp.hatenablog.jp/entry/2019/01/13/0930
import sys
input = sys.stdin.readline
from bisect import bisect_left
n, q = map(int, input().split())
a = list(map(int, input().split()))
xs = [int(input()) for i in range(q)]
s = [0]*(n+1)
se = [0]*(n+1)
for i in range(n):
s[i+1] = s[i] + a[i]
if i :
se[i+1] = se[i-1]
se[i+1] += a[i]
def check(x, k):
if k > n:
return False
Tk = (k+1)//2
i = bisect_left(a, x- (a[n-Tk]-x))
return i+k <= n
for x in xs:
left = 0
right = n+1
while right-left > 1:
mid = (left+right)//2
if check(x, mid):
left = mid
else:
right = mid
top = (left+1)//2
ans = 0
ans += s[n] - s[n-top]
if left%2:
left += 1
ans += se[n-left] if n-left>=0 else 0
print(ans) |
p03158 | Python | import bisect
import sys
input = sys.stdin.readline
INF = 10**12
n, q = [int(item) for item in input().split()]
a = [int(item) for item in input().split()]
# Calc cumrative sum
sum_even = [0] * (n + 1)
sum_odd = [0] * (n + 1)
sum_all = [0] * (n + 1)
for i, item in enumerate(a):
if i % 2 == 0:
sum_odd[i+1] = sum_odd[i] + a[i]
sum_even[i+1] = sum_even[i]
else:
sum_even[i+1] = sum_even[i] + a[i]
sum_odd[i+1] = sum_odd[i]
sum_all[i+1] = sum_all[i] + a[i]
# Iterate in query
a.append(INF)
ans = []
for i in range(q):
x = int(input())
# Get div of aoki - takahashi
# l: aoki takes, r: takahashi takes
l = 0; r = n - 1
while r - l > 1:
m = (r + l) // 2
rng = abs(x - a[m])
t_num = n - m
a_num = n - t_num - (bisect.bisect_left(a, x - rng))
if t_num <= a_num + 1:
r = m
else:
l = m
rng = abs(x - a[r])
t_num = n - r
rest = n - 2 * t_num
t_sum = sum_all[n] - sum_all[n - t_num]
a_sum = sum_all[r] - sum_all[r - t_num]
# Add stripe area
if n - t_num * 2 > 0:
if rest % 2 == 0:
t_sum += sum_even[rest]
a_sum += sum_odd[rest]
else:
t_sum += sum_odd[rest]
a_sum += sum_even[rest]
ans.append(t_sum)
print("\n".join([str(item) for item in ans])) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.