input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n, m, k =list(map(int, input().split()))
a=list(map(int, input().split()))
b=list(map(int, input().split()))
ta=sum(a)
a.append(0)
tb=0
ans=0
for i in range(n+1):
ta -= a[n-i]
if ta>k:
continue
for j in range(m):
tb += b[j]
if tb + ta >k:
break
if... | n, m, k =list(map(int, input().split()))
a=list(map(int, input().split()))
b=list(map(int, input().split()))
ta=sum(a)
a.append(0)
tb=0
ans=0
j=0
for i in range(n+1):
ta -= a[n-i]
if ta>k:
continue
while tb + ta<=k:
if j ==m:
ans=max(ans,n-i+j)
break
... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
lia = [0]
lib = [0]
tmp = M
ans = 0
for i in range(N):
lia.append(lia[i]+A[i])
for i in range(M):
lib.append(lib[i]+B[i])
for i in range(N+1):
kari = 0
t = K - lia[i]
... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
lia = [0]
lib = [0]
j = M
ans = 0
for i in range(N):
lia.append(lia[i]+A[i])
for i in range(M):
lib.append(lib[i]+B[i])
for i in range(N+1):
if lia[i] > K:
break
... | p02623 |
from bisect import *
n, m, k = list(map(int, input().split()))
A = [0]
for x in map(int, input().split()):
if A[-1]+x > k: break
A.append(A[-1]+x)
B = [0]
for x in map(int, input().split()):
if B[-1]+x > k: break
B.append(B[-1]+x)
ans = 0
for i in range(len(A)):
j = bisect_right(B, k-A[i... | from bisect import *
n, m, k = list(map(int, input().split()))
A = [0]
for x in map(int, input().split()):
x += A[-1]
if x > k: break
A.append(x)
B = [0]
for x in map(int, input().split()):
x += B[-1]
if x > k: break
B.append(x)
ans = 0
for i in range(len(A)):
ans = max(ans, i ... | p02623 |
from bisect import *
n, m, k = list(map(int, input().split()))
A = [0]
for x in map(int, input().split()):
x += A[-1]
if x > k: break
A.append(x)
B = [0]
for x in map(int, input().split()):
x += B[-1]
if x > k: break
B.append(x)
ans = 0
for i in range(len(A)):
ans = max(ans, i ... | from bisect import *
n, m, k = list(map(int, input().split()))
A, B = [0], [0]
for x in map(int, input().split()): A.append(A[-1]+x)
for x in map(int, input().split()): B.append(B[-1]+x)
ans, j = 0, m
for i in range(n+1):
if A[i] > k: break
while A[i] + B[j] > k: j -= 1
ans = max(ans, i+j)
print(a... | 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 i,a in enumerate(A, 1):
sum_A.append(sum_A[i-1] + a)
sum_B = [0]
for i,b in enumerate(B, 1):
sum_B.append(sum_B[i-1] + b)
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()))
sum_A = [0]
for i,a in enumerate(A, 1):
tmp = sum_A[i-1] + a
if tmp <= K:
sum_A.append(tmp)
mark_A = i
else:
break
sum_B = [0]
for i,b in enumerate(B,... | p02623 |
n,m,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
cntA = 0
ans = 0
p = max(m,n)
if p == n:
q = a
r = b
else:
q = b
r = a
for i in range(p):
if cntA+q[i] > k:
break
ans += 1
cntA += q[i]
indA = ans-1
nc = indA+1
for j in rang... | 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]+a[i]>k:
j -= 1
ans = m... | 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]+a[i]>k:
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,bi = 0,m
for i in range(n+1):
for j in range(bi,-1,-1):
if a[i]+b[j]<=k:
ans = max(... | p02623 |
import bisect
import sys
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a_accumulated = [0] * (n + 1)
b_accumulated = [0] * (m + 1)
for idx, a in enumerate(A):
a_accumulated[idx + 1] = a_accumulated[idx] + a # idx == 0の場合はa_accumulated... | import bisect
import sys
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a_accumulated = [0] * (n + 1)
b_accumulated = [0] * (m + 1)
for idx, a in enumerate(A):
a_accumulated[idx + 1] = a_accumulated[idx] + a
for idx, b in enumerate(... | p02623 |
import sys
sys.setrecursionlimit(200000000)
N, M, K = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
max_num = 0
def dfs(curr_a, curr_b, choice, time_required, count):
global max_num
if choice == 0:
if curr_a >= N - 1:
... | 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... | p02623 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
def cumsum(a):
"""l[i] = sum(a[:i]) なるlを返す
sum(a[i:j]) == l[j+1] - l[i]
"""
c = 0
l = [None] * (len(a)+1)
for i,num in enumerate(a):
... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
def cumsum(a):
"""l[i] = sum(a[:i]) なるlを返す
sum(a[i:j]) == l[j+1] - l[i]
"""
c = 0
l = [None] * (len(a)+1)
for i,num in enumerate(a):
... | p02623 |
import sys
import math
import heapq
from collections import defaultdict, deque
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def r():
return int(eval(input()))
def rm():
return list(map(int,input().split()))
def rl():
return list(map(int,input().split()))
'''C Tsundoku'''
def count(... | import sys
import math
import heapq
from collections import defaultdict, deque
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def r():
return int(eval(input()))
def rm():
return list(map(int,input().split()))
def rl():
return list(map(int,input().split()))
'''C Tsundoku'''
n,m,k=rm()... | p02623 |
import heapq
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
na = 0
nb = 0
t = 0
b = 0
hq = []
heapq.heappush(hq,(t, na, nb))
while hq:
t, na, nb = heapq.heappop(hq)
if (na < N) and (t + A[na] <= K):
heapq.heappush(hq,(t + A[na],... | import heapq
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
TA = [0]
TB = [0]
na = 0
nb = 0
for i in range(N):
n = TA[-1]+A[i]
if n > K:
break
TA.append(n)
na = i + 1
#
for i in range(M):
n = TB[-1]+B[i]
if n > K:
... | p02623 |
N, M, K= list(map(int, input().split()))
A=list(map(int, input().split()))
B=list(map(int, input().split()))
Asum=[0]
Bsum=[0]
for i in range(N):
Asum.append(Asum[-1]+A[i])
if Asum[i]>K:
break
for i in range(M):
Bsum.append(Bsum[-1]+B[i])
if Bsum[i]>K:
break
... | N, M, K= list(map(int, input().split()))
A=list(map(int, input().split()))
B=list(map(int, input().split()))
Asum=[0]
Bsum=[0]
for i in range(N):
Asum.append(Asum[-1]+A[i])
for i in range(M):
Bsum.append(Bsum[-1]+B[i])
m=0
j=M
for i in range(len(Asum)):
if Asum[i]>K:
... | 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])
num,x = 0,m
for i in range(len(a)+1):
if A[i] > k:
break
while A[i] + B[x] > k:
... | 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])
num,x = 0,m
for i in range(len(A)):
if A[i] > k:
break
while A[i] + B[x] > 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]
T = 0
ans = 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):
for j in range(M+1):
T = a[i] + b[j]
... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]
b = [0]
T = 0
ans = 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] > K:
break
while a[i] ... | p02623 |
import sys
from io import StringIO
import unittest
import os
import bisect
# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)
def cumsum(target: []):
result = []
for cnt, a in enumerate(target):
result.append(a) if cnt == 0 else result.append(result[cnt - 1] + a)
... | import sys
from io import StringIO
import unittest
import os
import bisect
# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)
def cumsum(target: []):
result = []
for cnt, a in enumerate(target):
result.append(a) if cnt == 0 else result.append(result[cnt - 1] + a)
... | p02623 |
n,m,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
cost = [[float('inf')]*(m+1) for i in range(n+1)]
#Aからi冊、Bからｊ冊読むときにかかる時間がcost[i][j]
cost[0][0] = 0
max_count = 0
i = 0
while i<=n:
j = 0
while j<m:
cost[i][j+1] = cost[i][j... | n,m,k = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
cost = {}#[[float('inf')]*(m+1) for i in range(n+1)]
#Aからi冊、Bからｊ冊読むときにかかる時間がcost[i][j]
cost[(0,0)] = 0
max_count = 0
i = 0
while i<=n:
j = 0
while j<m:
cost[(i,j+1)] = cost... | p02623 |
def main():
N, M, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
*B, = list(map(int, input().split()))
s = 0
j = 0
while j < len(B) and s + B[j] <= K:
s += B[j]
j += 1
ans = cnt = j
j -= 1
for x in A:
while j >= 0 a... | # 解説
def main():
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
def accumulate(a):
s = 0
yield s
for x in a:
s += x
yield s
*A, = accumulate(A)
*B, = accumulate(B)... | p02623 |
# 解説
def main():
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
def accumulate(a):
s = 0
yield s
for x in a:
s += x
yield s
A = accumulate(A)
*B, = accumulate(B)
... | def main():
from itertools import chain
N, M, K = list(map(int, input().split()))
*A, = list(map(int, input().split()))
*B, = list(map(int, input().split()))
t = sum(B)
ans = 0
j = M
for i, x in enumerate(chain([0], A)):
t += x
while j > 0 and t > K:
... | p02623 |
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A_cumsum, B_cumsum = [0], [0]
for i in range(n):
A_cumsum.append(A_cumsum[i] + A[i])
for j in range(m):
B_cumsum.append(B_cumsum[j] + B[j])
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()))
A_cumsum, B_cumsum = [0], [0]
for i in range(n):
A_cumsum.append(A_cumsum[i] + A[i])
for j in range(m):
B_cumsum.append(B_cumsum[j] + B[j])
ans, j = 0, m
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()))
AS=[0]
BS=[0]
r=0
for i in A:
AS.append(i+AS[-1])
for i in B:
BS.append(i+BS[-1])
p=n+m+2
f=m+2
for i in range(1,n+2):
for j in range(1,f):
if AS[-i]+BS[-j]<=k:
r=max(r,p-i-j)
f=j... | n,m,k=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
AS=[0]
BS=[0]
r=0
for i in A:
if i+AS[-1]<=k:
AS.append(i+AS[-1])
else:
break
for i in B:
if i+BS[-1]<=k:
BS.append(i+BS[-1])
else:
break
j=len(BS)-1
for i in range... | p02623 |
m, n, k = list(map(int, input().split()))
a = [0] + list(map(int, input().split()))
b = [0] + list(map(int, input().split()))
def check_(lis, num, ti):
ans = 0
for i in range(num+1):
if ans >= ti:
break
ans += lis[i]
return i
max_a = check_(a, m, k)
max_b = check_... | 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(2,n+1):
A[i] += A[i-1]
for i in range(2,m+1):
B[i] += B[i-1]
j = m
ans = 0
for i in range(n+1):
if A[i] > k:
break
while B[j] > k-A[i]:
... | p02623 |
from sys import stdin
input = lambda: stdin.readline().rstrip("\r\n")
from collections import defaultdict as vector, deque as que
read = lambda: list(map(int,input().split()))
from bisect import bisect
from heapq import heappush as hpush,heappop as hpop
n,m,k=read()
A=read()
B=read()
a,b=[0],[0]
for i in ra... | from sys import stdin
input = lambda: stdin.readline().rstrip("\r\n")
from collections import defaultdict as vector, deque as que
read = lambda: list(map(int,input().split()))
from bisect import bisect
from heapq import heappush as hpush,heappop as hpop
n,m,k=read()
A=read()
B=read()
a,b=[0],[0]
for i in ra... | p02623 |
N,M,K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
num = min(N,M)
C= [None]*(num*2)
C[::2] = A[:num]
C[1::2] = B[:num]
C.extend(A[num:])
C.extend(B[num:])
if N>M:
C.extend(A[N-M:N])
elif M>N:
C.extend(B[M-N:M])
if min(C[0],C[1])>K:
print('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
else:
while b[j] > K... | p02623 |
import sys
def input(): return sys.stdin.readline().strip()
def main():
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, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
... | def main():
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, 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... | p02623 |
N, M, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
B = list(map(int, input().split(" ")))
max = 0
for i in range(len(A)+1):
time_a = 0
if i > 0:
time_a = sum(A[:i])
if time_a > K:
break
for j in range(len(B)+1):
time = time_a
if j > 0:
time += s... | N, M, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
B = list(map(int, input().split(" ")))
sumA = [0] * (N+1)
sumB = [0] * (M+1)
for i in range(N):
sumA[i+1] = sumA[i] + A[i]
for i in range(M):
sumB[i+1] = sumB[i] + B[i]
b_i = M
max_count = 0
for i in range(N+1):
a ... | 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]
for i in range(N):
sumA.append(sumA[i] + A[i])
for i in range(M):
sumB.append(sumB[i] + B[i])
#print(sumA)
#sumA = list(itertools.accumulate(A))
#sumB = list(iterto... | import itertools
N,M,K=list(map(int, input().split()))
A=list(map(int, input().split()))
B=list(map(int, input().split()))
sumA = list(itertools.accumulate(A))
sumB = list(itertools.accumulate(B))
j=M-1
while K<sumB[j] and j>=0:
j-=1
ans=j+1
for i in range(N):
if sumA[i]>K:
break
wh... | p02623 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
INF = float('inf')
# dp[n][m] represents tot... | #!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]
b = [0]
f... | p02623 |
import bisect
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,len(A)):
A[i]+=A[i-1]
for i in range(1,len(B)):
B[i]+=B[i-1]
honn=bisect.bisect(B,K)
#print(honn)
for i in range(len(A)):
s=K-A[i]
if s>=0:
... | import bisect
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,len(A)):
A[i]+=A[i-1]
for i in range(1,len(B)):
B[i]+=B[i-1]
honn=a=bisect.bisect(B,K)
for i in range(len(A)):
s=K-A[i]
if s>=0:
a=bisect.bise... | p02623 |
#関数リスト
import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def ruiseki(mydata):
res = [0]*(len(mydata)+1)
for i in range(len(mydata)):
res[i+1] = res[i] + mydata[i]
retu... | #関数リスト
def main():
import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def ruiseki(mydata):
res = [0]*(len(mydata)+1)
for i in range(len(mydata)):
... | p02623 |
import itertools
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split())) # (N,)
B = list(map(int, input().split())) # (M,)
book_num = 0
A_accum = [0] + list(itertools.accumulate(A))
B_accum = [0] + list(itertools.accumulate(B))
for n in range(N + 1):
for m in range(M + 1):
... | import itertools
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split())) # (N,)
B = list(map(int, input().split())) # (M,)
A_accum = [0] + list(itertools.accumulate(A))
B_accum = [0] + list(itertools.accumulate(B))
book_num = 0
b_best = M
for n in range(N + 1):
for m in ra... | p02623 |
import sys
import bisect
import itertools
import collections
import fractions
import heapq
import math
from operator import mul
from functools import reduce
from functools import lru_cache
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
N, M, K = list(map(int, readline()... | import sys
import bisect
import itertools
import collections
import fractions
import heapq
import math
from operator import mul
from functools import reduce
from functools import lru_cache
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
N, M, K = list(map(int, readline()... | p02623 |
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
N, M, K = rl()
A = rl()
B = rl()
s = 0
for i, b in enumerate(B):
s += b
B[i] = s
import bisect
ans = 0
s = 0
j = bisect.bisect_r... | import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(eval(input()))
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
N, M, K = rl()
A = rl()
B = rl()
s = 0
j = 0
for i, b in enumerate(B):
if s+b > K:
break
s += b
j += 1
ans = j
j -= 1
for i... | p02623 |
from itertools import accumulate
from bisect import bisect_right
N,M,K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
b=list(accumulate(B))
book=bisect_right(b,K)
for i,a in enumerate(accumulate(A),1):
if a>K:
break
j=bisect_right(b,K-a)
b... | from itertools import accumulate
from bisect import bisect_right
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))
book=bisect_right(b,K)
for i in range(N):
if a[i]>K:
break
j=bisect_right(b,K-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,j = 0,m
for i in range(n+1):
if A[i] > k:
break
while B[j] > k -... | 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] + 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]
for i in range(n):
aa.append(aa[-1]+a[i])
bb = [0]
for i in range(m):
bb.append(bb[-1]+b[i])
ans = 0
for i in range(n+1):
if aa[i] > k:
break
j = m
while a... | n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
aa = [0]
for i in a:
aa.append(aa[-1]+i)
bb = [0]
for i in b:
bb.append(bb[-1]+i)
ans = 0
j = m
for i in range(n+1):
if aa[i] > k:
break
while aa[i] + bb[j] > k and j >... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
max_num = 0
j = 0
j_max = M + 1
A_sums=[0]
B_sums=[0]
for i in range(N):
A_sums.append(A_sums[i]+A[i])
for i in range(M):
B_sums.append(B_sums[i]+B[i])
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()))
max_num = 0
j = 0
j_max = M
A_sums=[0]
B_sums=[0]
for i in range(N):
A_sums.append(A_sums[i]+A[i])
for i in range(M):
B_sums.append(B_sums[i]+B[i])
for i in range(N + 1):
j = ... | p02623 |
N,M,K=list(map(int,input().strip().split()))
A=list(map(int,input().strip().split()))
B=list(map(int,input().strip().split()))
a=[sum(A[:n]) for n in range(N+1)]
b=[sum(B[:m]) for m in range(M+1)]
num=0
bmax=M+1
for n in range(N+1):
if a[n]>K:
break
for m in reversed(list(range(bmax))):
... | N,M,K=list(map(int,input().strip().split()))
A=list(map(int,input().strip().split()))
B=list(map(int,input().strip().split()))
a=[0]
b=[0]
for n in range(N):
a.append(a[n]+A[n])
for m in range(M):
b.append(b[m]+B[m])
num=0
bmax=M+1
for n in range(N+1):
if a[n]>K:
break
for m in... | 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] >... | 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()))
SA = [0] + list(accumulate(A))
SB = [0] + list(accumulate(B))
max_count = 0
for i in range(N + 1):
a_count = i
b_count = bisect.bisect_... | p02623 |
from itertools import permutations
N, M, K = list(map(int, input().split()))
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
l = set(permutations('A'*N+'B'*M, N+M))
cnt_list = []
for i in l:
time = 0
cnt = 0
indA = 0
indB = 0
for n in range(N+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[... | p02623 |
n, m, k = list(map(int, input().split()))
a = list(map(int,input().split()))
b = list(map(int, input().split()))
ans_list = []
ans_list.append(0)
sum_a = 0
for i in range(len(a)):
sum_a += a[i]
sum_b = 0
if sum_a > k:
break
if sum_a == k:
ans_list.append(i+1)
break
for j in rang... | 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... | p02623 |
import math
import sys
import itertools
from math import gcd
from math import sqrt
from sys import stdin
def input() : return stdin.readline().rstrip()
def mips():
return list(map(int,input().split()))
def ii():
return int(eval(input()))
sys.setrecursionlimit(10**9)
N,M,K = mips()
A = [i for i in... | import math
import sys
import itertools
from math import gcd
from math import sqrt
from sys import stdin
def input() : return stdin.readline().rstrip()
def mips():
return list(map(int,input().split()))
def ii():
return int(eval(input()))
sys.setrecursionlimit(10**9)
N,M,K = mips()
A = [i for i in... | 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
b_cnt = m
for a_cnt in range(n+1):
if a[a_cnt] > k:
continue
while... | 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, b_cnt = 0, m
for a_cnt in range(n+1):
if a[a_cnt] > k: break
while a[a_cnt] + b[b_cnt] > ... | p02623 |
N, M, K = list(map(int, input().split()))
a_books = list(map(int, input().split()))
b_books = list(map(int, input().split()))
a_time = 0
b_time = 0
a_times = [0 for _ in range(N+1)]
b_times = [0 for _ in range(M+1)]
for i, a in enumerate(a_books):
a_time += a
a_times[i+1] = a_time
for i, b in enumerat... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ab_sum , answer = sum(B), 0
j = M
for i in range(N+1):
while j>0 and ab_sum >K:
j -= 1
ab_sum -= B[j]
if ab_sum >K:
break
answer = max(answer, i+j)
if i==N:
break
ab_... | p02623 |
from itertools import accumulate
from bisect import bisect_right
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))
ans = 0
for i in range(N + 1):
if a[i] > K:
break
... | from itertools import accumulate
from bisect import bisect_right
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A_cumu = [0] + list(accumulate(A))
B_cumu = [0] + list(accumulate(B))
curr_max = 0
for i in range(N + 1):
curr = A_cumu[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
ans = 0
for k in range(len(A)):
a += A[k]
A[k] = a
for k in range(len(B)):
b += B[k]
B[k] = b
AA = [0] + A
BB = [0] + B
for k in range(N+1):
if AA[k] <... | 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 |
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
MAX = 10 ** 18
# 累積和
accA, accB = [0] * (n + 1), [0] * (m + 1)
accA[1], accB[1] = A[0], B[0]
for i in range(2, n + 1):
accA[i] = accA[i - 1] + A[i - 1]
for i in range(2, m + 1):
accB[i... | n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
t = sum(B)
# しゃくとり法
res = 0
j = m
for i in range(n + 1):
while j > 0 and t > k:
j -= 1
t -= B[j]
if t > k:
break
res = max(res, i + j)
if i == n: br... | p02623 |
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
# import fractions
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstr... | import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
# import fractions
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstr... | p02623 |
import sys
import math
from collections import deque
import heapq
import itertools
from decimal import Decimal
import bisect
from operator import itemgetter
MAX_INT = int(10e18)
MIN_INT = -MAX_INT
mod = 1000000000+7
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): re... | import sys
import math
from collections import deque
import heapq
import itertools
from decimal import Decimal
import bisect
from operator import itemgetter
MAX_INT = int(10e18)
MIN_INT = -MAX_INT
mod = 1000000000+7
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): re... | p02623 |
n, m, k = list(map(int, input().split()))
aa = list(map(int, input().split()))
bb = list(map(int, input().split()))
ans = [0]
time_sum = 0
i, j = 0, 0
flag_a = True
flag_b = True
flag = False
for i in range(0, len(aa)+1):
for j in range(0, len(bb)+1):
asum, bsum = sum(aa[:i]), sum(bb[:j])
... | n, m, k = list(map(int, input().split()))
aa = list(map(int, input().split()))
bb = list(map(int, input().split()))
asum = [0]
bsum = [0]
for i in range(len(aa)):
asum.append(asum[i]+aa[i])
for i in range(len(bb)):
bsum.append(bsum[i]+bb[i])
j = len(bsum)-1
ans = 0
for i in range(len(asum)):
... | p02623 |
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
suma = [0 for i in range(len(a)+1)]
sumb = [0 for i in range(len(b)+1)]
for i in range(1, len(a)+1):
suma[i] = suma[i-1] + a[i-1]
for i in range(1, len(b)+1):
sumb[i] = sumb[i-1] + b[i... | n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
suma = [0 for i in range(len(a)+1)]
sumb = [0 for i in range(len(b)+1)]
for i in range(1, len(a)+1):
suma[i] = suma[i-1] + a[i-1]
for i in range(1, len(b)+1):
sumb[i] = sumb[i-1] + b[i... | p02623 |
# Did not get in the contest. The key insight is in the end, the optimal solution involves taking X books from the front of A and Y books from the front of B. The intermediate transitions from one stack to another do not matter in the big picture.
from sys import stdin
n, m, k = list(map(int, stdin.readline().split... | # Did not get in the contest. The key insight is in the end, the optimal solution involves taking X books from the front of A and Y books from the front of B. The intermediate transitions from one stack to another do not matter in the big picture.
from sys import stdin
n, m, k = list(map(int, stdin.readline().split... | 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]
p = 0
q = 0
for i in range(N):
if p + A[i] > K:
break
a.append(p+A[i])
p += A[i]
for i in range(M):
if q + B[i] > K:
break
b.append(q+B[i])
q += B[i]
ans... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]
b = [0]
p = 0
for i in range(N):
p += A[i]
a.append(p)
q = 0
for j in range(M):
q += B[j]
b.append(q)
ans = 0
j = M
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_sum = [0]
b_sum = [0]
for i in range(n):
a_sum.append(a[i]+a_sum[i])
if a_sum[i]>k:
break
for i in range(m):
b_sum.append(b[i]+b_sum[i])
if b_sum[i]>k:
break
... | 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]
for i in range(n):
a_sum.append(a[i]+a_sum[i])
if a_sum[i]>k:
break
for i in range(m):
b_sum.append(b[i]+b_sum[i])
if b_sum[i]>k:
break
... | p02623 |
from sys import stdin
import bisect
sysin=stdin.readline
N,M,K=[int(x) for x in sysin().rstrip().split()]
a=[int(x) for x in sysin().rstrip().split()]
b=[int(x) for x in sysin().rstrip().split()]
# N,M=3,4
# K=240
# a=[60, 90, 120]
# b=[80, 150, 80, 150]
ans=0
accum_a=[0]
for i in a:
_a=accum... | import bisect
N,M,K=list(map(int,input().split()))
list_a=list(map(int,input().split()))
list_b=list(map(int,input().split()))
totaltame_a=[0]
for a in list_a:
temp_a=totaltame_a[-1]+a
if temp_a>K:
break
else:
totaltame_a.append(temp_a)
totaltime_b=[0]
for b in list_b:
... | p02623 |
from bisect import bisect_right as br
n,m,k = list(map(int,input().split()))
a = [int(i) for i in input().split()]
sa = [0]*(n+1)
for i in range(n): sa[i+1] = sa[i]+a[i]
b = [int(i) for i in input().split()]
sb = [0]*(m+1)
for i in range(m): sb[i+1] = sb[i]+b[i]
ans = 0
for i in range(n+1):
cnt = sa[i]
... | from bisect import bisect_right as br
n,m,k = list(map(int,input().split()))
a = [int(i) for i in input().split()]
sa = [0]*(n+1)
for i in range(n): sa[i+1] = sa[i]+a[i]
b = [int(i) for i in input().split()]
sb = [0]*(m+1)
for i in range(m): sb[i+1] = sb[i]+b[i]
ans = 0
for i in range(n+1):
if sa[i] > k: ... | p02623 |
from bisect import *
def solve():
ans = 0
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))+[float('inf')]
B = list(map(int, input().split()))+[float('inf')]
cumA = [0]*(N+1)
cumB = [0]*(M+1)
for i in range(N):
cumA[i+1] = cumA[i]+A[i]
for i ... | from itertools import groupby, accumulate, product, permutations, combinations
def solve():
ans = 0
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))
b = M
for... | p02623 |
N, M, K = list(map(int, input().split()))
time_A = list(map(int, input().split()))
time_B = list(map(int, input().split()))
max_books = 0
allot_to_A = 0
allot_to_B = K
while True:
if max_books == len(time_A) + len(time_B):
break
num_books = 0
change_point = 10000000000
time_bankA ... | 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 |
from bisect import bisect
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
SA = [0] * (N + 1)
SB = [0] * (M + 1)
for i in range(N):
SA[i+1] = SA[i] + A[i]
for i in range(M):
SB[i+1] = SB[i] + B[i]
result = 0
for x in range(N+1):
if... | from bisect import bisect
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
SA = [0] * (N + 1)
SB = [0] * (M + 1)
for i in range(N):
SA[i+1] = SA[i] + A[i]
for i in range(M):
SB[i+1] = SB[i] + B[i]
result = 0
y = M
for x 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()))
a_sum = [0] * (n + 1)
b_sum = [0] * (m + 1)
for i in range(n):
a_sum[i + 1] = a_sum[i] + a[i]
for i in range(m):
b_sum[i + 1] = b_sum[i] + b[i]
res = 0
for i in range(n+1):
for... | n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_num = 0
b_num = 0
book_num = 0
passed_k = 0
for i in range(n):
if a[i] + passed_k <= k:
a_num += 1
passed_k += a[i]
else:
break
for i in range(m):
if b[... | p02623 |
import bisect
N, M, K = list(map(int, input().split()))
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
da = [0 for _ in range(N+1)]
for i in range(N):
da[i+1] = da[i] + a[i]
db = [0 for _ in range(M+1)]
for i in range(M):
db[i+1] = db[i] + b[i]
ans = 0
for i in rang... | N, M, K = list(map(int, input().split()))
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
da = [0 for _ in range(N+1)]
for i in range(N):
da[i+1] = da[i] + a[i]
db = [0 for _ in range(M+1)]
for i in range(M):
db[i+1] = db[i] + b[i]
ans = 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()))
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
best = M
for i in range(N+1):
if a[i] > K:
break
for j in range... | 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
while b[j] > K -a... | p02623 |
import bisect
# listのpopを使う
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# 純粋に小さい方を読んでいく
ans = 0
# 1番上しか読めない
# while K >= A[0] or K >= B[0]:
# if A[0]
cumulative_sum_of_A = [0]
cumulative_sum_of_B = [0]
for i in range(N):
cumulati... | from bisect import bisect_left, bisect_right
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ruisekiwa_of_A = [0]
ruisekiwa_of_B = [0]
for a in A:
ruisekiwa_of_A.append(ruisekiwa_of_A[-1]+a)
for b in B:
ruisekiwa_of_B.append(ruisekiwa_... | p02623 |
from bisect import bisect_left, bisect_right
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ruisekiwa_of_A = [0]
ruisekiwa_of_B = [0]
for a in A:
ruisekiwa_of_A.append(ruisekiwa_of_A[-1]+a)
for b in B:
ruisekiwa_of_B.append(ruisekiwa_... | from bisect import bisect_right
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ruisekiwa_of_a = [0]
ruisekiwa_of_b = [0]
for a in A:
ruisekiwa_of_a.append(ruisekiwa_of_a[-1]+a)
for b in B:
ruisekiwa_of_b.append(ruisekiwa_of_b[-1]+b)
# ... | p02623 |
import itertools
N,M,K = list(map(int,input().split()))
A = [0]+list(map(int,input().split()))
B = [0]+list(map(int,input().split()))
SA = list(itertools.accumulate(A))
SB = list(itertools.accumulate(B))
ans = 0
pt = len(B)-1
for i,sa in enumerate(SA):
while(pt>=0):
if sa + SB[pt] <= K:
... | import itertools
N,M,K = list(map(int,input().split()))
A = [0]+list(map(int,input().split()))
B = [0]+list(map(int,input().split()))
SA = list(itertools.accumulate(A))
SB = list(itertools.accumulate(B))
ans = 0
j = len(B)-1
for i in range(len(SA)):
while(j>=0):
if SA[i] + SB[j] <= K:
... | p02623 |
n, m, k = list(map(int, input().split(' ')))
list_a = list(map(int, input().split(' ')))
list_b = list(map(int, input().split(' ')))
a_sum=[list_a[0]]
for i in range(1, n):
a_sum.append(list_a[i]+a_sum[i-1])
b_sum=[list_b[0]]
for i in range(1, m):
b_sum.append(list_b[i]+b_sum[i-1])
ans=0
if ... | n, m, k = list(map(int, input().split(' ')))
a = list(map(int, input().split(' ')))
b = list(map(int, input().split(' ')))
a_sum=[0]
for i in range(n):
a_sum.append(a[i]+a_sum[i])
b_sum=[0]
for i in range(m):
b_sum.append(b[i]+b_sum[i])
ans, j = 0, m
for i in range(n+1):
if a_sum[i]>k:
... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
n = N
while True:
if sum(A[:n]) <= K:
break
n -= 1
m = M
max_num = 0
for n in range(n + 1):
#print(n, m)
if sum(A[:n]) > K:
break
while True:
#... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ma = [0] * (N + 1)
mb = [0]*(M+1)
for i in range(N):
ma[i + 1] = ma[i] + A[i]
for i in range(M):
mb[i + 1] = mb[i] + B[i]
j = M
max_num = 0
for i in range(N+1):
if ma[i] ... | p02623 |
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
Acum = [0]*n
Bcum = [0]*m
Acum[0] = A[0]
Bcum[0] = B[0]
for i in range(1,n):
Acum[i] = Acum[i-1] + A[i]
for i in range(1,m):
Bcum[i] = Bcum[i-1] + B[i]
mx = 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()))
Acum = [0]*n
Bcum = [0]*m
Acum[0] = A[0]
Bcum[0] = B[0]
for i in range(1,n):
Acum[i] = Acum[i-1] + A[i]
for i in range(1,m):
Bcum[i] = Bcum[i-1] + B[i]
mx = 0
import bisect
for ... | p02623 |
from sys import exit
import copy
# import numpy as np
from collections import deque
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
cnt = 0
a.insert(0, 0)
b.insert(0, 0)
for i in range(1, n+1):
a[i] += a[i-1]
for i in range(... | from sys import exit
import copy
# import numpy as np
from collections import deque
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
cnt = 0
a.insert(0, 0)
b.insert(0, 0)
for i in range(1, n+1):
a[i] += a[i-1]
for i in range(... | p02623 |
def getIntList(strList):
return list([int(x) for x in strList])
N, M, K = getIntList(input().split(" "))
A = getIntList(input().split(" "))
B = getIntList(input().split(" "))
ta = 0
tb = 0
TA = [0]
TB = [0]
for i in range(len(A)):
ta += A[i]
if ta <= K:
TA.append(ta)
else:
break
for... | def getIntList(strList):
return list([int(x) for x in strList])
N, M, K = getIntList(input().split(" "))
A = getIntList(input().split(" "))
B = getIntList(input().split(" "))
ta = 0
tb = 0
TA = [0]
TB = [0]
for i in range(len(A)):
ta += A[i]
if ta <= K:
TA.append(ta)
else:
break
for... | p02623 |
from itertools import *
from bisect import bisect_right
n,m,time = 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))
ans = 0
for i in range(bisect_right(A, time)-1,-1,-1):
for j in range(bisect_ri... |
from itertools import *
from bisect import bisect_right
n,m,time = 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))
ans = 0
for i in range(bisect_right(A, time)-1,-1,-1):
ans = max(ans,i+bisect... | p02623 |
from itertools import accumulate
n,m,k = list(map(int,input().split()))
deskA = list(map(int,input().split()))
deskB = list(map(int,input().split()))
cumA = list(accumulate(deskA))
cumB = list(accumulate(deskB))
cumA = [0] + cumA
cumB = [0] + cumB
ans = 0
l = m
for i in range(n+1):
tmp = k - cumA[i]
... | from itertools import accumulate
n,m,k = list(map(int,input().split()))
deskA = list(map(int,input().split()))
deskB = list(map(int,input().split()))
cumA = [0] + list(accumulate(deskA))
cumB = [0] + list(accumulate(deskB))
ans = 0
j = m
for i in range(n+1):
if cumA[i] > k:
continue
while cum... | p02623 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): ret... | p02623 |
n,m,k=list(map(int,input().split(" ")))
a=[-9]
b=list(a)
a.extend(list(map(int,input().split(" "))))
b.extend(list(map(int,input().split(" "))))
t=0
i=1
while i<=n :
# print("a[{}]={}".format(i,a[i]))
if t+a[i]>k :
break
t+=a[i]
# print("t=",t)
i+=1
i-=1
# print("i=",i)
j... |
n,m,k=list(map(int,input().split(" ")))
a=list(map(int,input().split(" ")))
b=list(map(int,input().split(" ")))
t=0
i=0
while i<n :
if t+a[i]>k :
break
t+=a[i]
i+=1
j=0
while j<m :
if t+b[j]>k :
break
t+=b[j]
j+=1
ans=i+j
while i>0 :
i-=1
t-=a[i... | p02623 |
n,m,k=list(map(int,input().split(" ")))
a=list(map(int,input().split(" ")))
b=list(map(int,input().split(" ")))
t=0
i=0
while i<n :
if t+a[i]>k :
break
t+=a[i]
i+=1
j=0
while j<m :
if t+b[j]>k :
break
t+=b[j]
j+=1
ans=i+j
while i>0 :
i-=1
t-=a[i... |
n,m,k=list(map(int,input().split(" ")))
a=list(map(int,input().split(" ")))
# b=list(map(int,input().split(" ")))
b=list(map(int,input().split(" ")))
t=0
i=0
while i<n :
if t+a[i]>k :
break
t+=a[i]
i+=1
# j=0
# while j<m :
# if t+b[j]>k :
# break
# t+=b[j]
# ... | p02623 |
N,M,K=list(map(int,input().split()))
A=[]
B=[]
A=list(map(int,input().split()))
B=list(map(int,input().split()))
dp=[[0 for j in range(K+1)] for i in range(max(N,M)+1)]
if(N<M):
ma=M
mi=N
turn='M'
else:
ma=N
mi=M
turn='N'
if(turn=='M'):
for i in range(ma):
for j i... | N,M,K=list(map(int,input().split()))
A=[]
B=[]
A=list(map(int,input().split()))
B=list(map(int,input().split()))
a=[0 for i in range(len(A)+1)]
for i in range(1,len(A)+1):
a[i]=a[i-1]+A[i-1]
b=[0 for i in range(len(B)+1)]
for i in range(1,len(B)+1):
b[i]=b[i-1]+B[i-1]
j=M
ans=0
for i in range(l... | p02623 |
import bisect
from itertools import accumulate
n, m, k = list(map(int, input().split()))
A = list(accumulate([0]+list(map(int, input().split()))))
B = list(accumulate([0]+list(map(int, input().split()))))
ans = 0
for i, a in enumerate(A):
if a > k:
break
j = bisect.bisect_right(B, k-a)-1
... | from itertools import accumulate
import bisect
n, m, k = list(map(int, input().split()))
A = [0] + list(accumulate(list(map(int, input().split()))))
B = [0] + list(accumulate(list(map(int, input().split()))))
ans = 0
for i, a in enumerate(A):
if a > k:
break
temp = i + bisect.bisect_right(B, k-a)-1
... | p02623 |
from bisect import bisect_right
from itertools import accumulate
N,M,K = list(map(int,input().split()))
A = [0]+list(accumulate(list(map(int,input().split()))))
B = [0]+list(accumulate(list(map(int,input().split()))))
ans = [0]
for n in range(1+N):
C = bisect_right(B,K-A[n])-1
if C!=-1:
ans.append(... | from bisect import *
from itertools import *
N,M,K = list(map(int,input().split()))
A = [0]+list(accumulate(list(map(int,input().split()))))
B = [0]+list(accumulate(list(map(int,input().split()))))
ans = [0]
for n in range(1+N):
C = bisect_right(B,K-A[n])-1
if C!=-1:
ans+=[C+n]
print((max(ans))) | p02623 |
import sys
sys.setrecursionlimit(10**9)
# readline = sys.stdin.readline
# generator = (readline().strip() for _ in range(N))
# N, M = map(int, input().split())
# As = list(map(int, input().split()))
# queries = (input() for _ in range(N))
def dfs(n, m, total, count, N, M, K, As, Bs):
if total > K:
... | from bisect import bisect_right
def solve():
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sum_as = [0] * (N+1)
sum_bs = [0] * (M+1)
for i, a in enumerate(A):
sum_as[i+1] = sum_as[i] + a
for i, b... | p02623 |
from bisect import bisect_right
def solve():
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sum_as = [0] * (N+1)
sum_bs = [0] * (M+1)
for i, a in enumerate(A):
sum_as[i+1] = sum_as[i] + a
for i, b... | from itertools import chain
def solve():
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
*B, = list(map(int, input().split()))
answer = 0
sum_b = sum(B)
idx_b = M
remain = K
for i, a in enumerate(chain([0], A)):
remain -= a
... | p02623 |
from itertools import chain
def solve():
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
answer = 0
sum_b = sum(B)
idx_b = M
remain = K
for i, a in enumerate(chain([0], A)):
remain -= a
... | from itertools import chain
def solve():
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
answer = 0
sum_b = sum(B)
idx_b = M
remain = K
for i, a in enumerate(chain([0], A)):
remain -= a
... | p02623 |
N,M,K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A_accumulate_cost = [0]
lastCost = 0
for i in range(N):
lastCost += A[i]
A_accumulate_cost.append(lastCost)
B_accumulate_cost = [0]
lastCost = 0
for i in range(M):
lastCost += B[i]
... | N,M,K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A_accumulate_cost = [0]
lastCost = 0
for i in range(N):
lastCost += A[i]
A_accumulate_cost.append(lastCost)
B_accumulate_cost = [0]
lastCost = 0
for i in range(M):
lastCost += B[i]
... | p02623 |
import math
def solve(n,m,k,a_lst,b_lst):
#机ごと、読書時間の累積をリストにする。ただし、リスト化はk時間内で読める範囲とする
aa_lst = make_sum_list(a_lst,k)
bb_lst = make_sum_list(b_lst,k)
len_aa = len(aa_lst)
len_bb = len(bb_lst)
#A,Bいずれかが一冊も読めないケースを考慮
if len_aa == 0:
if len_bb == 0: return 0
else: r... | import math
def solve(n,m,k,a_lst,b_lst):
#机ごと、読書時間の累積をリストにする。ただし、リスト化はk時間内で読める範囲とする
aa_lst = make_sum_list(a_lst,k)
bb_lst = make_sum_list(b_lst,k)
len_aa = len(aa_lst)
len_bb = len(bb_lst)
#A,Bいずれかが一冊も読めないケースを考慮
if len_aa == 0: return len_bb
elif len_bb == 0: return len_... | p02623 |
# -*- coding: utf-8 -*-
import io
import sys
import math
def solve(n,m,k,a_lst,b_lst):
#机ごと、読書時間の累積をリストにする。ただし、リスト化はk時間内で読める範囲とする
aa_lst = make_sum_list(a_lst,k)
bb_lst = make_sum_list(b_lst,k)
len_aa = len(aa_lst)
len_bb = len(bb_lst)
#A,Bいずれかが一冊も読めないケースを考慮
if len_aa == 0... | # -*- coding: utf-8 -*-
import io
import sys
import math
def solve(n,m,k,a_lst,b_lst):
#机ごと、読書時間の累積をリストにする。ただし、リスト化はk時間内で読める範囲とする
aa_lst = make_sum_list(a_lst,k)
bb_lst = make_sum_list(b_lst,k)
len_aa = len(aa_lst)
len_bb = len(bb_lst)
#A,Bいずれかが一冊も読めないケースを考慮
if len_aa == 0... | p02623 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
def main():
N, M, K = list(map(int, readline().split()))
A = [int(i) for i in readline().split()]
B = [int(i) for i in readline().split()]
#方針:A,Bそ... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
def main():
N, M, K = list(map(int, readline().split()))
A = [int(i) for i in readline().split()]
B = [int(i) for i in readline().split()]
#方針:A,Bそ... | p02623 |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A = [0] + A
B = [0] + B
BM = M
X = 0
SA = 0
for i in range(N + 1):
SA += A[i]
SB = 0
for j in range(M + 1):
SB += B[j]
if SA + SB <= K:
X = max(X, i + j... | 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])
x = 0
bj = M
for i in range(N + 1):
if a[i] > K:
break
for j in range(... | p02623 |
from itertools import accumulate
import bisect
n, m, k = list(map(int, input().split()))
Acum = [0]+list(accumulate(list(map(int, input().split()))))
Bcum = [0]+list(accumulate(list(map(int, input().split()))))
ans = 0
for a in range(n+1):
if k-Acum[a] < 0:
break
b = bisect.bisect_right(Bcum,... | from itertools import accumulate
n, m, k = list(map(int, input().split()))
Acum = [0]+list(accumulate(list(map(int, input().split()))))
Bcum = [0]+list(accumulate(list(map(int, input().split()))))
ans = 0
b = m
for a in range(n+1):
if k < Acum[a]:
break
while k < Acum[a]+Bcum[b]:
b -... | p02623 |
def go(s,b):
count=-1
for i in b:
if s>=i:
count+=1
return count
n,m,k= list(map(int,input().split(" ")))
a= (list(map(int,input().split(" "))))
b= (list(map(int,input().split(" "))))
c,d=[],[]
s=0
for i in a:
s+=i
c.append(s)
s=0
for i in b:
s+=i
d.ap... | 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]
j,mx= m,0
for i in range(n+1):
if a[i]>k:
break
while(b[j]>k-a[i])... | p02623 |
from sys import stdin
data = stdin.readlines()
n = int(data[0].split()[0])
m = int(data[0].split()[1])
k = int(data[0].split()[2])
a = [int(s) for s in data[1].split()]
b = [int(s) for s in data[2].split()]
c = [0]
time = 0
for i in range(1,n+m+1):
for j in range(0,i+1):
if j <= n and 0 <... | from sys import stdin
data = stdin.readlines()
n = int(data[0].split()[0])
m = int(data[0].split()[1])
k = int(data[0].split()[2])
A = [int(s) for s in data[1].split()]
B = [int(s) for s in data[2].split()]
a = [0]
b = [0]
for i in range(n):
a.append(a[i]+A[i])
for i in range(m):
b.append(... | p02623 |
import sys
def resolve():
lines = sys.stdin.readlines()
n, m, k = tuple(map(int, lines[0].strip().split(' ')))
a = list(map(int, lines[1].strip().split(' ')))
b = list(map(int, lines[2].strip().split(' ')))
c_max = 0
c = 0
s = 0
for q in b:
s += q
if s > k:... | import sys
def resolve():
lines = sys.stdin.readlines()
n, m, k = tuple(map(int, lines[0].strip().split(' ')))
A = list(map(int, lines[1].strip().split(' ')))
B = list(map(int, lines[2].strip().split(' ')))
a = [0]
b = [0]
for i in range(n):
a.append(a[i] + A[i])
... | p02623 |
n,m,k = list(map(int,input().split()))
shelfA = list(map(int,input().split()))
shelfB = list(map(int,input().split()))
prodA = [0]*(n+1)
prodB = [0]*(m+1)
for i in range(1,n+1):
prodA[i] = prodA[i-1] + shelfA[i-1]
for i in range(1,m+1):
prodB[i] = prodB[i-1] + shelfB[i-1]
if(n>=m):
ans = [-1]*(n+1... | n,m,k = list(map(int,input().split()))
shelfA = list(map(int,input().split()))
shelfB = list(map(int,input().split()))
prodA = [0]*(n+1)
prodB = [0]*(m+1)
for i in range(1,n+1):
prodA[i] = prodA[i-1] + shelfA[i-1]
for i in range(1,m+1):
prodB[i] = prodB[i-1] + shelfB[i-1]
ans = -1
j = m
for i in ra... | p02623 |
from collections import deque
import bisect
n,m,k = list(map(int, input().split()))
a = deque(list(map(int, input().split())))
b = deque(list(map(int, input().split())))
ans = 0
a.appendleft(0)
b.appendleft(0)
for i in range(1,n+1):
a[i]+=a[i-1]
for i in range(1,m+1):
b[i]+=b[i-1]
for i in range... | from collections import deque
import bisect
n,m,k = list(map(int, input().split()))
a = [0]
b = [0]
a1 = list(map(int, input().split()))
b1 = list(map(int, input().split()))
# a1 = [1000000]*200000
# b1 = [1000000]*200000
ans = 0
a = a + a1
b = b + b1
for i in range(1,n+1):
a[i]+=a[i-1]
for i in ran... | p02623 |
n, m, k = [int(e) for e in input().split()]
a = [int(e) for e in input().split()]
b = [int(e) for e in input().split()]
count = 0
while True:
if len(a) > 0 and a[0] <= k:
k -= a[0]
a.pop(0)
count += 1
continue
if len(b) > 0 and b[0] <= k:
k -= b[0]
b... | n, m, k = [int(e) for e in input().split()]
a = [int(e) for e in input().split()]
b = [int(e) for e in input().split()]
i = 0
j = 0
total_max = 0
while i < n:
if a[i] > k:
break
k -= a[i]
i += 1
while j < m:
if b[j] > k:
break
k -= b[j]
j += 1
total_... | p02623 |
import sys
sys.setrecursionlimit(1000000)
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ai = 0
bi = 0
def read(ai, bi, count, rest):
if rest <= 0:
return count
else:
if ai >= N:
a_c = count
... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
cumA = [0] * (N+1)
cumB = [0] * (M+1)
point = 0
for i in range(N):
cumA[i+1] = cumA[i] + A[i]
for i in range(M):
cumB[i+1] = cumB[i] + B[i]
# 尺取りの要領でiを増やしjを減らす
res, j = 0, M
for i in... | p02623 |
n,m,k = list(map(int, input().split()))
a = [0]+list(map(int, input().split()))
b = [0]+list(map(int, input().split()))
Goukei_a=[a[0]]
for i in range(1,n+1):
Goukei_a.append(Goukei_a[i-1]+a[i])
Goukei_b=[b[0]]
for i in range(1,m+1):
Goukei_b.append(Goukei_b[i-1]+b[i])
goukei=0
kaisuu=0
ans=0
... | 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]
b_cnt=m
ans=0
for a_cnt in range(n+1):
if a[a_cnt]>k:
break
while a[a_cnt]+b[b_cnt]>... | 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)
cnt =0
for i in range(1,n+1):
A[i] = A[i-1] + a[i-1]
for i in range(1,m+1):
B[i] = B[i-1] + b[i-1]
for i in range(n+1):
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]*(n+1)
B = [0]*(m+1)
cnt =0
for i in range(1,n+1):
A[i] = A[i-1] + a[i-1]
for i in range(1,m+1):
B[i] = B[i-1] + b[i-1]
j = m
for i in range(n+1):
if A[i] > k:
b... | p02623 |
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
s_a = [0]
s_b = [0]
for i in range(n):
s_a.append(s_a[i] + a[i])
for i in range(m):
s_b.append(s_b[i] + b[i])
ans = 0
ok = m
for i in range(n+1):
for j in range(ok+1):
... | n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
s_a = [0]
s_b = [0]
for i in range(n):
s_a.append(s_a[i] + a[i])
for i in range(m):
s_b.append(s_b[i] + b[i])
ans = 0
tmp = m
for i in range(n+1):
for j in range(tmp+1)[::-1]:
... | p02623 |
N,M,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
timeleft = K
counter = 0
flag = True
while flag:
if len(A) == 0 and len(B) == 0:
flag = False
elif len(A) == 0:
if B[0] <= timeleft:
counter += 1
t... | N,M,K = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
Asum = [0]
Bsum = [0]
atemp = 0
btemp = 0
for i in range(N):
atemp += A[i]
Asum.append(atemp)
for i in range(M):
btemp += B[i]
Bsum.append(btemp)
ans = 0
j = M
for i in range(N... | p02623 |
import itertools
n, m, k = list(map(int, input().split()))
A = [0] + list(map(int, input().split()))
B = [0] + list(map(int, input().split()))
A = list(itertools.accumulate(A))
B = list(itertools.accumulate(B))
count = 0
for i in range(n+1):
if A[i] > k:
break
j = m
while A[i]... | import itertools
n, m, k = list(map(int, input().split()))
A = [0] + list(map(int, input().split()))
B = [0] + list(map(int, input().split()))
A = list(itertools.accumulate(A))
B = list(itertools.accumulate(B))
count = 0
j = m
for i in range(n+1):
if A[i] > k:
break
while A[i]+B[j... | p02623 |
# import io
# import sys
# _INPUT = """\
# 1 4 120
# 100 1 1 1 1 1 1 1 1 1 1
# 80 10 10 10 10
# """
# sys.stdin = io.StringIO(_INPUT)
####################################################################
import sys
def p(*_a):
return
_s=" ".join(map(str,_a))
#print(_s)
sys.stderr.write(_s+"\n")... | # import io
# import sys
# _INPUT = """\
# 1 4 120
# 100 1 1 1 1 1 1 1 1 1 1
# 80 10 10 10 10
# """
# sys.stdin = io.StringIO(_INPUT)
####################################################################
import sys
def p(*_a):
return
_s=" ".join(map(str,_a))
#print(_s)
sys.stderr.write(_s+"\n")... | p02623 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.