input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
sys.setrecursionlimit(10**9)
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
def shouka(s: str, pa, pb, total):
global ans
if s == "a":
total += a[pa]
if total > k:
ans = max(ans, ... | n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(n):
a.append(a[i]+A[i])
for i in range(m):
b.append(b[i]+B[i])
ptr = m
ans = 0
for i in range(n + 1):
if a[i] > k:
break
while a... | p02623 |
n,m,k = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a = [0]*(n+1)
b = [0]*(m+1)
for i in range(n):
a[i+1] = a[i] + A[i]
for i in range(m):
b[i+1] = b[i] + B[i]
ans = 0
j = m
for i in range(n+1):
if a[i] > k:
break
... | n,m,k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A = [0]*(n+1)
for i in range(n):
A[i+1] = A[i] +a[i]
B = [0]*(m+1)
for j in range(m):
B[j+1] = B[j] +b[j]
ans = 0
j = m
for i in range(n+1):
if A[i] > k:
break
... | p02623 |
import bisect
N,M,K=list(map(int,input().split()))
alist=list(map(int,input().split()))
blist=list(map(int,input().split()))
sum_alist=[0]
for i in range(N):
sum_alist.append(sum_alist[-1]+alist[i])
#print(sum_alist)
sum_blist=[0]
for i in range(M):
sum_blist.append(sum_blist[-1]+blist[i])
#print(sum... | N,M,K=list(map(int,input().split()))
alist=list(map(int,input().split()))
blist=list(map(int,input().split()))
sum_alist=[0]
for a in alist:
sum_alist.append(sum_alist[-1]+a)
sum_blist=[0]
for b in blist:
sum_blist.append(sum_blist[-1]+b)
index_b=M
answer=0
for i in range(N+1):
sum_a=sum_alist[i... | p02623 |
N, M, K = list(map(int, input().split()))
A = tuple(map(int, input().split()))
B = tuple(map(int, input().split()))
def cumsum(l):
s = 0
for v in l:
s += v
yield s
a = (0,) + tuple(cumsum(A))
b = (0,) + tuple(cumsum(B))
ans = 0
m = M
for i in range(N + 1):
if a[i] > K:
... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
def cumsum(l):
s = 0
for v in l:
s += v
yield s
a = [0] + list(cumsum(A))
b = [0] + list(cumsum(B))
ans = 0
n = N + 1
m = M
for i in range(n):
if a[i] > K:
... | p02623 |
N,M,K = list(map(int,input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
def Cum(X):
temp = 0
Cum = [0]*len(X)
for i in range(len(X)):
temp += X[i]
Cum[i] += temp
return Cum
a = Cum(A)
a.insert(0,0)
b = Cum(B)
b.insert(0,0)
na =... | N,M,K = list(map(int,input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
def Cum(X):
temp = 0
Cum = [0]*len(X)
for i in range(len(X)):
temp += X[i]
Cum[i] += temp
return Cum
a = Cum(A)
a.insert(0,0)
b = Cum(B)
b.insert(0,0)
na =... | p02623 |
n,m,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a.insert(0,0)
b.insert(0,0)
sum_a = [0]
for i in range(1,len(a)):
sum_a.append(sum_a[i-1] + a[i])
if sum_a[i] > k:
break
sum_b = [0]
for i in range(1,len(b)):
sum_b.append(sum... | n,m,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a.insert(0,0)
b.insert(0,0)
sum_a = [0]
for i in range(1,n+1):
sum_a.append(sum_a[i-1] + a[i])
sum_b = [0]
for i in range(1,m+1):
sum_b.append(sum_b[i-1] + b[i])
ans = 0
for i in range(... | p02623 |
N,M,K=list(map(int,input().split()))
A,B=[0],[0]
A+=list(map(int,input().split()))
B+=list(map(int,input().split()))
for i in range(1,N+1):
A[i]+=A[i-1]
for i in range(1,M+1):
B[i]+=B[i-1]
ans=0
for i in range(N+1):
if A[i]>K:
break
for j in range(M+1):
if A[i]+B[j]>K:
... | N,M,K=list(map(int,input().split()))
A,B=[0],[0]
A+=list(map(int,input().split()))
B+=list(map(int,input().split()))
for i in range(1,N+1):
A[i]+=A[i-1]
for i in range(1,M+1):
B[i]+=B[i-1]
ans,j=0,M
for i in range(N+1):
if A[i]>K:
break
while j>0 and A[i]+B[j]>K:
j-=1
... | p02623 |
N,M,K=list(map(int,input().split()))
A,B=[0],[0]
A+=list(map(int,input().split()))
B+=list(map(int,input().split()))
for i in range(1,N+1):
A[i]+=A[i-1]
for i in range(1,M+1):
B[i]+=B[i-1]
ans,j=0,M
for i in range(N+1):
if A[i]>K:
break
while j>0 and A[i]+B[j]>K:
j-=1
... | N,M,K=list(map(int,input().split()))
A,B=[0],[0]
A+=list(map(int,input().split()))
B+=list(map(int,input().split()))
for i in range(1,N+1):
A[i]+=A[i-1]
for i in range(1,M+1):
B[i]+=B[i-1]
ans,j=0,M
for i in range(N+1):
if A[i]>K:
break
while A[i]+B[j]>K:
j-=1
ans=m... | p02623 |
from collections import deque
n,m,k=list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a,b=[0],[0]
for i in range(n):
a.append(a[i]+A[i])
for i in range(m):
b.append(b[i]+B[i])
ans, j = 0,m
for i in range(n+1):
if a[i]>k: break
while b[j] > k-a[i]:... | from itertools import accumulate
from bisect import bisect
n,m,k=list(map(int,input().split()))
A=list(map(int,input().split()))
A=list(accumulate(A,initial=0))
B=list(map(int,input().split()))
B=list(accumulate(B))
ans = 0
for i,a in enumerate(A):
if a > k: break
ans = max(ans,i + bisect(B,k-a))
print... | p02623 |
from itertools import accumulate
def binary(N, T): # 二分探索 # N:探索要素数
l, r = -1, N + 1
while r - l > 1:
if T < b[(l + r) // 2]: # 条件式を代入
r = (l + r) // 2
else:
l = (l + r) // 2
return r - 1
n, m, k = list(map(int, input().split()))
a = [0] + list(acc... | from itertools import accumulate
def binary(N, T): # 二分探索 # N:探索要素数
l, r = -1, N
while r - l > 1:
if T < b[(l + r) // 2]: # 条件式を代入
r = (l + r) // 2
else:
l = (l + r) // 2
return r - 1
n, m, k = list(map(int, input().split()))
a = [0] + list(accumul... | p02623 |
N,M,K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sa = {0: 0}
for i, val in enumerate(A):
sa[i+1] = sa[i] + val
sb = {0: 0}
for i, val in enumerate(B):
sb[i+1] = sb[i] + val
max_num = 0
for i in range(N+1):
if(sa[i]>K):
break
... | N,M,K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sa = [0]
for i, val in enumerate(A):
sa.append(sa[i] + val)
sb = [0]
for i, val in enumerate(B):
sb.append(sb[i] + val)
max_num = 0
ind_max = M
for i in range(N+1):
if(sa[i]>K):
b... | p02623 |
N,M,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
A_cs = [0]*(len(A)+1)
for i in range(1,len(A)+1):
A_cs[i] = A_cs[i-1]+ A[i-1]
B_cs = [0]*(len(B)+1)
for i in range(1,len(B)+1):
B_cs[i] = B_cs[i-1]+ B[i-1]
total = 0
for i in range(le... | N, M, K = list(map(int, input().split()))
A = [0]+list(map(int, input().split()))
B = [0]+list(map(int, input().split()))
import itertools
A_cs = list(itertools.accumulate(A))
B_cs = list(itertools.accumulate(B))
total = 0
j = len(B)-1
for i in range(len(A_cs)):
while (j >= 0):
if A_cs[i] + B_cs... | p02623 |
n,m,k=[int(x) for x in input().rstrip().split()]
a=[int(x) for x in input().rstrip().split()]
b=[int(x) for x in input().rstrip().split()]
A=[0]
B=[0]
for i in range(n):
A.append(A[i]+a[i])
for i in range(m):
B.append(B[i]+b[i])
ans=0
j=0
for i in range(n+1):
j=0
if A[i]>k:
break
... | n,m,k=[int(x) for x in input().rstrip().split()]
a=[int(x) for x in input().rstrip().split()]
b=[int(x) for x in input().rstrip().split()]
A=[0]
B=[0]
for i in range(n):
A.append(A[i]+a[i])
for i in range(m):
B.append(B[i]+b[i])
ans=0
j=m
for i in range(n+1):
# j=m
if A[i]>k:
break
... | p02623 |
n,m,k=[int(x) for x in input().rstrip().split()]
a=[int(x) for x in input().rstrip().split()]
b=[int(x) for x in input().rstrip().split()]
A=[0]
B=[0]
for i in range(n):
A.append(A[i]+a[i])
for i in range(m):
B.append(B[i]+b[i])
ans=0
j=m
for i in range(n+1):
j=m
if A[i]>k:
break
... | n,m,k=[int(x) for x in input().rstrip().split()]
a=[int(x) for x in input().rstrip().split()]
b=[int(x) for x in input().rstrip().split()]
A=[0]
B=[0]
for i in range(n):
A.append(A[i]+a[i])
for i in range(m):
B.append(B[i]+b[i])
ans=0
j=0
for i in range(n+1):
# j=0
if A[i]>k:
break
... | p02623 |
n, m, k = input().split()
a = input().split()
b = input().split()
n = int(n)
m = int(m)
k = int(k)
a = list(map(int, a))
b = list(map(int, b))
ans = 0
temp_a = {}
temp_b = {}
for i_a in range(n+1):
if sum(a[0:i_a]) > k:
break
temp_a[i_a] = sum(a[0:i_a])
for i_b in range(m+1):
if sum(b[0:... | n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(n):
a.append(a[i] + A[i])
for i in range(m):
b.append(b[i] + B[i])
ans, j = 0, m
for i in range(n+1):
if a[i] > k:
break
while a[i] + b[j... | p02623 |
import itertools
N, M, K = list(map(int, input().split()))
A, B = [], []
A = list(map(int, input().split()))
B = list(map(int, input().split()))
max_books = 0
order_list = set(list(itertools.permutations(['A']*N + ['B']*M)))
for order in order_list:
ia, ib = 0, 0
time = 0
books = 0
for which in ord... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
def HowManyBooks(A, B):
A_sum, B_sum = [0], [0]
for i in range(N):
A_sum.append(A_sum[i] + A[i])
for i in range(M):
B_sum.append(B_sum[i] + B[i])
books = 0
for i in range(N+1):... | p02623 |
import itertools
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
answer = -float('inf')
order = list(itertools.permutations([1]*n+[0]*m))
order2 = set(order)
for o in order2:
acur, bcur = 0, 0
books = 0
time = 0
for i in o:
book... | import itertools
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
aa = [sum(a[0:i]) for i in range(n+1)]
bb = [sum(b[0:i]) for i in range(m+1)]
ab = [list(range(n+1)), list(range(m+1))]
candidate = list(itertools.product(*ab))
answer = -1
for can... | p02623 |
n,m,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
la = [0]
lb = [0]
mx = 0
for i in range(n):
if la[i] + a[i] > k:
break
la.append(la[i]+a[i])
for j in range(m):
if lb[j] + b[j] > k:
break
lb.append(lb[j]+b[j])
for... | n,m,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
la = [0]
lb = [0]
mx = 0
for i in range(n):
if la[i] + a[i] > k:
break
la.append(la[i]+a[i])
for j in range(m):
if lb[j] + b[j] > k:
break
lb.append(lb[j]+b[j])
now... | p02623 |
n,m,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
for i in range(1,n):
a[i] += a[i-1]
for i in range(1,m):
b[i] += b[i-1]
a = [0]+a
b = [0]+b
ans = 0
ALL = 0
from bisect import bisect
for i in range(n+1):
ALL = a[i]
if ALL > k:
... | n,m,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
for i in range(1,n):
a[i] += a[i-1]
for i in range(1,m):
b[i] += b[i-1]
a = [0]+a
b = [0]+b
ans = 0
ALL = 0
j = m
for i in range(n+1):
if a[i] > k:
continue
else:
... | p02623 |
n,m,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
for i in range(1,n):
a[i] += a[i-1]
for i in range(1,m):
b[i] += b[i-1]
a = [0]+a
b = [0]+b
ans = 0
ALL = 0
j = m
for i in range(n+1):
if a[i] > k:
continue
else:
... | a,b,k = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
from itertools import accumulate
A = list(accumulate(A))
B = list(accumulate(B))
A = [0] + A
B = [0] + B
ans = 0
num = b
for i in range(a+1):
if A[i] > k:
continue
while True :... | p02623 |
n, m, k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
total = 0
count = 0
flag = n-1
for i in range(n):
total += a[i]
if total > k:
total -= a[i]
flag = i-1
break
count += 1
ans = count
for i in range(m):
i... | n, m, k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
total = 0
count = 0
flag = n-1
for i in range(n):
total += a[i]
if total > k:
total -= a[i]
flag = i-1
break
count += 1
ans = count
for i in range(m):
i... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]*(N+1)
b = [0]*(M+1)
#累積和の計算
for i in range(1, N+1):
a[i] = a[i-1] + A[i-1]
for j in range(1, M+1):
b[j] = b[j-1] + B[j-1]
ans = 0
j = M
for i in range(N+1):
left = 0
... | import bisect
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]*(N+1)
b = [0]*(M+1)
#累積和の計算
for i in range(1, N+1):
a[i] = a[i-1] + A[i-1]
for j in range(1, M+1):
b[j] = b[j-1] + B[j-1]
ans = 0
# j = M
for i in range(N+1):
... | p02623 |
from itertools import accumulate
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_acc = [0] + list(accumulate(a))
b_acc = [0] + list((accumulate(b)))
ans = 0
bn = m
for an in range(n + 1):
rem = k - a_acc[an]
if rem < 0:
... | from itertools import accumulate
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_acc = [0] + list(accumulate(a)) # aを0冊読む=1冊も読まない場合があるので
b_acc = [0] + list(accumulate(b)) # 今度は[0]が必要です
ans = 0
for an in range(n + 1):
rem = k - a_acc... | p02623 |
from itertools import accumulate
import bisect
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_acc = [0] + list(accumulate(a)) # aを0冊読む=1冊も読まない場合があるので、[0]を先頭に追加します
b_acc = list(accumulate(b)) # bisect_rightでは、x以下の要素がいくつあるか？を求めるので、こちらに0は入れませ... | from itertools import accumulate
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_acc = [0] + list(accumulate(a))
b_acc = [0] + list((accumulate(b)))
ans = 0
bn = m
for an in range(n + 1):
rem = k - a_acc[an]
if rem < 0:
... | p02623 |
N,M,K=list(map(int,input().split()))
a=input().split()
A=[int(c) for c in a]
b=input().split()
B=[int(c) for c in b]
answers=[0]
As=[0]
Bs=[0]
wholeA=0
wholeB=0
for a in range(N):
wholeA+=A[a]
As.append(wholeA)
for b in range(M):
wholeB+=B[b]
Bs.append(wholeB)
for a in range(N+1):
... | N,M,K=list(map(int,input().split()))
a=input().split()
A=[int(c) for c in a]
b=input().split()
B=[int(c) for c in b]
answers=[0]
As=[0]
Bs=[0]
wholeA=0
wholeB=0
bs = [M]
for a in range(N):
wholeA+=A[a]
As.append(wholeA)
for b in range(M):
wholeB+=B[b]
Bs.append(wholeB)
for a in range(N+... | p02623 |
N,M,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
S = 0
ans = 0
for i in range(M):
S += B[i]
if S > K:
b = i - 1
S -= B[i]
break
else:
ans += 1
if i==M-1:
b = M-1
if b==0:
ans = 0
S = 0
for a in A:
if... | N,M,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
S_A = [0] * (N + 1)
S_B = [0] * (M + 1)
for i in range(N):
S_A[i+1] = S_A[i] + A[i]
for i in range(M):
S_B[i+1] = S_B[i] + B[i]
ans = 0
a = 0
for i in range(M, -1, -1):
s = S_B[i]
if... | p02623 |
def _integral(A):
result = []
sum_value = 0
result.append(sum_value)
for i in range(len(A)):
sum_value += A[i]
result.append(sum_value)
return result
def _main(N, M, K, A, B):
integral_a = _integral(A)
integral_b = _integral(B)
top_count = 0
for a_inde... | def _integral(A):
result = []
sum_value = 0
result.append(sum_value)
for i in range(len(A)):
sum_value += A[i]
result.append(sum_value)
return result
def _main(N, M, K, A, B):
integral_a = _integral(A)
integral_b = _integral(B)
top_count = 0
b_max = le... | p02623 |
import bisect
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
asum, bsum = [0], [0]
for i in range(n):
if k < a[i] + asum[i]:
break
asum.append(a[i] + asum[i])
for i in range(m):
if k < b[i] + bsum[i]:
break
bsum.append(b[i]... | # 尺取法ver
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
asum, bsum = [0], [0]
for i in range(n):
if k < a[i] + asum[i]:
break
asum.append(a[i] + asum[i])
for i in range(m):
if k < b[i] + bsum[i]:
break
bsum.append(b[i] + ... | p02623 |
n,m,k=list(map(int,input().split()))
l=list(map(int,input().split()))
ll=list(map(int,input().split()))
l_ans=[]
for i in range(m+1):
l_ans.append([0]*(n+1))
ct=0
for i in range(m+1):
we=i+n
for j in range(n+1):
if i==0 and j==0:
l_ans[i][j]=0
elif i==0:
l_ans[i][j]=l_ans[i][j... | n,m,k=list(map(int,input().split()))
l=list(map(int,input().split()))
ll=list(map(int,input().split()))
l_l=[0]
for i in range(1,m+1):
l_l.append(l_l[i-1]+ll[i-1])
ans=0
for i in range(m+1):
if l_l[i]>k:
break
sm=0
j=0
while j<n and l_l[i]+sm+l[j]<=k:
sm+=l[j]
j+=1
ans=max... | p02623 |
n ,m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A = [0]
B = [0]
for i in range(n):
A.append(A[i] + a[i])
for i in range(m):
B.append(B[i] + b[i])
ans, j = 0, m
for i in range(n+1):
if A[i] > k:
break
else:
... | n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A = [0]
B = [0]
for i in range(n):
A.append(A[i] + a[i])
for i in range(m):
B.append(B[i] + b[i])
ans = 0
j = m
for i in range(n+1):
if A[i] > k:
break
else:
... | p02623 |
from sys import stdin
from bisect import bisect
input = stdin.readline
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
for i in range(1, N):
A[i] += A[i - 1]
for i in range(1, M):
B[i] += B[i - 1]
ans = 0
for i, a in enumerat... | from sys import stdin
input = stdin.readline
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sumA = [0]
sumB = [0]
for i in range(N):
sumA.append(sumA[i] + A[i])
for i in range(M):
sumB.append(sumB[i] + B[i])
ans = 0
t = M... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
nmax = 0
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
ans = 0
for i in range(N + 1):
if a[i] > K:
break
fo... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
nmax = 0
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
ans = 0
j = M
for i in range(N + 1):
if a[i] > K:
break
... | p02623 |
import bisect
n, m, k = list(map(int, input().split()))
INF = 10**18
A = list(map(int, input().split()))
B = list(map(int, input().split()))
cum_a = [0] * (n+1)
cum_b = [0] * (m+1)
for i in range(n):
cum_a[i+1] = cum_a[i] + A[i]
for i in range(m):
cum_b[i+1] = cum_b[i] + B[i]
INF = 10**18
ans = -I... | import bisect
n, m, k = list(map(int, input().split()))
INF = 10**18
A = list(map(int, input().split()))
B = list(map(int, input().split()))
cum_a = [0] * (n+1)
cum_b = [0] * (m+1)
for i in range(n):
cum_a[i+1] = cum_a[i] + A[i]
for i in range(m):
cum_b[i+1] = cum_b[i] + B[i]
INF = 10**18
ans = -I... | p02623 |
n,m,k,*x=list(map(int,open(0).read().split()))
s=sum(x[:n])
z=i=j=n
while~i:
while j<n+m and s+x[j]<=k:s+=x[j];j+=1
if s<=k:z=max(z,i+j)
i-=1
s-=x[i]
print((z-n)) | n,m,k,*x=list(map(int,open(0).read().split()))
s=sum(x[:n])
z=i=j=n
x+=k,
while~i:
while s+x[j]<=k:s+=x[j];j+=1
if s<=k:z=max(z,i+j)
i-=1
s-=x[i]
print((z-n)) | p02623 |
import itertools
import sys
input = sys.stdin.readline
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
a_cum = [0] + list(itertools.accumulate(a))
b_cum = [0] + list(itertools.accumulate(b))
for x in range(len(a_cum)):
if a_cu... | import itertools
import sys
input = sys.stdin.readline
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
a_cum = [0] + list(itertools.accumulate(a))
b_cum = [0] + list(itertools.accumulate(b))
y = m # len(b_cum) - 1
for x in rang... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
n_a = 0
n_b = 0
t_a = 0
t_b = 0
for i in range(N):
if sum(A[0:i + 1]) <= K:
n_a += 1
t_a += A[i]
continue
else:
break
# print(n_a)
# print(t_a)
fo... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# A,Bそれぞれの累積和を作る
# 初期値は0冊目まで読んだときの値（ここでは0）を入れておく
a = [0]
b = [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
# 読める最大の冊数
ans = 0
# Bは全て（=M冊目まで... | p02623 |
import sys
sys.setrecursionlimit(10 ** 6)
n,m,k = list(map(int,input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.append(1)
b.append(1)
ans = 0
def dfs(time,count,i,j):
global ans,n,m,k,a,b
if (i == n or time + a[i] > k) and (j == m or time + b[j] > k):
... | n,m,k=list(map(int,input().split()))
arr1=list(map(int,input().split()))
arr2=list(map(int,input().split()))
acum1=[0]
for i in range(n): #累積和ai,bjを求める
acum1.append(acum1[-1]+arr1[i])
acum2=[0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans=0
j=m
for i in range(n+1):
if acum1[i]>k: #ai>Kであれば、どのよう... | p02623 |
import copy
L = list(map(int, input().split())) # N, M, K=map(int,input().split())
N=L[0]
M=L[1]
K=L[2]
A = list(map(int, input().split()))
B = list(map(int, input().split()))
P=[(0,0)]
R=[0]
c=0
while c!=N+M or Q!=[]:
Q=[]
S=[]
c=c+1
n=len(P)
for i in range(n):
a=P[i][0]
... | N, M, K=list(map(int,input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
LA = [0]
LB = [0]
for i in range(N):
C=LA[i]+A[i]
if C>K:
N=i
break
else:
LA.append(C)
for j in range(M):
C=LB[j]+B[j]
if C>K:
M=j
br... | p02623 |
import math
def facts(n):
ans = []
for i in range(1, int(math.sqrt(n)+1)):
if(n%i==0):
ans.append(i)
ans.append(n//i)
ans = sorted(list(dict.fromkeys(ans)))
if(ans[-1]==n):
ans = ans[:-1]
return ans
n, m,k = list(map(int, input().split()))
a ... | import math
def facts(n):
ans = []
for i in range(1, int(math.sqrt(n)+1)):
if(n%i==0):
ans.append(i)
ans.append(n//i)
ans = sorted(list(dict.fromkeys(ans)))
if(ans[-1]==n):
ans = ans[:-1]
return ans
n, m,k = list(map(int, input().split()))
a ... | p02623 |
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
result=0
for i in range(len(a)+1):
for j in range(len(b)+1):
if sum(a[:i]) + sum(b[:j]) <= k:
if result < i+j:
result=i+j
print(result) | import sys
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_=[0]
b_=[0]
tmp = 0
for i in a:
tmp += i
a_.append(tmp)
tmp = 0
for i in b:
tmp += i
b_.append(tmp)
ans=0
j = m
for i in range(n+1):
if a_[i] > k:
... | p02623 |
import sys
sys.setrecursionlimit(10**6)
#a = int(input())
#b = list(map(int, input().split()))
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
#s = input()
#s,t = input().split()
#a = [int(input()) for _ in range(n)]
#
#readline = sys.stdin.... | import sys
sys.setrecursionlimit(10**6)
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
ans, j = 0, M
for i in range(N + 1):
... | p02623 |
N, M, K = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
arui = [0] * (N + 1)
brui = [0] * (M + 1)
for i in range(N):
arui[i + 1] = a[i] + arui[i]
for i in range(M):
brui[i + 1] = b[i] + brui[i]
ans = 0
for i in range(N + 1):
if arui[i] >... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
ans, j = 0, M
for i in range(N + 1):
if a[i] > K:
break
while b[j] >... | p02623 |
N, M, K = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
arui = [0]
brui = [0]
for i in range(N):
arui.append(a[i] + arui[i])
for i in range(M):
brui.append(b[i] + brui[i])
ans = 0
for i in range(N + 1):
if arui[i] > K:
break
... | N, M, K = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
arui = [0] * (N + 1)
brui = [0] * (M + 1)
for i in range(N):
arui[i + 1] = a[i] + arui[i]
for i in range(M):
brui[i + 1] = b[i] + brui[i]
ans, j = 0, M
for i in range(N + 1):
if a... | p02623 |
import sys
from collections import deque
def _tsundoku(n, m, k, a, b):
# print(f'{a=}')
# print(f'{b=}')
a_len = len(a)
b_len = len(b)
ans = [0, 0, 0]
L = []
d = deque()
d.append((0, 0, 0))
while d:
# print(d, L)
a_readed, b_readed, t = d.popleft(... | import sys
from itertools import accumulate
def _tsundoku(n, m, k, a, b):
a_temp = tuple(accumulate(a, initial=0))
b_temp = tuple(accumulate(b, initial=0))
ans = 0
b_index = m
for a_index in range(n + 1):
if a_temp[a_index] > k:
break
while a_temp[a_index]... | p02623 |
def main():
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
total_T_in_A = [0] * (N+1)
total_T_in_A[1] = A[0]
total_T_in_B = [0] * M
total_T_in_B[0] = B[0]
for i in range(2, N+1):
total_T_in_A[i] = tot... | def main():
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
total_T_in_A = [0] * (N+1)
total_T_in_A[1] = A[0]
total_T_in_B = [0] * M
total_T_in_B[0] = B[0]
for i in range(1, N+1):
total_T_in_A[i] = tot... | p02623 |
import sys
from collections import deque
import copy
sys.setrecursionlimit(2147483647)
input = sys.stdin.readline
if __name__ == '__main__':
n,m,k=list(map(int,input().strip("\n").split()))
A=deque()
mapA=list(map(int,input().strip("\n").split()))
for a in mapA:
A.append(a)
B=deque()
mapB=... | import sys
from collections import deque
import copy
sys.setrecursionlimit(2147483647)
input = sys.stdin.readline
if __name__ == '__main__':
n,m,k=list(map(int,input().strip("\n").split()))
A=list(map(int,input().strip("\n").split()))
B=list(map(int,input().strip("\n").split()))
t=sum(B)
j=m
an... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sumA, sumB = [0], [0]
sa, sb = 0, 0
for a in A:
sa += a
sumA.append(sa)
for b in B:
sb += b
sumB.append(sb)
n_max = 0
for na in range(N+1):
for nb in range(M+1):
... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sumA, sumB = [0], [0]
sa, sb = 0, 0
for a in A:
sa += a
sumA.append(sa)
for b in B:
sb += b
sumB.append(sb)
n_max = 0
nb_max = M
for na in range(0, N+1):
for nb in ra... | p02623 |
from bisect import bisect
N, M, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
*B, = list(map(int, input().split()))
a = [0] * (N+1)
b = [0] * (M+1)
for i in range(N):
a[i+1] = a[i] + A[i]
for i in range(M):
b[i+1] = b[i] + B[i]
ans = 0
for i in range(N+1):
tmp = K - a... | N, M, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
*B, = list(map(int, input().split()))
a = [0] * (N+1)
b = [0] * (M+1)
for i in range(N):
a[i+1] = a[i] + A[i]
for i in range(M):
b[i+1] = b[i] + B[i]
ans = 0
j = M
for i in range(N+1):
if a[i] > K:
break
... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ruiA = [0]
ruiB = [0]
for i in range(N):
ruiA.append(ruiA[-1] + A[i])
for i in range(M):
ruiB.append(ruiB[-1] + B[i])
MAX = 0
i = 0
for j in range(M, -1, -1):
if ruiA[i] + ruiB... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ruiA = [0]
ruiB = [0]
for i in range(N):
ruiA.append(ruiA[-1] + A[i])
for i in range(M):
ruiB.append(ruiB[-1] + B[i])
MAX = 0
j = M
for i in range(N+1):
if ruiA[i] > K:
... | p02623 |
N,M,K = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
A = [0]
B = [0]
A.extend(a)
B.extend(b)
time = sum(A)
ai = len(A)-1
bi = 0
con = 0
flg = None
count = 0
if len(a) == 1 or len(b)==1:
time = 0
while True:
if len(a) == 0 and len(b... | N,M,K = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
A = [0]
B = [0]
A.extend(a)
B.extend(b)
time = sum(A)
ai = len(A)-1
bi = 0
con = 0
flg = None
count = 0
while True:
#print("---------")
#print(str(ai)+":"+str(bi))
if tim... | p02623 |
import sys
N,M,K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
nmax=0
Asum=list()
Asum.append(0)
Bsum=list()
Bsum.append(0)
imax_a = N
for i in range(N):
s = Asum[i]+A[i]
Asum.append(s)
if s > K:
imax_a = i+1
break
... | import sys
N,M,K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
nmax=0
Asum=list()
Asum.append(0)
Bsum=list()
Bsum.append(0)
imax_a = N
for i in range(N):
s = Asum[i]+A[i]
Asum.append(s)
if s > K:
imax_a = i+1
break
... | p02623 |
n,m,k=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
a,b=[0],[0]
for i in range(n):
a.append(a[i]+A[i])
for i in range(m):
b.append(b[i]+B[i])
ans=0
book=0
for i in range(n+1):
if a[i]>k:
break
for j in range(m+1):
if a[i]+b[j]<=k:
b... | n,m,k=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
a,b=[0],[0]
for i in range(n):
a.append(a[i]+A[i])
for i in range(m):
b.append(b[i]+B[i])
ans=0
for i in range(n+1):
if a[i]>k:
break
for j in range(m,-1,-1):
if a[i]+b[j]<=k:
ans=m... | p02623 |
import sys
import itertools as it
input = sys.stdin.readline
N, M, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
AS = list(it.accumulate(A))
BS = list(it.accumulate(B))
AS.insert(0,0)
BS.insert(0,0)
max = 0
for i in range(N+1):
a = ... | import sys
import itertools as it
input = sys.stdin.readline
N, M, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
AS = list(it.accumulate(A))
BS = list(it.accumulate(B))
AS.insert(0,0)
BS.insert(0,0)
max = 0
for i in range(N+1):
a = ... | p02623 |
import sys
import itertools as it
input = sys.stdin.readline
N, M, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
AS = list(it.accumulate(A))
BS = list(it.accumulate(B))
AS.insert(0,0)
BS.insert(0,0)
max = 0
for i in range(N+1):
a = ... | import sys
import itertools as it
input = sys.stdin.readline
N, M, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
AS = list(it.accumulate(A))
BS = list(it.accumulate(B))
AS.insert(0,0)
BS.insert(0,0)
max = 0
j = M
for i in range(N+1):
... | p02623 |
N, M, K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
Asum = []
Bsum = []
a = 0
b = 0
for i in range(N):
a += A[i]
Asum.append(a)
for i in range(M):
b += B[i]
Bsum.append(b)
Asum.append(0)
Bsum.append(0)
res = 0
for i in range(-1,N... | N, M, K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
Asum = [0]
Bsum = [0]
a = 0
b = 0
for i in range(N):
a += A[i]
Asum.append(a)
for i in range(M):
b += B[i]
Bsum.append(b)
Asum.append(0)
Bsum.append(0)
res, j = 0, M
for i in ra... | p02623 |
n,m,k = list(map(int, input().split()))
a_li = list(map(int, input().split()))
b_li = list(map(int, input().split()))
a_li = [0] + a_li
b_li = [0] + b_li
time = 0
ans = 0
a = 0
temp = 0
a_wa = [0] * (n+10)
b_wa = [0] * (m+10)
s = 0
for i in range(n+1):
s += a_li[i]
a_wa[i] = s
s = 0
fo... | n,m,k = list(map(int, input().split()))
a_li = list(map(int, input().split()))
b_li = list(map(int, input().split()))
a_li = [0] + a_li
b_li = [0] + b_li
time = 0
ans = 0
a = 0
temp = 0
a_wa = [0] * (n+10)
b_wa = [0] * (m+10)
s = 0
for i in range(n+1):
s += a_li[i]
a_wa[i] = s
s = 0
fo... | p02623 |
from itertools import accumulate
from bisect import bisect_left
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = list(accumulate(A))
b = list(accumulate(B))
result = 0
j = bisect_left(b, K)
if j == M:
result = M
elif b[j] == K:
... | from itertools import accumulate
from bisect import bisect_left
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0] + list(accumulate(A))
b = [0] + list(accumulate(B))
result = 0
for i in range(N + 1):
t = K - a[i]
if t < 0:
... | p02623 |
from itertools import accumulate
from bisect import bisect_left
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0] + list(accumulate(A))
b = [0] + list(accumulate(B))
result = 0
for i in range(N + 1):
t = K - a[i]
if t < 0:
... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
b_sum = 0
for i in range(M):
b_sum += B[i]
if b_sum > K:
b_sum -= B[i]
j = i - 1
break
else:
j = M - 1
result = j + 1
a_sum = 0
for i in range(N):
... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
b_sum = 0
for i in range(M):
b_sum += B[i]
if b_sum > K:
b_sum -= B[i]
j = i - 1
break
else:
j = M - 1
result = j + 1
a_sum = 0
for i in range(N):
... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
b_sum = sum(B)
for i in range(M - 1, -1, -1):
if b_sum <= K:
j = i
break
b_sum -= B[i]
else:
j = -1
result = j + 1
a_sum = 0
for i in range(N):
a_sum += A[i... | p02623 |
from itertools import accumulate
import bisect
n,m,k=list(map(int,input().split()))
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
A=list(accumulate(a))
B=list(accumulate(b))
ans = max(bisect.bisect_right(B,k),bisect.bisect_right(A,k))
for i in range(len(a)):
r = (k-A[i])
... | from itertools import accumulate
import bisect
n,m,k=list(map(int,input().split()))
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
A=list(accumulate(a))
B=list(accumulate(b))
ans=bisect.bisect_right(B,k)
for i in range(len(a)):
r = (k-A[i])
if r<0:
break
#print... | p02623 |
n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
b2=[]
b2.append(0)
for i in range(1,m+1):
b2.append(b2[i-1]+b[i-1])
a.insert(0,0)
cnt=0
a_sum=0
for i in range(n+1):
j=m
a_sum+=a[i]
while True:
if k>=a_sum+b2[j]:
cnt=max(cnt,i+j)
... | n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
b2=[]
b2.append(0)
for i in range(1,m+1):
b2.append(b2[i-1]+b[i-1])
a.insert(0,0)
cnt=0
a_sum=0
for i in range(n+1):
j=m
a_sum+=a[i]
while True:
if k>=a_sum+b2[j]:
cnt=max(cnt,i+j)
... | p02623 |
import sys
sys.setrecursionlimit(4100000)
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans_cand = []
def dfs(a_i, b_i, ans, time):
if time == K:
ans_cand.append(ans)
return 0
if time > K:
ans_cand.app... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
ans = 0
j = M
for i in range(N + 1):
if a[i] > K:
break
while b[j... | p02623 |
from sys import stdin
def main():
n, m, k = [int(x) for x in stdin.readline().rstrip().split()]
pileda = 0
a = [0]
for x in stdin.readline().rstrip().split():
x = int(x)
pileda += x
a.append(pileda)
piledb = 0
b = [0]
for x in stdin.readline().rst... | from sys import stdin
def main():
n, m, k = [int(x) for x in stdin.readline().rstrip().split()]
pileda = 0
a = [0]
for x in stdin.readline().rstrip().split():
x = int(x)
pileda += x
a.append(pileda)
piledb = 0
b = [0]
for x in stdin.readline().rst... | p02623 |
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
tmp = 0
aa = [0]*(n+1)
for i in range(n):
tmp += a[i]
aa[i+1] = tmp
tmp = 0
bb = [0]*(m+1)
for i in range(m):
tmp += b[i]
bb[i+1] = tmp
j = m
ans = 0
for i in range(n+1)... | n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
aa = [0]*(n+1)
for i in range(n):
aa[i+1] = aa[i] + a[i]
bb = [0]*(m+1)
for i in range(m):
bb[i+1] = bb[i] + b[i]
j = m
ans = 0
for i in range(n+1):
if aa[i] > k:
brea... | p02623 |
from collections import deque
def resolve():
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
read = deque()
w = 0
if sum(A) + sum(B) <= K:
print((len(A) + len(B)))
return
while w <= K:
... | def resolve():
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 10 ** 10
t = 0
for i in range(M):
t += B[i]
j = M
ans = 0
for i in range(N+1):
while j > 0 and t > K:
j -... | p02623 |
#import sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math
from collections import deque
import itertools
import heapq
#import bisect
from fractions import Fraction
import copy
from functools import lru_cache
from collections import defaultdict
import pprint
#oo=list("ABCDEFGHIJ... | #import sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math
from collections import deque
import itertools
import heapq
#import bisect
from fractions import Fraction
import copy
from functools import lru_cache
from collections import defaultdict
import pprint
#oo=list("ABCDEFGHIJ... | p02623 |
N, M, K = [int(x) for x in input().split(' ')]
A = [int(x) for x in input().split(' ')]
B = [int(x) for x in input().split(' ')]
# N, M, K = [int(x) for x in [2e3, 2e3, 1e9]]
# A = [int(x) for x in range(N)]
# B = [int(x) for x in range(M)]
stack = [[0, 0, 0, 0]]
ans = 0
while len(stack):
s = stack[-1]
... | N, M, K = [int(x) for x in input().split(' ')]
A = [int(x) for x in input().split(' ')]
B = [int(x) for x in input().split(' ')]
# N, M, K = [int(x) for x in [2e3, 2e3, 1e9]]
# A = [int(x) for x in range(N)]
# B = [int(x) for x in range(M)]
A_deep = 0
B_deep = 0
time = 0
while A_deep < N:
if K >= time +... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
mmax = 0
pre = False
num = 0
ans = 0
ans2 = 0
for i in range(N+1):
if i == 0:
ans = 0
else:
ans += A[i-1]
if ans > K:
break
for j in range(M+1):
if j == 0:
a... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]
b = [0]
for i in range(N):
a.append(a[i]+A[i])
for i in range(M):
b.append(b[i]+B[i])
ans, j = 0, M
for i in range(N+1):
if a[i] > K:
break
while b[j] > K - a[i]:
... | p02623 |
N,M,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
time = 0
count = 0
if(min(min(A),min(B))>K):
print((0))
exit()
while time<=K:
if(len(A)!=0 and len(B)!=0):
if(A[0]<B[0]):
time+= A[0]
A.pop(0)
... | N,M,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
A_sum = [0]
B_sum = [0]
A_sum.extend(A)
B_sum.extend(B)
for i in range(1,N+1):
A_sum[i]+=A_sum[i-1]
for i in range(1,M+1):
B_sum[i]+=B_sum[i-1]
ans,j=0,M
for i in range(N+1):
if A_sum[i]... | p02623 |
n, m, k = list(map(int, input().split()))
A = tuple(map(int, input().split()))
B = tuple(map(int, input().split()))
from itertools import accumulate
AS = [0] + list(accumulate(A))
BS = [0] + list(accumulate(B))
ans = 0
for i in range(n+1):
if AS[i] > k:
break
for j in range(0, m+1):
... | n, m, k = list(map(int, input().split()))
A = tuple(map(int, input().split()))
B = tuple(map(int, input().split()))
from itertools import accumulate
AS = [0] + list(accumulate(A))
BS = [0] + list(accumulate(B))
ans = 0
j = m
for i in range(n+1):
if AS[i] > k:
break
while AS[i] + BS[j] > k... | p02623 |
N, M, K = list(map(int, input().split()))
A = [0] + list(map(int, input().split()))
B = [0] + list(map(int, input().split()))
for i in range(1, N+1):
A[i] += A[i-1]
for i in range(1, M+1):
B[i] += B[i-1]
ans = 0
for a_index in range(N+1):
left = K - A[a_index]
if left < 0: continue
... | N, M, K = list(map(int, input().split()))
A = [0] + list(map(int, input().split()))
B = [0] + list(map(int, input().split()))
for i in range(1, N+1):
A[i] += A[i-1]
for i in range(1, M+1):
B[i] += B[i-1]
ans = 0
b_index = M
for a_index in range(N+1):
left = K - A[a_index]
if left < 0:... | p02623 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)
from functools import lru_cache
INF = 10**9 + 1
@lru_cache(None)
def get_max(A,B,rest,cur):
if len(A) > 0:
a = A[0]
else:
a = INF
if len(B) > 0:
b = B[0]
else:
b = INF
if rest < a a... | import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def main():
N,M,K = [int(i) for i in input().strip().split()]
A = [int(i) for i in input().strip().split()]
B = [int(i) for i in input().strip().split()]
pre_A = [0] * (N + 1)
pre_B = [0] * (M + 1)
for i in ra... | p02623 |
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def main():
N,M,K = [int(i) for i in input().strip().split()]
A = [int(i) for i in input().strip().split()]
B = [int(i) for i in input().strip().split()]
pre_A = [0] * (N + 1)
pre_B = [0] * (M + 1)
for i in ra... | import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def main():
N,M,K = [int(i) for i in input().strip().split()]
A = [int(i) for i in input().strip().split()]
B = [int(i) for i in input().strip().split()]
pre_A = [0] * (N + 1)
pre_B = [0] * (M + 1)
for i in ra... | p02623 |
na,nb,k = list(map(int, input().split()))
ta = list(map(int, input().split()))
tb = list(map(int, input().split()))
def get_bcnt( usek,tb=tb ):
tb_sum = [ sum(tb[:i]) + tt for i, tt in enumerate(tb)]
tb_sum_tf = [ i <= usek for i in tb_sum]
if False in tb_sum_tf:
return tb_sum_tf.in... | na,nb,k = list(map(int, input().split()))
ta = list(map(int, input().split()))
tb = list(map(int, input().split()))
a = [0]
for i in range(na):
a.append( a[i] + ta[i] )
b = [0]
for i in range(nb):
b.append( b[i] + tb[i] )
ans, j=0, nb
for i in range(na + 1):
if a[i] > k:
break
while True:
... | p02623 |
import sys
#import numpy as np
#from collections import defaultdict
import math
#from collections import deque
#input = sys.stdin.readline
#import numpy as n
import bisect
def main():
N,M,K= list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int, input().sp... | import sys
#import numpy as np
#from collections import defaultdict
import math
#from collections import deque
#input = sys.stdin.readline
#import numpy as n
import bisect
def main():
N,M,K= list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int, input().sp... | p02623 |
N, M, K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
a, b=[0], [0]
for i in range(N):
a.append(a[i]+A[i])
for i in range(M):
b.append(b[i]+B[i])
ans, j=0, M
for i in range(N+1):
if a[i]>K:
break
while b[j]>K-a[i]:
j-=1
ans=m... | N, M, K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
a, b=[0], [0]
for i in range(N):
a.append(a[i]+A[i])
for i in range(M):
b.append(b[i]+B[i])
ans, j=0, M
for i in range(N+1):
if a[i]>K:
break
while b[j]>K-a[i]:
j-=1
ans=max... | p02623 |
# C - Tsundoku
def calc_cusum(n):
cusum = [0] * (n + 1)
arr = input().split()
for i in range(n):
cusum[i + 1] = cusum[i] + int(arr[i])
return cusum
def identify_position(i, j):
global a
global b
global k
global m
if a[i] + b[j] > k:
while j > 0:
j -= 1
... | # C - Tsundoku
def calc_cusum(n):
cusum = [0] * (n + 1)
arr = input().split()
for i in range(n):
cusum[i + 1] = cusum[i] + int(arr[i])
return cusum
def get_max_book(cusum):
global k
for i in range(len(cusum)):
if cusum[i] > k:
return i -1
return len(cusum) - 1
n,... | p02623 |
# -*- coding: utf-8 -*-
# 標準入力を取得
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# 求解処理
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for j in range(M):
b.append(b[j] + B[j])
ans, j = 0, M
for i in range(N + 1):
i... | # -*- coding: utf-8 -*-
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力
"""
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
return N, M, K, A, B
def main(N: int, M: int, K: int,... | p02623 |
n, m, k = list(map(int, input().split(' ')))
ans = 0
a_ls = [0] + list(map(int, input().split(' ')))
b_ls = [0] + list(map(int, input().split(' ')))
for i in range(1, n+1):
a_ls[i] += a_ls[i-1]
for i in range(1, m+1):
b_ls[i] += b_ls[i-1]
for a_cnt in range(0, n+1):
if a_ls[a_cnt] > k:
... | n, m, k = list(map(int, input().split(' ')))
ans = 0
a_ls = [0] + list(map(int, input().split(' ')))
b_ls = [0] + list(map(int, input().split(' ')))
for i in range(1, n+1):
a_ls[i] += a_ls[i-1]
for i in range(1, m+1):
b_ls[i] += b_ls[i-1]
b_cnt = m
for a_cnt in range(0, n+1):
if a_ls[a_cnt] ... | p02623 |
N, M, K = list(map(int, input().split(' ')))
A_ls = [0] + list(map(int, input().split(' ')))
B_ls = [0] + list(map(int, input().split(' ')))
for i in range(1, N + 1):
A_ls[i] += A_ls[i - 1]
for i in range(1, M + 1):
B_ls[i] += B_ls[i - 1]
a_cnt, b_cnt, rst = -1, -1, 0
for i in range(N + 1):
if ... | N, M, K = list(map(int, input().split(' ')))
A_ls = [0] + list(map(int, input().split(' ')))
B_ls = [0] + list(map(int, input().split(' ')))
for i in range(1, N + 1):
A_ls[i] += A_ls[i - 1]
for i in range(1, M + 1):
B_ls[i] += B_ls[i - 1]
b_cnt, rst = M, 0
for a_cnt in range(N + 1):
if A_ls[a_c... | p02623 |
N, M, K = list(map(int, input().split(' ')))
A_ls = [0] + list(map(int, input().split(' ')))
B_ls = [0] + list(map(int, input().split(' ')))
for i in range(1, N+1):
A_ls[i] += A_ls[i - 1]
for i in range(1, M+1):
B_ls[i] += B_ls[i - 1]
a_cnt, b_cnt, rst = 0, M, 0
while a_cnt < N + 1:
if A_ls[a... | N, M, K = list(map(int, input().split(' ')))
A_ls = [0] + list(map(int, input().split(' ')))
for i in range(N):
A_ls[i + 1] += A_ls[i]
B_ls = [0] + list(map(int, input().split(' ')))
for i in range(M):
B_ls[i + 1] += B_ls[i]
a_cnt, b_cnt, rst = 0, M, 0
for a_cnt in range(N + 1):
if A_ls[a_cnt] > ... | p02623 |
N, M, K = list(map(int, input().split(' ')))
A_ls = [0] + list(map(int, input().split(' ')))
for i in range(N):
A_ls[i + 1] += A_ls[i]
B_ls = [0] + list(map(int, input().split(' ')))
for i in range(M):
B_ls[i + 1] += B_ls[i]
a_cnt, b_cnt, rst = 0, M, 0
for a_cnt in range(N + 1):
if A_ls[a_cnt] > ... | N, M, K = list(map(int, input().split(' ')))
A_ls = [0] + list(map(int, input().split(' ')))
for i in range(N):
A_ls[i + 1] += A_ls[i]
B_ls = [0] + list(map(int, input().split(' ')))
for i in range(M):
B_ls[i + 1] += B_ls[i]
a_cnt, b_cnt, rst = 0, M, 0
for a_cnt in range(N + 1):
if A_ls[a_cnt] > ... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [False]*N
b = [False]*M
ans = 0
now = 0
bf = 0
for i in range(N):
if now + A[i] > K:
break
now += A[i]
ans += 1
a[i] = True
for i in range(M):
if now +... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [False]*N
b = [False]*M
ans = 0
now = 0
bf = 0
for i in range(N):
if now + A[i] > K:
break
now += A[i]
ans += 1
a[i] = True
for i in range(M):
if now +... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(1, N):
A[i] = A[i - 1] + A[i]
if A[i] > K:
A = A[:i]
break
A = [0] + A
for i in range(1, M):
B[i] = B[i - 1] + B[i]
if B[i] > K:
... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(1, N):
A[i] = A[i - 1] + A[i]
if A[i] > K:
A = A[:i]
break
A = [0] + A
A = A[::-1]
for i in range(1, M):
B[i] = B[i - 1] + B[i]
if B[i... | p02623 |
n,m,k=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
a=[sum(A[:i+1]) for i in range(n)]
b=[sum(B[:j+1]) for j in range(m)]
i=n-1
j=m-1
x=0
while i>=0:
if a[i]>k:
i-=1
continue
while j>=0:
if b[j]<=k-a[i]:
break
j-=1
x=max(x,i+... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
ans, j = 0, M
for i in range(N + 1):
if a[i] > K:
break
while b[j] > K - a[i]:
j -=... | p02623 |
N, M, K = list(map(int, input().split()))
a = [0] + list(map(int, input().split()))
b = [0] + list(map(int, input().split()))
for i in range(1, N+1):
a[i] = a[i-1] + a[i]
for i in range(1, M+1):
b[i] = b[i-1] + b[i]
cnt = 0
b_idx = M
for i in range(N+1):
if a[i] > K:
break
for j ... | N, M, K = list(map(int, input().split()))
a = [0] + list(map(int, input().split()))
b = [0] + list(map(int, input().split()))
for i in range(1, N+1):
a[i] = a[i-1] + a[i]
for i in range(1, M+1):
b[i] = b[i-1] + b[i]
cnt = 0
b_idx = M
for i in range(N+1):
if a[i] > K:
break
for j ... | p02623 |
import sys
input = sys.stdin.readline
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
res = 0
a, b = [0], [0]
for i in range(n):
a.append(a[i]+A[i])
for i in range(m):
b.append(b[i]+B[i])
for i in range(n+1):
j = m
if a... | import sys
input = sys.stdin.readline
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
res = 0
a, b = [0], [0]
for i in range(n):
a.append(a[i]+A[i])
for i in range(m):
b.append(b[i]+B[i])
j = m
for i in range(n+1):
if a[i... | p02623 |
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]
b = [0]
for i in range(n):
a.append(a[i] + A[i])
for i in range(m):
b.append(b[i] + B[i])
ans = 0
for i in range(n+1):
if a[i] > k:
break
for j in range(m+1):
... | n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]
b = [0]
for i in range(n):
a.append(a[i] + A[i])
for i in range(m):
b.append(b[i] + B[i])
ans = 0
for i in range(n + 1):
if a[i] > k:
break
while a[i] + b[m... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]
for i in range(N):
a.append(a[i]+A[i])
b = [0]
for i in range(M):
b.append(b[i]+B[i])
ans = 0
for i in range(N+1):
if a[i] > K: break
for j in range(M+1):
if... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i]+A[i])
for i in range(M):
b.append(b[i]+B[i])
ans, j = 0, M
for i in range(N+1):
if a[i] > K: break
while a[i] + b[j] > K:
... | p02623 |
# coding: utf-8
# Your code here!
from itertools import accumulate
#import numpy as np
N, M, K = list(map(int, input().split()))
A=list(map(int, input().split()))
B=list(map(int, input().split()))
sum_A = list(accumulate(A))
sum_B = list(accumulate(B))
#sum_A = np.cumsum(A)
#sum_B = np.cumsum(B)
li... | # coding: utf-8
# Your code here!
from itertools import accumulate
#import numpy as np
N, M, K = list(map(int, input().split()))
A=list(map(int, input().split()))
B=list(map(int, input().split()))
sum_A = list(accumulate(A))
sum_B = list(accumulate(B))
#sum_A = np.cumsum(A)
#sum_B = np.cumsum(B)
li... | p02623 |
N, M, K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
SUM_A=[0 for _ in range(N+1)]
for i in range(N):
SUM_A[i+1] = A[i] + SUM_A[i]
if SUM_A[i+1] > K:
N=i
break
SUM_B=[0 for _ in range(M+1)]
for i in range(M):
SUM_B[i+1] =... | N, M, K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
SUM_A=[0 for _ in range(N+1)]
for i in range(N):
SUM_A[i+1] = A[i] + SUM_A[i]
if SUM_A[i+1] > K:
N=i
break
SUM_B=[0 for _ in range(M+1)]
for i in range(M):
SUM_B[i+1] =... | p02623 |
import sys
input = sys.stdin.buffer.readline
import bisect
N, M, K = list(map(int, input().split()))
A = list(map(int, (input().split())))
B = list(map(int, (input().split())))
cumA, cumB = [0], [0]
for a in A:
cumA.append(cumA[-1]+a)
for b in B:
cumB.append(cumB[-1]+b)
ans = 0
for i in range(N, -... | import sys
input = sys.stdin.buffer.readline
N, M, K = list(map(int, input().split()))
A = list(map(int, (input().split())))
B = list(map(int, (input().split())))
t = sum(B)
# 尺取法
j = M # bはmから減らしていく
ans = 0
for i in range(N+1): # aは0からnまで増やしていく
if i: t += A[i-1] # i個までの累計になるように足す 0個は0
while... | p02623 |
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_, b_ = [0], [0]
for i in range(n):
a_.append(a_[i] + a[i])
for i in range(m):
b_.append(b_[i] + b[i])
ans, j = 0, m
for i in range(n + 1):
if a_[i] > k:
break
w... | n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_, b_ = [0], [0]
for i in range(n):
a_.append(a_[i] + a[i])
for i in range(m):
b_.append(b_[i] + b[i])
ans = 0
j = m
for i in range(n+1):
if a_[i] > k:
break... | p02623 |
import sys
#import string
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from... | import sys
#import string
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from... | p02623 |
import bisect
n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
A,B=[0],[0]
for i in range(n):
A.append(a[i]+A[i])
for i in range(m):
B.append(b[i]+B[i])
for j in range(n+1):
K=k-A[j]
if K<0:
break
else:
ans=max(ans,bisect.b... | n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans,right=0,0
A,B=[0],[0]
for i in range(n):
A.append(a[i]+A[i])
for i in range(m):
B.append(b[i]+B[i])
for i in range(m+1):
if k<B[i] or i==m:
right=i-1
if i==m:
right=i
ans=ri... | p02623 |
from bisect import bisect
from collections import deque
N,M,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
csumA = [0]
csumB = [0]
s = 0
for i in A:
s += i
csumA.append(s)
s = 0
for i in B:
s += i
csumB.append(s)
ans = 0
f... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
ans, j = 0, M
for i in range(N + 1):
if a[i] > K:
break
while b[j] > K - a[i]:... | p02623 |
#!/usr/bin/env python3
import sys
def solve(N: int, M: int, K: int, A: "List[int]", B: "List[int]"):
if sum(A) + sum(B) < K:
print((N + M))
return
weightA = 0
tmp_A = N
for idx, a in enumerate(A):
if weightA + a > K:
tmp_A = idx
break
... | #!/usr/bin/env python3
import sys
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
ans, j = 0, M
for i in range(N+1):
if a[i] >... | p02623 |
n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
aa=[0]
bb=[0]
a_sum=0
b_sum=0
for i in range(n):
if (a_sum+a[i])<=k:
a_sum+=a[i]
aa.append(a_sum)
else:
break
for i in range(m):
if (b_sum+b[i])<=k:
b_sum+=... | n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
aa=[0]
bb=[0]
a_sum=0
b_sum=0
for i in range(n):
if (a_sum+a[i])<=k:
a_sum+=a[i]
aa.append(a_sum)
else:
break
for i in range(m):
if (b_sum+b[i])<=k:
b_sum+=... | p02623 |
N,M,K=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
A=[0]
B=[0]
ans=0
j=M
for i in range(N):
A.append(A[i]+a[i])
for i in range(M):
B.append(B[i]+b[i])
for i in range(N+1):
if A[i]>K:
break
while A[i]+B[j]>K:
j-=1
ans=max(ans,i+j)
pri... | def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
n,m,k=MI()
a=[0]+LI()
b=[0]+LI()
for i in range(1,n+1):
a[i]+=a[i-1]
for i in range(1,m+1):
b[i]+=b[i-1]
ans=0
j=m
for i in range(n+1):
if a[i]>k:
continue
while a[i]+b[j]>k:
j-=1
ans=max(... | p02623 |
N, N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ruisekiA = [0]
ruisekiB = [0]
tmpA=0
tmpB=0
for i in range(len(A)):
tmpA += A[i]
ruisekiA.append(tmpA)
for i in range(len(B)):
tmpB += B[i]
ruisekiB.append(tmpB)
ans = 0
for ... | N, N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ruisekiA = [0]
ruisekiB = [0]
tmpA=0
tmpB=0
for i in range(len(A)):
tmpA += A[i]
ruisekiA.append(tmpA)
for i in range(len(B)):
tmpB += B[i]
ruisekiB.append(tmpB)
ans = 0
for ... | p02623 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.