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... |
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
... |
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 cal... |
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 [L... |
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 re... |
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
... |
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
... |
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.a... |
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)
f... |
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... |
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... |
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
... |
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]
chang... |
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... |
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... |
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:
... |
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:
... |
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)
... |
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 ... |
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(accu... |
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):
... |
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 = [... |
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... |
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-... |
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 -... |
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... |
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... |
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:
... |
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] = ruiseki... |
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 =... |
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
... |
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:
ret... |
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])
"""
・ある数が後... |
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 = lis... |
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 :
... |
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]... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.