input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n,q,*t=list(map(int,open(0).read().split()))
for v,w in zip(t[::2],t[1::2]):
if~-n:
while v!=w:
if v>w:v,w=w,v
w=(w+n-2)//n
print(v) | n,q,*t=list(map(int,open(0).read().split()))
for v,w in zip(t[::2],t[1::2]):
while n>1and v!=w:
if v>w:v,w=w,v
w=(w+n-2)//n
print(v) | p03506 |
n, a, b = list(map(int, input().split()))
pre_h = [int(eval(input())) for _ in range(n)]
minimum = (min(pre_h) - 1) // a + 1
h = [0] * n
while True:
for i in range(n):
if pre_h[i] - b * minimum > 0:
h[i] = pre_h[i] - b * minimum
else:
h[i] = 0
if sum([(i - 1) // (a - b) + 1 for i in h]) <= m... | n, a, b = list(map(int, input().split()))
pre_h = [int(eval(input())) for _ in range(n)]
def check(cnt):
h = [0] * n
for i in range(n):
if pre_h[i] - b * cnt > 0:
h[i] = pre_h[i] - b * cnt
else:
h[i] = 0
if sum([(i - 1) // (a - b) + 1 for i in h]) <= cnt:
return True
else:
return False... | p03702 |
def inpl(): return [int(i) for i in input().split()]
N,A,B = inpl()
C = A-B
h = [int(eval(input())) for _ in range(N)]
ans = -(-sum(h)//((N-1)*B+A))
while True:
hprime = [h[i]-ans*B for i in range(N) if h[i]-ans*B >0]
hans = ans
for j in hprime:
hans -= -(-j//C)
if hans >= ... | def inpl(): return [int(i) for i in input().split()]
N,A,B = inpl()
C = A-B
h = [int(eval(input())) for _ in range(N)]
lo = -(-sum(h)//((N-1)*B+A)) -1
hi = sum([-(-i//A) for i in h])
while hi - lo > 1:
me = (hi+lo)//2
hprime = [h[i]-me*B for i in range(N) if h[i]-me*B >0]
hans = 0
for... | p03702 |
import bisect
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def ceil(x):
return int((-x)//1*(-1))
N, A, B = list(map(int, input().split()))
hp = [int(eval(input())) for _ in range(N)]
diff = A-B
def solve1():
HP = sorted(hp, reverse=True... | # python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def ceil(x):
return int((-x)//1*(-1))
N, A, B = list(map(int, input().split()))
hp = [int(eval(input())) for _ in range(N)]
diff = A-B
def check(x, HP):
cnt = 0
for i in range(N):
... | p03702 |
import math
N, A, B = list(map(int, input().split()))
h = []
min_h = 10 ** 10
max_h = 0
for _ in range(N):
hi = int(eval(input()))
if hi < min_h:
min_h = hi
if hi > max_h:
max_h = hi
h.append(hi)
min_K = math.ceil(min_h / A)
max_K = math.ceil(max_h / B)
K = min_K
... | import math
N, A, B = list(map(int, input().split()))
h = []
min_h = 10 ** 10
max_h = 0
for _ in range(N):
hi = int(eval(input()))
if hi < min_h:
min_h = hi
if hi > max_h:
max_h = hi
h.append(hi)
min_K = math.ceil(sum(h) / (A - B + B * N)) - 1
max_K = math.ceil(max... | p03702 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
# from numpy import array, sum
N, A, B = list(map(int, input().split()))
h_li = []
for i in range(N):
h_li.append(int(eval(input())))
def all_beatable_check(k):
# All enemy get B damage every time
h_damaged = [h - B*k for h in h_li]
# print(h_damaged... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
# from numpy import array, sum
N, A, B = list(map(int, input().split()))
h_li = []
for i in range(N):
h_li.append(int(eval(input())))
def all_beatable_check(k):
# All enemy get B damage every time
h_damaged = [h - B*k for h in h_li]
# print(h_damaged... | p03702 |
import math
n, a, b = list(map(int, input().split()))
hs = list(map(int, (eval(input()) for _ in range(n))))
m = sum(hs) // (a + (n-1)*b) - 10
M = sum(math.ceil(h/a) for h in hs)
def killable(p, hs, a, b):
x = sum(max(0, math.ceil((h-p*b) / (a-b))) for h in hs)
return x <= p
while(m+1 < M):
... | import math
n, a, b = list(map(int, input().split()))
hs = list(map(int, (eval(input()) for _ in range(n))))
m = sum(hs) // (a + (n-1)*b) - 1
#M = sum(math.ceil(h/a) for h in hs)
M = max(hs) // b + 1
def killable(p, hs, a, b):
x = sum(max(0, math.ceil((h-p*b) / (a-b))) for h in hs)
return x <= p
... | p03702 |
# -*- coding: utf-8 -*-
from bisect import bisect
def inpl(): return tuple(map(int, input().split()))
N, A, B = inpl()
D = A-B
H = []
res = 0
for _ in range(N):
H.append(int(eval(input())))
x = sum(H) // (A+B*(N-1))
H = sorted(H)
while len(H):
nH = [h - B*x for h in H]
i = bisect(nH, 0)
... | # -*- coding: utf-8 -*-
def inpl(): return tuple(map(int, input().split()))
N, A, B = inpl()
D = A-B
H = []
res = 0
for _ in range(N):
H.append(int(eval(input())))
H = sorted(H)
l = sum(H) // (A+B*(N-1))
r = sum([h//A + (h%A>0) for h in H])
def judge(m):
nH = [h - B*m for h in H]
if sum([... | p03702 |
n, a, b = list(map(int, input().split()))
h = [int(eval(input())) for i in range(n)]
h.sort()
def check(k):
top = 0
tmp = h[::]
for i in range(n):
amari = tmp[i] - b*k
if amari > 0:
top += -(-amari//(a-b))
return top <= k
# 二分探索
left = 0
right = -(-1*sum(h)//... | n, a, b = list(map(int, input().split()))
h = [int(eval(input())) for i in range(n)]
def check(k):
cnt = 0
for i in h:
hp = i - k*b
if hp > 0:
cnt += -(-hp//(a-b))
return cnt <= k
left = 0
right = 10**10
while right - left>1:
mid = (right + left)//2
if ch... | p03702 |
#!/usr/bin/env python
from collections import deque
import itertools as it
import sys
sys.setrecursionlimit(1000000)
while True:
S = input()
if S == '0':
break
m = {}
for i in range(11):
m[i] = []
m[0].append(11)
diff = 0
even = True
S = reversed(S)
... | #!/usr/bin/env python
from collections import deque
import itertools as it
import sys
sys.setrecursionlimit(1000000)
while True:
S = input()
if S == '0':
break
m = [0 for i in range(11)]
m[0] = 1
diff = 0
even = True
S = reversed(S)
ans = 0
for c in S:
... | p01300 |
#!/usr/bin/env python
from collections import deque
import itertools as it
import sys
sys.setrecursionlimit(1000000)
while True:
S = input()
if S == '0':
break
m = [0 for i in range(11)]
m[0] = 1
diff = 0
even = True
S = reversed(S)
ans = 0
for c in S:
... | while True:
S = input()
if S == '0':
break
m = [0 for i in range(11)]
m[0] = 1
diff = 0
even = True
S = reversed(S)
ans = 0
for c in S:
num = int(c)
if even:
diff += num
else:
diff -= num
diff %= 11
... | p01300 |
#!/usr/bin/env python
from collections import deque
import itertools as it
import sys
sys.setrecursionlimit(1000000)
while True:
S = input()
if S == '0':
break
m = [1] + [0 for i in range(10)]
diff = 0
even = 1
S = reversed(S)
ans = 0
for c in S:
num ... | #!/usr/bin/env python
from collections import deque
import itertools as it
import sys
sys.setrecursionlimit(1000000)
while True:
S = input()
if S == '0':
break
m = [1] + [0 for i in range(10)]
diff = ans = 0
even = 1
S = reversed(S)
for c in S:
num = int(c... | p01300 |
while True:
S=input()
if S=='0':break
m=[1]+[0 for i in range(10)]
d=A=0
e=1
S=reversed(S)
for c in S:
d=(d+int(c)*e)%11
if int(c)!=0:A+=m[d]
m[d]+=1
e*=-1
print(A)
| while True:
S = input()[::-1]
if S == '0' : break
m = [1] + [0] * 10
diff = ans = 0
even = 1
for c in S:
num = int(c)
diff = (diff + num * even) % 11
if num : ans += m[diff]
m[diff] += 1
even *= -1
print(ans)
| p01300 |
import sys
sys.setrecursionlimit(10**9)
N = int(eval(input()))
As = list(map(int, input().split()))
adjL = [[] for _ in range(N)]
for _ in range(N-1):
A, B = list(map(int, input().split()))
adjL[A-1].append(B-1)
adjL[B-1].append(A-1)
def dfsTree(vNow):
useds[vNow] = True
for v2 in adj... | import sys
sys.setrecursionlimit(10**9)
N = int(eval(input()))
As = list(map(int, input().split()))
adjL = [[] for _ in range(N)]
for _ in range(N-1):
A, B = list(map(int, input().split()))
adjL[A-1].append(B-1)
adjL[B-1].append(A-1)
def dfsTree(vNow):
useds[vNow] = True
for v2 in adj... | p03809 |
while True:
n = eval(input())
if n == 0: break
P = set(tuple(map(int, input().split())) for i in range(n))
ans = 0
for xi, yi in P:
for xj, yj in P:
q = (xj - yj + yi, yj + xj - xi)
r = (xi - yj + yi, yi + xj - xi)
if q in P and r in P:
... | while True:
n = eval(input())
if n == 0: break
P = set(tuple(map(int, input().split())) for i in range(n))
ans = 0
for xi, yi in P:
for xj, yj in P:
q = (xj - yj + yi, yj + xj - xi)
r = (xi - yj + yi, yi + xj - xi)
if q in P and r in P:
... | p00441 |
while True:
n = eval(input())
if n == 0: break
P = set(tuple(map(int, input().split())) for i in range(n))
ans = 0
for xi, yi in P:
for xj, yj in P:
q = (xj - yj + yi, yj + xj - xi)
r = (xi - yj + yi, yi + xj - xi)
if q in P and r in P:
... | while True:
n = eval(input())
if n == 0: break
P = [(list(map(int, input().split()))) for i in range(n)]
S = set(map(tuple, P))
ans = 0
for i in range(n - 1):
xi, yi = P[i]
for j in range(i + 1, n):
xj, yj = P[j]
q = (xj - yj + yi, yj + xj - xi)
... | p00441 |
def main():
#points = [[False for i in range(5001)] for j in range(5001)]
while True:
n = int(eval(input()))
if not n:
break
ps = []
dic = {}
for i in range(n):
x, y = list(map(int,input().split()))
dic[(x, y)] = 1;
#points[x][y] = True
ps.append((x,y)... | def main():
while True:
n = int(eval(input()))
if not n:
break
ps = []
dic = {}
for i in range(n):
x, y = list(map(int,input().split()))
dic[(x, y)] = 1;
ps.append((x,y))
ans = 0
for i in range(n):
for j in range(n):
p1 = ps[i]
... | p00441 |
def main():
while True:
n = int(eval(input()))
if not n:
break
ps = []
dic = {}
for i in range(n):
x, y = list(map(int,input().split()))
dic[(x, y)] = 1;
ps.append((x,y))
ans = 0
for i in range(n):
for j in range(n):
p1 = ps[i]
... | def main():
while True:
n = int(eval(input()))
if not n:
break
ps = [list(map(int,input().split())) for i in range(n)]
dic = set()
for t in ps:
dic.add((t[0],t[1]))
ans = 0
for i in range(n):
for j in range(n):
p1 = ps[i]
p2 = ps[j]
... | p00441 |
import itertools
while 1:
n = eval(input())
if n == 0: break
xy = sorted([list(map(int,input().split())) for i in range(n)])
dxy = [[xy1[0]-xy2[0],xy1[1]-xy2[1]] for xy1,xy2 in itertools.combinations(xy,2)]
for i in range(len(dxy)-1,-1,):
if dxy.count(dxy[i]) < 2: del dxy[i]
dxy = sorted(dxy, key = lamb... | p = 100
while 1:
n = eval(input())
if n == 0: break
xy = sorted([list(map(int,input().split())) for i in range(n)])
S = set(map(tuple,xy))
ans = 0
for i in range(n):
x1,y1 = xy[i]
xy = xy[:i] + sorted(xy[i:], key = lambda XY:(XY[0]-x1)**2 + (XY[1]-y1)**2)
cur = 0
for j in range(n-1,i,-1):
x... | p00441 |
p = 100
while 1:
n = eval(input())
if n == 0: break
xy = sorted([list(map(int,input().split())) for i in range(n)])
S = set(map(tuple,xy))
ans = 0
for i in range(n):
x1,y1 = xy[i]
xy = xy[:i] + sorted(xy[i:], key = lambda XY:(XY[0]-x1)**2 + (XY[1]-y1)**2)
cur = 0
for j in range(n-1,i,-1):
x... | while 1:
n = eval(input())
if n == 0: break
xy = [list(map(int,input().split())) for i in range(n)]
S = set(map(tuple,xy))
ans = 0
for i in range(n):
x1,y1 = xy[i]
for j in range(n-1,i,-1):
x2,y2 = xy[j]
a = (x2-y2+y1,y2+x2-x1)
b = (x1-y2+y1,y1+x2-x1)
if a in S and b in S:
ans = m... | p00441 |
def dot(c1, c2):
return c1.real * c2.real + c1.imag * c2.imag
def cross(c1, c2):
return c1.real * c2.imag - c1.imag * c2.real
def string_to_complex(s):
x, y = list(map(int, s.split()))
return x + y * 1j
def contains(polygon, point):
up = False
down = False
start_point = polyg... | def dot(c1, c2):
return c1.real * c2.real + c1.imag * c2.imag
def cross(c1, c2):
return c1.real * c2.imag - c1.imag * c2.real
def string_to_complex(s):
x, y = list(map(int, s.split()))
return x + y * 1j
def contains(polygon, point):
flag = False
for v1, v2 in zip(polygon[0:], poly... | p02299 |
def dot(c1, c2):
return c1.real * c2.real + c1.imag * c2.imag
def cross(c1, c2):
return c1.real * c2.imag - c1.imag * c2.real
def string_to_complex(s):
x, y = list(map(int, s.split()))
return x + y * 1j
def contains(polygon, point):
flag = False
for v1, v2 in zip(polygon[0:], poly... | def dot(c1, c2):
return c1.real * c2.real + c1.imag * c2.imag
def cross(c1, c2):
return c1.real * c2.imag - c1.imag * c2.real
def string_to_complex(s):
x, y = list(map(int, s.split()))
return x + y * 1j
def contains(polygon, point):
flag = False
for v1, v2 in zip(polygon[0:], poly... | p02299 |
from math import atan2
n = eval(input())
p = [list(map(int, input().split())) for i in range(n)]
for t in range(eval(input())):
x, y = list(map(int, input().split()))
inline = 0
theta = 0.
for i in range(n):
x0 = p[i-1][0] - x
y0 = p[i-1][1] - y
x1 = p[i][0] - x
... | def inside_polygon(p0, qs):
cnt = 0
L = len(qs)
x, y = p0
for i in range(L):
x0, y0 = qs[i-1]; x1, y1 = qs[i]
x0 -= x; y0 -= y
x1 -= x; y1 -= y
cv = x0*x1 + y0*y1
sv = x0*y1 - x1*y0
if sv == 0 and cv <= 0:
return 1
if no... | p02299 |
import sys
from operator import itemgetter, attrgetter
from itertools import starmap
import cmath
from math import isinf, sqrt, acos, atan2
readline = sys.stdin.readline
EPS = 1e-9
ONLINE_FRONT = -2
CLOCKWISE = -1
ON_SEGMENT = 0
COUNTER_CLOCKWISE = 1
ONLINE_BACK = 2
class Circle(object):
__slots__ = ('... | import sys
from operator import itemgetter, attrgetter
from itertools import starmap
import cmath
from math import isinf, sqrt, acos, atan2
readline = sys.stdin.readline
EPS = 1e-9
ONLINE_FRONT = -2
CLOCKWISE = -1
ON_SEGMENT = 0
COUNTER_CLOCKWISE = 1
ONLINE_BACK = 2
class Circle(object):
__slots__ = ('... | p02299 |
#coding:utf-8
n, k = list(map(int, input().split()))
backList = []
for i in range(n):
backList.append(int(eval(input())))
def capa(p,k):
cnt = 0
pcopy = p
num = 0
for back in backList:
if back > p:
break
if back <= pcopy:
pcopy -= back
... | #coding:utf-8
n, k = list(map(int, input().split()))
backList = []
for i in range(n):
backList.append(int(eval(input())))
def capa(p,k):
cnt = 0
pcopy = p
num = 0
for back in backList:
if back > p:
break
if back <= pcopy:
pcopy -= back
... | p02270 |
def carriable_baggage(baggage, baggage_num, truck_capacity, truck_num):
"""Return the number of baggae which trucks can carry."""
laden_baggage = 0
for i in range(truck_num):
laden_weight = 0
while laden_weight + baggage[laden_baggage] <= truck_capacity:
laden_weight += bag... | def carriable_baggage(baggage, baggage_num, truck_capacity, truck_num):
"""Return the number of baggae which trucks can carry."""
laden_baggage = 0
for i in range(truck_num):
laden_weight = 0
while laden_weight + baggage[laden_baggage] <= truck_capacity:
laden_weight += bag... | p02270 |
def carriable_baggage(baggage, baggage_num, truck_capacity, truck_num):
"""Return the number of baggae which trucks can carry."""
laden_baggage = 0
for i in range(truck_num):
laden_weight = 0
while laden_weight + baggage[laden_baggage] <= truck_capacity:
laden_weight += bag... | def carriable_baggage(baggage, baggage_num, truck_capacity, truck_num):
"""Return the number of baggae which trucks can carry."""
laden_baggage = 0
for i in range(truck_num):
laden_weight = 0
while laden_weight + baggage[laden_baggage] <= truck_capacity:
laden_weight += bag... | p02270 |
def carriable_baggage(baggage, baggage_num, truck_capacity, truck_num):
"""Return the number of baggae which trucks can carry."""
laden_baggage = 0
for i in range(truck_num):
laden_weight = 0
while laden_weight + baggage[laden_baggage] <= truck_capacity:
laden_weight += bag... | def carriable_baggage(baggage, baggage_num, truck_capacity, truck_num):
"""Return the number of baggae which trucks can carry."""
laden_baggage = 0
for i in range(truck_num):
laden_weight = 0
while laden_weight + baggage[laden_baggage] <= truck_capacity:
laden_weight += bag... | p02270 |
import sys
def f(P):
i=0
for _ in[0]*k:
s=0
while s+w[i]<=P:
s+=w[i];i+=1
if i==n: return n
return i
n,k=list(map(int,input().split()))
w=list(map(int,sys.stdin.read().splitlines()))
l=0;r=n*100000
while r-l>1:
m=(l+r)//2
if f(m)>=n:r=m
else:l=m
print(r)
| import sys
def f(P):
i=0
for _ in[0]*k:
s=0
while s+w[i]<=P:
s+=w[i];i+=1
if i==n: return n
return i
n,k=list(map(int,input().split()))
w=list(map(int,sys.stdin.read().splitlines()))
l=0;r=sum(w)
while r-l>1:
m=(l+r)//2
if f(m)>=n:r=m
else:l=m
print(r)
| p02270 |
import sys
def f(P):
i=0
for _ in[0]*k:
s=0
while s+w[i]<=P:
s+=w[i];i+=1
if i==n: return n
return i
n,k=list(map(int,input().split()))
w=list(map(int,sys.stdin.read().splitlines()))
l=0;r=sum(w)
while r-l>1:
m=(l+r)//2
if f(m)>=n:r=m
else:l=m
print(r)
| import sys
def f(P):
i=0
for _ in[0]*k:
s=0
while s+w[i]<=P:
s+=w[i];i+=1
if i==n: return n
return i
n,k=list(map(int,input().split()))
w=list(map(int,sys.stdin.readlines()))
l=0;r=sum(w)
while r-l>1:
m=(l+r)//2
if f(m)>=n:r=m
else:l=m
print(r)
| p02270 |
import sys
n,k=list(map(int,input().split()))
w=list(map(int,sys.stdin.readlines()))
def f():
i=0
for _ in[0]*k:
s=0
while s+w[i]<=m:
s+=w[i];i+=1
if i==n:return n
return i
l,r=max(w),sum(w)
while l<r:
m=(l+r)//2
if f()>=n:r=m
else:l=m+1
print(r)
| import sys
def s():
n,k=list(map(int,input().split()))
w=list(map(int,sys.stdin.readlines()))
def f():
c=t=0
for j in w:
t+=j
if t>m:
t=j
c+=1
if c>=k:return 0
return 1
l,r=max(w),sum(w)
while l<r:
m=(l+r)//2
if f():r=m
else:l=m+1
print(r)
if'__main__'==__name__:s(... | p02270 |
num, track = [int(x) for x in input().split()]
hoge_l = list()
for _ in range(num):
hoge_l.append(int(eval(input())))
hoge_i = sum(hoge_l)
if hoge_i % track == 0:
hoge_i = hoge_i // track
else:
hoge_i = hoge_i // track + 1
while True:
tmp = 0
c = 1
for v in hoge_l:
tmp += ... | def imas(hoge_l, p, track):
s_weights = 0
now_track = 1
for val in hoge_l:
s_weights += val
if s_weights > p:
s_weights = val
now_track += 1
if now_track > track:
return False
return True
num, track = [int(x) for x in input().split... | p02270 |
global N,K
global ws
def check(max_p):
track=0
now=0
for i in range (N):
if(ws[i]>max_p):return False
if(now+ws[i]>max_p):
track+=1
now=ws[i]
else:
now+=ws[i]
if now>0:
track+=1
if(track>K):
return False... |
global N,K
global ws
def check(max_p):
track=0
now=0
for i in range (N):
if(ws[i]>max_p):return False
if(now+ws[i]>max_p):
track+=1
now=ws[i]
else:
now+=ws[i]
if now>0:
track+=1
if(track>K):
return False... | p02270 |
import math
n, k = list(map(int, input().split()))
a = [int(eval(input())) for _ in [None]*n]
lb = max(a)
ub = lb * n
while True:
mid = (ub+lb) // 2
remain = k - 1
cw = 0
for w in a:
cw += w
if cw > mid:
remain -= 1
cw = w
if remain < 0:
... | def solve():
import sys
n, k = list(map(int, input().split()))
ws = tuple(map(int, sys.stdin))
ok, ng = sum(ws), max(ws)-1
while ok-ng > 1:
mid = (ok+ng+1)//2
current = 0
count = 0
for w in ws:
if current + w > mid:
current =... | p02270 |
#!/usr/bin/python3
# -*- coding: utf-8 -*-
import sys
import math
def is_loadable(load, num_truck, w_list):
excess = load*num_truck - sum(w_list)
#print('Minimum Load:', load, num_truck, 'excess:', excess)
cur_load = 0
#truck_load = list()
for w in w_list:
#print(cur_load, w... | #!/usr/bin/python3
# -*- coding: utf-8 -*-
import sys
import math
def is_loadable(load, num_truck, w_list):
excess = load*num_truck - sum(w_list)
# print('Minimum Load:', load, num_truck, 'excess:', excess)
cur_load = 0
#truck_load = list()
for w in w_list:
#print(cur_load, ... | p02270 |
n,k = [int(s) for s in input().split()]
#n,k = [int(s) for s in data.pop().split()]
w_org = []
[w_org.append(int(eval(input()))) for i in range(n)]
#[w_org.append(int(data.pop())) for i in range(n)]
def can(p_org,k):
p = p_org
w = w_org[:]
while k and w:
ww = w[0]
if ww <= p:
p -= ww
w.pop(0)... | n,k = [int(s) for s in input().split()]
#n,k = [int(s) for s in data.pop().split()]
#n,k = 100000,100000
w_org = []
[w_org.append(int(eval(input()))) for i in range(n)]
#[w_org.append(int(data.pop())) for i in range(n)]
#w_org = [1 for i in range(n)]
def can(p_org,k):
p = p_org
w = w_org[::-1]
while k ... | p02270 |
#ALDS1_4-D Allocation
from collections import deque
def pIsAccptbl(w,k,p):
tr = 0
c = 0
while(w):
tmp = w.popleft()
if( tr + tmp > p):
tr = tmp
c += 1
else:
tr += tmp
c+=1
if c>k:
return False
else:
r... | #ALDS1_4-D Allocation
from collections import deque
def pIsAccptbl(w,k,p):
tr = 0
c = 0
while(w):
tmp = w.popleft()
if( tr + tmp > p):
tr = tmp
c += 1
else:
tr += tmp
if c+1>k:return False
return True
n,k = input()... | p02270 |
from collections import deque
def cndP(l,n,p1,p2):
d = set()
min = sum(l[:])
length = len(l)
for i in range(length-n+1):
s = sum(l[i:i+n])
if s < min:
min = s
if p2 == None:
if p1 < s:
d.add(s)
else:
if p1... | from collections import deque
import sys
sys.setrecursionlimit(100000)
def copyDeque(d):
x = deque()
for i in d:
x.append(i)
return x
def cndP(w):
if len(w)>1:
x = w.pop()
cndP(copyDeque(w))
w.append(x)
s = 0
while(len(w)>0):
... | p02270 |
from collections import deque
def isPa(w,k,p):
tr = 0
c = 0
d = deque(w)
while(d):
tmp = d.popleft()
if(tmp > p):
return False
if( tr + tmp > p):
tr = tmp
c += 1
else:
tr += tmp
if c+1>k:
... | from collections import deque
def isPa(w,k,p):
tr = 0
c = 0
d = deque(w)
while(d):
tmp = d.popleft()
if(tmp > p):
return False
if( tr + tmp > p):
tr = tmp
c += 1
else:
tr += tmp
if c+1>k:
... | p02270 |
n, k = [int(t) for t in input().split()]
w = [int(eval(input())) for i in range(n)]
hi = sum(w)
lo = max(w)
def canMove(w, P, k):
s = 0
for i in range(len(w)):
if s + w[i] > P:
s = 0
k -= 1
if k <= 0: return False
s += w[i]
return True
P... | n, k = [int(t) for t in input().split()]
w = [int(eval(input())) for i in range(n)]
def canMove(w, P, k):
s = 0
for i in range(len(w)):
if s + w[i] > P:
s = 0
k -= 1
if k <= 0: return False
s += w[i]
return True
hi = sum(w)
lo = max(w)
P... | p02270 |
n, k = list(map(int, input().split()))
ww = [int(eval(input())) for _ in range(n)]
def chk(p):
c = 1
s = 0
for w in ww:
if w > p:
return False
if s + w <= p:
s += w
else:
c += 1
s = w
if c > k:
return F... | n, k = list(map(int, input().split()))
ww = [int(eval(input())) for _ in range(n)]
def chk(p):
c = 1
s = 0
for w in ww:
if w > p:
return False
if s + w <= p:
s += w
else:
c += 1
s = w
if c > k:
return F... | p02270 |
from functools import lru_cache
n, tracks = list(map(int, input().split()))
loads = []
for _ in range(n):
loads.append(int(eval(input())))
# print(loads)
slices = []
min_load = [99999999999999]
@lru_cache()
def slicing(rest, s=0):
if not rest:
# slices.append(s+[(len(s) and s[-1][1], ... | n, k = list(map(int, input().split()))
def check(p):
i = 0
for j in range(k):
s = 0
while s + T[i] <= p:
s += T[i]
i += 1
if i == n:
return n
return i
def solve():
left = 0
right = 100000 * 10000
while righ... | p02270 |
import sys
readline = sys.stdin.readline
N, K = list(map(int, input().split()))
W = tuple(int(readline()) for _ in range(N))
ma = max(W)
def check(x):
if x < ma:
return False
use = 1
rest = x
for w in W:
if rest >= w:
rest -= w
else:
rest = x... | import sys
readline = sys.stdin.readline
N, K = list(map(int, input().split()))
W = tuple(map(int, sys.stdin.read().splitlines()))
ma = max(W)
def check(x):
if x < ma:
return False
use = 1
rest = x
for w in W:
if rest >= w:
rest -= w
else:
re... | p02270 |
def takein(p):
s = 0
track = 1
for i in range(n):
if s + w[i] <= p:
s += w[i]
else:
track += 1
if track > k: return False
s = w[i]
return True
n, k = list(map(int, input().strip().split()))
w = []
for i in range(n):
w.ap... | import sys
def check(p):
s = w[0]
track = 1
for i in range(1, n):
if s + w[i] <= p:
s += w[i]
else:
track += 1
if track > k: return False
s = w[i]
return True
n, k = list(map(int, sys.stdin.readline().strip().split()))
w = ... | p02270 |
n, k = list(map(int, input().split()))
l = []
for i in range(n):
d = int(eval(input()))
l.append(d)
p = max(l)
while True:
sm_k = 0
k_no = 1
for li in l:
if sm_k + li > p:
k_no += 1
sm_k = li
else:
sm_k += li
# print(p, k_n... | n, k = list(map(int, input().split()))
l = []
for i in range(n):
d = int(eval(input()))
l.append(d)
p = max(l)
while True:
sm_k = 0
k_no = 1
for li in l:
if sm_k + li > p:
k_no += 1
if k_no > k:
break
sm_k = li
el... | p02270 |
# -*- coding: utf-8 -*-
import sys
import os
n, k = list(map(int, input().split()))
#print(k, '??°??§????????????')
W = []
for i in range(n):
W.append(int(eval(input())))
def check(P):
# ?????????P?????\?????¨??????????????????????????????????????????????????¢??°
weight_index = 0
fo... | # -*- coding: utf-8 -*-
import sys
import os
n, k = list(map(int, input().split()))
#print(k, '??°??§????????????')
W = []
for i in range(n):
W.append(int(eval(input())))
def check(P):
# ?????????P?????\?????¨??????????????????????????????????????????????????¢??°
weight_index = 0
fo... | p02270 |
class Solve:
def __init__(self):
self.N, self.K = [int(i) for i in input().split()]
self.W = [int(eval(input())) for i in range(self.N)]
self.a = max(self.W)-1 # >= 0; False
self.b = sum(self.W) # <= 10**9; True
def check(self, P):
k, p, W = 1, P, [w for w ... |
class Solve:
def __init__(self):
self.N, self.K = [int(i) for i in input().split()]
self.W = [int(eval(input())) for i in range(self.N)]
self.a = max(self.W)-1 # >= 0; False
self.b = sum(self.W) # <= 10**9; True
def check(self, P):
k, p, W = 1, P, [w for w ... | p02270 |
n, k = list(map(int, input().split()))
w = [int(eval(input())) for i in range(n)]
def f(P):
mx = k * P
total = 0
for i in range(n):
tmp = total + w[i]
if tmp > mx:
return i
else:
total = tmp
return n
def f(P):
i = 0
for j in range... | n, k = list(map(int, input().split()))
w = [int(eval(input())) for i in range(n)]
def f(P):
i = 0
for j in range(k):
s = 0
while s + w[i] <= P:
s += w[i]
i += 1
if i == n: return n
return i
left = 0
right = 100000 * 10000
while right - l... | p02270 |
import math, sys
def loadable(w, n, k, p, wsum):
wait = 0
for i in range(n):
wait += w[i]
wsum -= w[i]
if wait > p:
k -= 1
wait = w[i]
if k == 0 or p < wsum / k:
return False
return True
n, k = list(map(int, sys.stdi... | import math, sys
def loadable(w, n, k, p, wsum):
wait = 0
for i in range(n):
wait += w[i]
wsum -= w[i]
if wait > p:
k -= 1
wait = w[i]
if k == 0 or p < wsum / k:
return False
return True
n, k = list(map(int, sys.stdi... | p02270 |
from itertools import combinations
n,k = list(map(int, input().split()))
k = min(n,k)
W = list(map(int,[eval(input()) for _ in range(n)]))
if k > 1:
P = 10001
for b in combinations(list(range(1,n)),k-1):
s = 0
Pi = 0
for i in b:
Pi = max(Pi, sum(W[s:i]))
... | def checkCapacity(W,k,P):
ws = 0
cnt = 1
for wi in W:
if wi > P: return False
ws += wi
if ws > P:
cnt += 1
ws = wi
if cnt > k: return False
return True
if __name__=='__main__':
n,k = list(map(int, input().split()))
W = list(m... | p02270 |
def checkCapacity(W,k,P):
ws = 0
cnt = 1
for wi in W:
if wi > P: return False
ws += wi
if ws > P:
cnt += 1
ws = wi
if cnt > k: return False
return True
if __name__=='__main__':
n,k = list(map(int, input().split()))
W = list(m... | def checkCapacity(W,k,P):
ws = 0
cnt = 1
for wi in W:
ws += wi
if ws > P:
cnt += 1
ws = wi
if cnt > k: return False
return True
if __name__=='__main__':
n,k = list(map(int, input().split()))
W = list(map(int,[eval(input()) for _ in ra... | p02270 |
from math import ceil
s = input().split(" ")
n = int(s[0])
k = int(s[1])
w = []
total = 0
for i in range(n):
a = int(eval(input()))
w.append(a)
total += a
mx = max(ceil(total / k), max(w))
while True:
t = []
t.append(w[0])
for i in range(1,len(w)):
if t[len(t)-1] + w[i] <=... | def check(P,w,n):
i = 0
for j in range(k):
s = 0
while s + w[i] <= P:
s += w[i]
i += 1
if i == n:
return n
return i
s = input().split(" ")
n = int(s[0])
k = int(s[1])
w = []
for i in range(n):
a = int(eval(input()))
... | p02270 |
n, k = list(map(int, input().split(' ')))
w_s = [int(eval(input())) for i in range(n)]
max_w = max(w_s)
while True:
tmp_total_w = 0
tmp_k = 1
for w in w_s:
tmp_total_w += w
if tmp_total_w > max_w:
tmp_k += 1
tmp_total_w = w
if tmp_k <= k:
... | def calc_k_constP(P):
tmp_total_w = 0
tmp_k = 1
for w in w_s:
tmp_total_w += w
if tmp_total_w > P:
tmp_k += 1
tmp_total_w = w
return tmp_k
n, k = list(map(int, input().split(' ')))
w_s = [int(eval(input())) for i in range(n)]
max_w = max(w_s)
l... | p02270 |
def binary_search(n, k, lw):
left = 0
right = max(lw) * n
while left <= right:
mid = (left + right)//2
if is_underweight(n, k, lw, p=mid):
right = mid - 1
else:
left = mid + 1
if is_underweight(n, k, lw, p=right):
return right
el... | def binary_search(n, k, lw):
left = 0
right = max(lw) * n
while left < right:
mid = (left + right)//2
if is_underweight(n, k, lw, p=mid):
right = mid
else:
left = mid + 1
return left
def is_underweight(n, k, lw, p):
i = 0
w = 0
... | p02270 |
def check_alloc(weights, cnt, cpct, st, stn):
num = 1
cur = stn
for i in range(st, len(weights)):
w = weights[i]
if cur + w > cpct:
if num == 1:
st = i
stn = cur
cur = w
num += 1
if num > cnt or cur > cpct:
return False
else:
cur += w
return True
n, k = list(map... | import sys
def check_alloc(weights, cnt, cpct):
num = 1
cur = 0
for i in range(len(weights)):
w = weights[i]
if cur + w > cpct:
cur = w
num += 1
if num > cnt or cur > cpct:
return False
else:
cur += w
return True
n, k = list(map(int, input().split()))
weights = [0] * n
sum... | p02270 |
def calc_k(p, ws):
k = 1
s = 0
for w in ws:
if s + w <= p:
s += w
else:
k += 1
s = w
return k
def search_minimum_p_internal(lp, rp, k, ws):
"?????????P????????????????????¢?´¢??????"
cp = (lp + rp) // 2
k1 = calc_k(cp, ws)
... | def calc_k(p, ws):
k = 1
s = 0
for w in ws:
if w > p:
return None
elif s + w <= p:
s += w
else:
k += 1
s = w
return k
def search_minimum_p(k, ws):
"""
?????????P????????????????????¢?´¢??????
max(P) = ma... | p02270 |
n, k = list(map(int, input().split()))
w = [int(eval(input())) for i in range(n)]
l = max(w)
r = sum(w)
while l < r:
m = (l + r) // 2
stack = car = 0
for i in w:
stack += i
if stack > m:
stack = i
car += 1
if car < k:
r = m
else:
... | import sys
n, k = list(map(int, input().split()))
w = [int(sys.stdin.readline()[:-1]) for i in range(n)]
l = max(w)
r = sum(w)
while l < r:
m = (l + r) // 2
stack = car = 0
for i in w:
stack += i
if stack > m:
stack = i
car += 1
if car < k:
... | p02270 |
from math import ceil
def check_p(p):
global k, ws
ct, nt = 0, 1
for w in ws:
if ct + w <= p:
ct += w
else:
nt += 1
if nt > k:
return False
ct = w
return True
n, k = list(map(int, input().split()))
ws... | def check_p(p):
global k, ws
ct, nt = 0, 1
for w in ws:
if ct + w <= p:
ct += w
else:
nt += 1
if nt > k:
return False
ct = w
return True
n, k = list(map(int, input().split()))
ws = [int(eval(input())) for ... | p02270 |
def check_p(p):
global k, ws
ct, nt = 0, 1
for w in ws:
if ct + w <= p:
ct += w
else:
nt += 1
if nt > k:
return False
ct = w
return True
n, k = list(map(int, input().split()))
ws = [int(eval(input())) for ... | def check_p(p):
global k, ws
lt, nt = 0, 1 # loadage_of_current_truck, num_of_truck
for w in ws:
lt += w
if lt > p:
nt += 1
if nt > k:
return False
lt = w
return True
n, k = list(map(int, input().split()))
ws = [int(e... | p02270 |
def calc_allocatable_packet(packets, num_of_trucks, p_max):
""" ?????????????????°?????????????????§?????????????±?????????????n??°??????????????????????????????????????°????±??????? """
num_of_packets = len(packets)
next_p = 0 # ?????°?????????????????° ??? ?¬????packet[i]?????????????????????
for... | def calc_allocatable_packet(packets, num_of_trucks, p_max):
""" ?????????????????°?????????????????§?????????????±?????????????n??°??????????????????????????????????????°????±??????? """
num_of_packets = len(packets)
next_p = 0 # ?????°?????????????????° ??? ?¬????packet[i]?????????????????????
for... | p02270 |
import sys
n, k = list(map(int, input().split()))
ws = list(map(int, sys.stdin.read().split()))
h = sum(ws)
p = h // k
def isEnough(A, n, k, w):
ps = [w for x in range(k)]
j = 0
for i in range(n):
a = A[i]
p = ps[j]
if p < a:
j += 1
if j < k... | import sys
n, k = list(map(int, input().split()))
ws = list(map(int, sys.stdin.read().split()))
h = sum(ws)
p = h // k
def isEnough(A, n, k, w):
one = w
count = 0
for a in A:
if one < a:
count += 1
if count < k:
one = w
else:
... | p02270 |
import sys
import math
def check_sekisairyo(k, p_min, w_i):
p_now = 0
k_now = 0
for w in w_i:
p_now += w
if p_now > p_min:
p_now = w
k_now += 1
elif p_now == p_min:
p_now = 0
k_now += 1
if k_now == k and p_now != ... | import sys
def check_sekisairyo(p_min):
p_now = 0
k_now = 0
for w in w_i:
p_now += w
if p_now > p_min:
p_now = w
k_now += 1
elif p_now == p_min:
p_now = 0
k_now += 1
if k_now == k and p_now != 0:
retur... | p02270 |
def p(k,w,maxP):
count = 1
tmpList = []
for x in w:
if sum(tmpList)+x <= maxP:
tmpList.append(x)
else:
count += 1
if count > k :
return False
tmpList = []
tmpList.append(x)
return True
... |
def p(k,w,maxP):
count = 1
tmpWeight = 0
for x in w:
if tmpWeight+x <= maxP:
tmpWeight += x
else:
count += 1
if count > k :
return False
tmpWeight = x
return True
n,k = list(map(int,input().sp... | p02270 |
import sys
n, k = list(map(int, input().split()))
w = tuple(map(int, sys.stdin.readlines()))
p = max(w)
s = sum(w)
if n <= k:
print(p)
elif k == 1:
print(s)
else:
a = max(p, s//k)
while True:
l = [a]
for i in range(n):
d = l[-1] - w[i]
if d < 0:
... | n,k = list(map(int, input().split()))
w = [int(eval(input())) for _ in range(n)]
def check(p):
c = t = 0
for wi in w:
t += wi
if t > p:
t = wi
c += 1
if c >= k:
return False
return True
s = max(w)
l = sum(w)
m = l + (s-l)*... | p02270 |
import sys
import math
def is_capable(n, k, w, P):
track = 0
cnt = 0
i = 0
while cnt < k:
if i == n:
return True
if track + w[i] > P:
track = 0
cnt += 1
else:
track += w[i]
i += 1
return False
... | import sys
import math
def is_capable(n, k, w, P):
track = 0
cnt = 0
i = 0
while cnt < k:
if i == n:
return i
if track + w[i] > P:
track = 0
cnt += 1
else:
track += w[i]
i += 1
return i
pa... | p02270 |
from collections import deque
N=int(eval(input()))
A=[int(i) for i in input().split()]
A=[0]+A
for i in range(N):
A[i+1]+=A[i]
def dou(X):
n=len(X)
ma=len(X)-1
mi=0
while ma-mi>1:
mid = (ma + mi)//2
a=X[n-1]-X[mid]
b=X[mid-1]-X[0]
if a>b:
mi... | from collections import deque
N=int(eval(input()))
A=[int(i) for i in input().split()]
A=[0]+A
for i in range(N):
A[i+1]+=A[i]
def dou(i,j):
ma=j
mi=i
while ma-mi>1:
mid = (ma + mi)//2
a=A[j]-A[mid]
b=A[mid-1]-A[i]
if a>b:
mi=mid
else:
... | p03312 |
from collections import deque
N=int(eval(input()))
A=[int(i) for i in input().split()]
A=[0]+A
for i in range(N):
A[i+1]+=A[i]
def dou(i,j):
ma=j
mi=i
while ma-mi>1:
mid = (ma + mi)//2
a=A[j]-A[mid]
b=A[mid-1]-A[i]
if a>b:
mi=mid
else:
... | #from collections import deque
from bisect import bisect_left
N=int(eval(input()))
A=[int(i) for i in input().split()]
A=[0]+A
for i in range(N):
A[i+1]+=A[i]
num=10**14
for i in range(2,N-1):
ans=[]
x=(A[i]+A[0])/2
j=bisect_left(A,x)
#print(j,x)
if A[j]-x>x-A[j-1]:
j-=1
... | p03312 |
from itertools import accumulate
from bisect import bisect_right
N = int(eval(input()))
A = list(map(int, input().split()))
# 累積和を前計算
cumsum = list(accumulate(A))
cumsum.insert(0, 0)
#print(cumsum)
ans = float('inf')
# 真ん中を全探索
for i in range(2, N-1):
#print(A[:i], A[i:])
# 左の真ん中
LC = cumsum... | from itertools import accumulate
from bisect import bisect_right, bisect_left
N = int(eval(input()))
A = list(map(int, input().split()))
# 累積和を前計算
cumsum = list(accumulate(A))
cumsum.insert(0, 0) # out of index 対策
ans = float('inf')
# 真ん中を全探索
for i in range(2, N-1):
#print(cumsum[:i], cumsum[i:])... | p03312 |
from bisect import bisect_left
from itertools import accumulate
N = int(eval(input()))
A = list(map(int, input().split()))
cumsum = list(accumulate(A))
cumsum.insert(0, 0)
ans = float('inf')
# 真ん中区切り全探索
for m in range(2, N-1):
# 左
Lmid = cumsum[m] / 2
Lx = bisect_left(cumsum, Lmid)
#... | from bisect import bisect_left
from itertools import accumulate
N = int(eval(input()))
A = list(map(int, input().split()))
cumsum = list(accumulate(A))
cumsum.insert(0, 0)
ans = float('inf')
for m in range(2, N-1):
# 左
Lmid = cumsum[m] / 2
Lx = bisect_left(cumsum, Lmid)
if abs(Lmid-cumsum... | p03312 |
from bisect import bisect_left as bl
from itertools import accumulate
INF = 10 ** 20
def get_score(acc, head, end):
sec_head = acc[head - 1]
sec_end = acc[end]
sec_sum = sec_end - sec_head
cut = bl(acc, sec_head + sec_sum // 2) - 1
score = INF
reta, retb = None, None
for i in range(cut - 2, cu... | from bisect import bisect_left as bl
from itertools import accumulate
INF = 10 ** 20
def get_score(acc, head, end):
sec_head = acc[head - 1]
sec_end = acc[end]
sec_sum = sec_end - sec_head
cut = bl(acc, sec_head + sec_sum // 2) - 1
score = INF
reta, retb = None, None
for i in range(cut - 1, cu... | p03312 |
n = int(eval(input()))
a = list(map(int, input().split()))
cumsum = [a[0]]
for i in range(1, n):
cumsum.append(cumsum[i-1] + a[i])
i, k = 0, 2
ans = 10**18
for j in range(1, n-2):
while i < j:
p = cumsum[i]
q = cumsum[j] - cumsum[i]
p_new = cumsum[i+1]
q_new = cum... | n = int(eval(input()))
a = list(map(int, input().split()))
i, k = 0, 2
p, q, r, s = 0, a[0], a[1], sum(a[2:])
ans = sum(a)
for j in range(1, n-2):
q += a[j]
while abs((q-a[i]) - (p+a[i])) < abs(q - p):
p += a[i]
q -= a[i]
i += 1
r -= a[j]
while abs((s-a[k]) - (r... | p03312 |
n = int(eval(input()))
a = list(map(int, input().split()))
l, r = a[:2]
m = 1
b = [(l,r)]
for i in range(2, n-2):
r += a[i]
for j in range(m, i):
nl, nr = l+a[j], r-a[j]
if abs(l-r) < abs(nl-nr):
break
l, r = nl, nr
m += 1
b.append((l,r))
l, r =... | n = int(eval(input()))
a = list(map(int, input().split()))
def f(a):
l, r = a[:2]
m = 1
b = [(l,r)]
for i in range(2, n-2):
r += a[i]
while m<i and abs(l-r)>abs(l-r+a[m]*2):
l, r = l+a[m], r-a[m]
m += 1
b.append((l,r))
return b
print((min... | p03312 |
N = int(eval(input()))
A = list(map(int,input().split()))
from bisect import bisect
# 区間の和を高速に求めたいので累積和
S = [0]*N
S[0] = A[0]
for i in range(1,N):
S[i] = S[i-1]+A[i]
Ans = 10**15
# 真ん中の分割位置を全探索
for i in range(2,N-1):
# 前半と後半に分離
A,B = S[:i],S[i:]
sumA,sumB = S[i-1],S[N-1]-S[i-1]
can... | N = int(eval(input()))
A = list(map(int,input().split()))
from bisect import bisect
# 区間の和を高速に求めたいので累積和
S = [0]*N
S[0] = A[0]
for i in range(1,N):
S[i] = S[i-1]+A[i]
Ans = 10**15
# 真ん中の分割位置を全探索
for i in range(2,N-1):
# 前半部分,後半部分をそれぞれできるだけ均等になるように分割
ax = S[i-1]/2
ai = bisect(S,ax)
i... | p03312 |
import bisect
N = int(eval(input()))
A = list(map(int,input().split()))
S = [A[0]]
for i in range(1,N):
S.append(S[i-1]+A[i])
ans = 10**20
for i in range(2, N-1):
m = bisect.bisect(S[:i], S[:i][-1]//2)
if m == 0:
L = [S[:i][0], S[:i][-1]-S[:i][0]]
else:
L = [S[:i][m],... | import bisect
N = int(eval(input()))
A = list(map(int,input().split()))
S = [A[0]]
for i in range(1,N):
S.append(S[i-1]+A[i])
ans = 1e18
for i in range(2, N-1):
# 左側 [0,i)
left_sum = S[i-1]
m = bisect.bisect(S, left_sum/2)
L = [S[m], left_sum-S[m]]
if m != 0:
L2 = ... | p03312 |
from itertools import accumulate
from bisect import bisect_right
N = int(eval(input()))
As = list(map(int, input().split()))
accAs = [0] + list(accumulate(As))
# As[iFr]～As[iTo]の和を求める
def getSum(iFr, iTo):
return accAs[iTo+1] - accAs[iFr]
# As[iFr]～As[iTo]を前後半の総和の差が最小となるように分解する
def getDivision(iF... | N = int(eval(input()))
As = list(map(int, input().split()))
ans = float('inf')
iB, iD = 1, 3
(P, Q, R), S = As[:3], sum(As[3:])
# 真ん中の区切りを全通り試す
for iC in range(2, N - 1):
while P < Q and As[iB] <= Q - P:
P += As[iB]
Q -= As[iB]
iB += 1
while R < S and As[iD] <= S - R:
... | p03312 |
from itertools import accumulate
from bisect import bisect_left
N = int(eval(input()))
C = [0]+list(accumulate(list(map(int,input().split()))))
def helper(i,j):
m = (C[j]+C[i])/2
k = bisect_left(C, m, lo=i+1,hi=j-1)
if k > i+1:
_,a,b = min((abs(m-C[x]),C[x]-C[i],C[j]-C[x]) for x in (k-1,k))
e... | from itertools import accumulate
from bisect import bisect
N = int(eval(input()))
C = [0]+list(accumulate(list(map(int,input().split()))))
def h(i,j):
ci,cj = C[i],C[j]
k = bisect(C, (ci+cj)//2, lo=i+1,hi=j)
_,a,b = min((abs(ci+cj-2*c),cj-c,c-ci) for c in (C[k-1],C[k]))
return a,b
def solve(x):
... | p03312 |
from itertools import accumulate
from bisect import bisect
N = int(eval(input()))
C = [0]+list(accumulate(list(map(int,input().split()))))
S = C[N]
def solve(x):
cx = C[x]
k = bisect(C, cx//2, lo=1,hi=x)
_,a,b = min((abs(cx-2*c),cx-c,c) for c in (C[k-1],C[k]))
k = bisect(C, (S+cx)//2, lo=x+1,hi=N)
... | from itertools import accumulate
from bisect import bisect
N = int(eval(input()))
C = [0]+list(accumulate(list(map(int,input().split()))))
S = C[N]
def it():
k1 = 1
k2 = 3
for i in range(2,N-1):
ci = C[i]
k1 = bisect(C, ci//2, lo=k1,hi=i)
_,a,b = min((abs(ci-2*c),ci-c,c) for c in (C[k1-... | p03312 |
from collections import deque
import sys
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_... | import sys
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 ... | p03312 |
N = int(eval(input()))
A = [int(_) for _ in input().split()]
ans = []
for _ in range(2, N-1):
p = A[:_]
q = A[_:]
P = sum(p)
Q = sum(q)
p_sa = 10**15
q_sa = 10**15
for i in range(1,len(p)):
s = sum(p[:i])
sa = abs(P-s*2)
if sa < p_sa:
n = [... | N = int(eval(input()))
A = [int(_) for _ in input().split()]
ans = []
t = []
c = 0
for i in range(N):
c += A[i]
t.append(c)
l = 0
r = 0
for _ in range(1, N-1):
while t[_] > t[l]+t[l+1]:
l += 1
while t[-1]+t[_] > t[r]+t[r+1]:
r += 1
n = [t[l], t[_]-t[l], t[r]... | p03312 |
# ARC100D
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
# import numpy as np
import bisect
n = int(eval(input()))
a = list(map(int, input().split()))
# a = np.array(list(map(int, input().split())))
ca = [None] * n #ca[i] = a0~aiの和
s = 0
for i,num in e... | # ARC100D
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
n = int(eval(input()))
a = list(map(int, input().split()))
ca = [None] * n #ca[i] = a0~aiの和
s = 0
for i,num in enumerate(a):
s += a[i]
ca[i] = s
diff = [None] * n
s = 0
t = 1
v1 = ... | p03312 |
def main():
from itertools import accumulate, product
def binary_search(a, x, lo, hi):
while lo < hi:
mid = (lo + hi) // 2
if a[mid] < x:
lo = mid + 1
else:
hi = mid
return lo
n = int(eval(input()))
*a, = ... | def main():
n = int(eval(input()))
*a, = list(map(int, input().split()))
# [0,i), [i,j), [j,k), [k, n)
tot = sum(a)
ret = tot
i, k = 1, 3
p, q, r, s = a[0], a[1], a[2], tot - sum(a[:3])
for j in range(2, n - 1):
while (i + 1 < j) and (abs(p - q + a[i] * 2) < abs(p ... | p03312 |
# coding: utf-8
import sys
sys.setrecursionlimit(10 ** 7)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = lr()
def min_max(arr):
"""リストの中を二つに分けて、総和の小さい方と大きい方を返す"""
left = 0; right = len(arr)-1
l_total = arr[left]
... | # coding: utf-8
import sys
from itertools import accumulate
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = lr()
Acum = list(accumulate(A))
l_cut = [None] * N # 左のリストで2つに切り分けるindex
l_cut[1] = 0
l = A[0]; r = A[1]
for i in range(2,... | p03312 |
def i1():
return int(eval(input()))
def i2():
return [int(i) for i in input().split()]
n=i1()
a=i2()
c=[0 for i in range(n)]
b=sum(a)
for i in range(n):
if i: c[i]+=c[i-1]
c[i]+=a[i]
f=float("inf")
import bisect
e=[]
b=a[0]
d=c[n-1]-c[0]
for i in range(1,n-2):
b+=a[i]
d-=a[i]
x=bisect.bisect... | def i1():
return int(eval(input()))
def i2():
return [int(i) for i in input().split()]
n=i1()
a=i2()
c=[0 for i in range(n)]
for i in range(n):
if i: c[i]+=c[i-1]
c[i]+=a[i]
l=0
r=2
f=float("inf")
for i in range(1,n-1):
while abs(c[l]-(c[i]-c[l]))>abs(c[l+1]-(c[i]-c[l+1])):
l+=1
while abs... | p03312 |
n=int(eval(input()))
s=list(map(int,input().split()))
a=[0]
for _ in range(n):
a.append(sum(s[:_+1]))
ans=10**9
f=1
g=3
for i in range(2,n-1):
while f < i and abs(a[f]-(a[i]-a[f])) > abs(a[f+1]-(a[i]-a[f+1])):
f+=1
while g < n and abs(a[g]-a[i]-(a[n]-a[g])) > abs(a[g+1]-a[i]-(a[n]-a[g+1... | n=int(eval(input()))
s=list(map(int,input().split()))
a=[0]
c=0
for si in s:
c+=si
a.append(c)
ans=[]
f=1
g=3
for i in range(2,n-1):
while abs(a[f]-(a[i]-a[f])) > abs(a[f+1]-(a[i]-a[f+1])):
f+=1
while abs(a[g]-a[i]-(a[n]-a[g])) > abs(a[g+1]-a[i]-(a[n]-a[g+1])):
g+=1
ls... | p03312 |
from bisect import bisect
from time import time
st_time = time()
N = int(eval(input()))
src = list(map(int,input().split()))
cums = [0]
for a in src:
cums.append(cums[-1] + a)
ans = cums[-1] * 999
c = bisect(cums, cums[-1]//2)
d = 1
while time() - st_time < 1.94:
if abs(d) >= N: break
if ... | from bisect import bisect
from time import time
st_time = time()
N = int(eval(input()))
src = list(map(int,input().split()))
cums = [0]
for a in src:
cums.append(cums[-1] + a)
ans = cums[-1] * 999
c = bisect(cums, cums[-1]//2)
d = 1
while time() - st_time < 1.9:
if abs(d) >= N: break
if 2... | p03312 |
from bisect import bisect
from time import time
st_time = time()
N = int(eval(input()))
src = list(map(int,input().split()))
cums = [0]
for a in src:
cums.append(cums[-1] + a)
ans = cums[-1] * 999
c = bisect(cums, cums[-1]//2)
d = 1
while time() - st_time < 1.9:
if abs(d) >= N: break
if 2... | from bisect import bisect
from time import time
st_time = time()
N = int(eval(input()))
src = list(map(int,input().split()))
cums = [0]
for a in src:
cums.append(cums[-1] + a)
ans = cums[-1] * 999
c = bisect(cums, cums[-1]//2)
d = 1
while time() - st_time < 1.85:
if abs(d) >= N: break
if ... | p03312 |
from bisect import bisect
from time import time
st_time = time()
N = int(eval(input()))
src = list(map(int,input().split()))
cums = [0]
for a in src:
cums.append(cums[-1] + a)
ans = cums[-1] * 999
c = bisect(cums, cums[-1]//2)
d = 1
while time() - st_time < 1.85:
if abs(d) >= N: break
if ... | N = int(eval(input()))
src = list(map(int,input().split()))
cums = [0]
for a in src:
cums.append(cums[-1] + a)
ps = [None] * (N+1)
qs = [None] * (N+1)
rs = [None] * (N+1)
ss = [None] * (N+1)
l = 1
for r in range(2,N-1):
p1 = cums[l]
q1 = cums[r] - cums[l]
d1 = abs(p1-q1)
while l ... | p03312 |
# arc 100 D
def ruiseki(n,array):
res = [0]*(n+1)
for i in range(n):
res[i+1] = res[i] + array[i]
return res
n = int(eval(input()))
A = list(map(int,input().split()))
sa = ruiseki(n,A)
from bisect import bisect_right
ans = 10**15
for i in range(1,n-2):
left = sa[i+1]
rig... | # arc 100 D
def ruiseki(n,array):
res = [0]*(n)
for i in range(n):
res[i] = res[i-1] + array[i]
return res
n = int(eval(input()))
A = list(map(int,input().split()))
sa = ruiseki(n,A)
ans = 10**15
left_c = 0
right_c = 2
for center in range(1,n-1):
while left_c+1 < center:
... | p03312 |
import random
from itertools import accumulate
N = int(eval(input()))
As = [int(i) for i in input().split(' ')]
#N = pow(10, 4)
#As = [random.randint(0,1000) for r in range(N)]
As = list(accumulate(As))
def bsearch(L, l, r, ls, rs):
if r - l == 0:
l_temp = L[l-1] if l!=0 else 0
lsum... |
def bsearch(mn, mx, func):
#func(i)=False を満たす最大のi
idx = (mx + mn)//2
while mx-mn>1:
if func(idx):
idx, mx = (idx + mn)//2, idx
continue
idx, mn = (idx + mx)//2, idx
return idx
N, = list(map(int, input().split()))
A = list(map(int, input().split()))
X... | p03312 |
def inpl(): return [int(i) for i in input().split()]
N, K = inpl()
H = {0: 0}
for i in range(N):
a, b= inpl()
for ia, ib in list(H.copy().items()):
if ia | a <= K or (ia == 0 and a <= K):
H[ia|a] = max(H.get(ia|a, 0), ib+b)
print((max(H.values()))) | import sys
N, K = list(map(int, input().split()))
candi = []
p = 0
for i in range(30, -1, -1):
if 2**i & K == 0:
p += 2**i
continue
else:
candi.append(p + 2**i)
candi.append(p)
AB = [tuple(map(int, input().split())) for _ in range(N)]
ans = 0
for c in candi:
cans = 0
... | p03584 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n,k=list(map(int,input().split()))
k+=1
AB=[tuple(map(int,input().split())) for _ in range(n)]
dp=[0]*35 # dp[d]: less than が確定するのが d 桁目のときの最大値
# dp[d] の状態の... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n,k=list(map(int,input().split()))
k+=1
AB=[tuple(map(int,input().split())) for _ in range(n)]
dp=[0]*35 # dp[d]: less than が確定するのが d 桁目のときの最大値
# dp[d] の状態の... | p03584 |
N,K,*X = list(map(int, open(0).read().split()))
S = bin(K)[2:]
L = len(S)
one = set()
ls = [(a,b) for a,b in zip(*[iter(X)]*2) if a<=K]
kls = [K]
ans = 0
for i in range(L):
if S[i]=='1':
m = int(S[:i]+'0'+'1'*(L-i-1),2)
kls.append(m)
for k in kls:
m = 0
for a,b in ls:
if k==k|a:
m... | N,K,*X = list(map(int,open(0).read().split()))
S = bin(K)[2:]
L = len(S)
ls = [(a,b) for a,b in zip(*[iter(X)]*2)]
s = '0'
ans = 0
for i,c in enumerate(S):
if c=='0':
s += c
continue
j = L-i
m = (1<<(j-1))-1
n = int(s,2)<<j
x = m|n
v = 0
for a,b in ls:
if x==x|a:
v += b
... | p03584 |
import sys
input=sys.stdin.readline
N,K=list(map(int,input().split()))
integer=[]
for i in range(N):
a,b=list(map(int,input().split()))
integer.append([a,b])
bit=[]
for i in range(0,30):
if K>>i &1==1:
bit.append(i)
ans=0
for j in range(N):
test=0
for j in range(N):
... | import sys
input=sys.stdin.readline
N,K=list(map(int,input().split()))
integer=[]
for i in range(N):
a,b=list(map(int,input().split()))
integer.append([a,b])
bit=[]
for i in range(0,30):
if K>>i &1==1:
bit.append(i)
ans=0
for j in range(N):
a,b=integer[j]
if a|K==K:
... | p03584 |
n,k = list(map(int, input().split()))
ans = 0
abl = []
for _ in range(n):
a,b = list(map(int, input().split()))
abl.append((a,b))
max_bit = 0
for i in range(31):
if k < pow(2,i):
max_bit = i
break
k_bits = [-1]*(max_bit)
for i in range(max_bit-1,-1,-1):
if k&(1<<i) > 0... | n,k = list(map(int, input().split()))
ans = 0
abl = [ tuple(map(int, input().split())) for _ in range(n) ]
kset = set()
kset.add(k)
for i in range(30):
if k&(1<<i) == 0: continue
v = 0
for j in range(i):
v += pow(2,j)
for j in range(i+1,30):
if k&(1<<j) > 0:
v +... | p03584 |
from collections import defaultdict
N, K = list(map(int, input().split()))
AB = [[int(i) for i in input().split()] for _ in range(N)]
visited = defaultdict(lambda : False)
L = set()
def dfs(x) :
if visited[x] :
return
visited[x] = True
for i in range(30) :
if x & (1 <<... | N, K = list(map(int, input().split()))
AB = [[int(i) for i in input().split()] for _ in range(N)]
ret = 0
for A, B in AB :
if A & ~K == 0 :
ret += B
for i in range(30) :
if K & (1 << i) == 0 :
continue
k = K
k ^= 1 << i
k |= (1 << i) - 1
s = 0
... | p03584 |
#!/usr/bin/python
# -*- coding: utf-8 -*-
import sys
import math
import copy
N, K = list(map(int, sys.stdin.readline().rstrip().split()))
data = []
for _ in range(N):
A, B = list(map(int, sys.stdin.readline().rstrip().split()))
# print(A)
# print(bin(A)[2:])
data.append([list(reversed(bin(A... | #!/usr/bin/python
# -*- coding: utf-8 -*-
import sys
import math
import copy
N, K = list(map(int, sys.stdin.readline().rstrip().split()))
data = []
for _ in range(N):
A, B = list(map(int, sys.stdin.readline().rstrip().split()))
data.append([A, B])
ans = 0
def lower(x, y):
if(x > y):
... | p03584 |
def issubset(a,b):
#a<<bならtrue
x=bin(a)[2:]
y=bin(b)[2:]
if a>b:
return False
for i in range(1,len(x)+1):
if (x[-i],y[-i])==("1","0"):
return False
return True
N,K=list(map(int,input().split()))
A=[0 for i in range(N)]
B=[0 for i in range(N)]
for i in ran... | def issubset(x,y):
#a<<bならtrue
if len(x)>len(y):
return False
for i in range(1,len(x)+1):
if (x[-i],y[-i])==("1","0"):
return False
return True
N,K=list(map(int,input().split()))
A=[0 for i in range(N)]
B=[0 for i in range(N)]
for i in range(N):
A[i],B[i]=list... | p03584 |
import bisect
import copy
import heapq
import math
import sys
from collections import *
from itertools import accumulate, combinations, permutations, product
from math import gcd
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
mod=pow(10,9)+7
al=[chr... | import bisect
import copy
import heapq
import math
import sys
from collections import *
from itertools import accumulate, combinations, permutations, product
from math import gcd
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
mod=pow(10,9)+7
al=[chr... | p03584 |
n,k=list(map(int,input().split()))
ab=[list(map(int,input(). split())) for _ in range(n)]
bk=list(bin(k)[2:])
if '0' not in bk:
t=k
ans=0
for a,b in ab:
if a<=t:ans+=b
print(ans)
else:
ks=[k]
for i in range(len(bk)):
if bk[i]=='1':
if i==0:
ks.append(int('1'*(len(bk)-1),2... | def main(n,k,ab):
ks=[k]
m=len(bin(k))-2
# kはm桁
kbin=bin(k)[2:]
now=0
for i in range(m):
if kbin[i]=='1' and i<m-1:
ks.append(now+pow(2,m-i-1)-1)
now+=int(kbin[i])*pow(2,m-i-1)
ans=0
for x in ks:
tmp=0
for a,b in ab:
if a|x==x:tmp+=b
ans=max(ans,tmp)
pri... | p03584 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# 110101以下の数は、以下のいずれかである
#
# 110101
# 110100 (1を一つ選んで0にする、それ以下の桁はなんでもよいので?とする)
# 1100??
# 10????
# 0?????
#
# 上の各パターンについて条件を満たすものをそれぞれ探し、maxをとる
# 各パターンでは、0になるべき桁が必ず0になるようにする
#
# 実装上は、?をすべて1で置換。orをとっても以下の数値を超えないようにする
#
# 110101
# 110011
# 101111
# 01111... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
# 動画解説を見る
#
# 110101以下の数は、以下のいずれかである
#
# 110101
# 110100 (1を一つ選んで0にする、それ以下の桁はなんでもよいので?とする)
# 1100??
# 10????
# 0?????
#
# 上の各パターンについて条件を満たすものをそれぞれ探し、maxをとる
# 各パターンでは、0になるべき桁が必ず0になるようにする
#
# 実装上は、?をすべて1で置換。orをとった結果、0の箇所に1が来ないようにする
#
# 110101
# 110011
# ... | p03584 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.