Submission #14743690


Source Code Expand

(N,M,K),A,B = $<.map{|ln| ln.split.map(&:to_i) }

n,k,a = 0,K,[]
while 0<A.size && A[0]<=k
	k -= A[0]
	n += 1
	a << A.shift
end
while 0<B.size && B[0]<=k
	k -= B[0]
	n += 1
	B.shift
end
nmax = n
begin
	if 0<a.size
		k += a[-1]
		n -= 1
		a.pop
	end
	while 0<B.size && B[0]<=k
		k -= B[0]
		n += 1
		B.shift
	end
	nmax = n if nmax<n
end while 0<a.size && 0<B.size
p nmax

Submission Info

Submission Time
Task C - Tsundoku
User ds14050
Language Ruby (2.7.1)
Score 300
Code Size 398 Byte
Status AC
Exec Time 200 ms
Memory 41636 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 20
Set Name Test Cases
Sample a01.txt, a02.txt, a03.txt
All a01.txt, a02.txt, a03.txt, b04.txt, b05.txt, b06.txt, b07.txt, b08.txt, b09.txt, b10.txt, b11.txt, b12.txt, b13.txt, b14.txt, b15.txt, b16.txt, b17.txt, b18.txt, b19.txt, b20.txt
Case Name Status Exec Time Memory
a01.txt AC 60 ms 14168 KiB
a02.txt AC 65 ms 14132 KiB
a03.txt AC 64 ms 13988 KiB
b04.txt AC 61 ms 14208 KiB
b05.txt AC 154 ms 41636 KiB
b06.txt AC 171 ms 41208 KiB
b07.txt AC 66 ms 14256 KiB
b08.txt AC 192 ms 40980 KiB
b09.txt AC 113 ms 26976 KiB
b10.txt AC 125 ms 28556 KiB
b11.txt AC 121 ms 28064 KiB
b12.txt AC 149 ms 33892 KiB
b13.txt AC 181 ms 40888 KiB
b14.txt AC 190 ms 40840 KiB
b15.txt AC 193 ms 40832 KiB
b16.txt AC 195 ms 41216 KiB
b17.txt AC 200 ms 41256 KiB
b18.txt AC 184 ms 40996 KiB
b19.txt AC 169 ms 39956 KiB
b20.txt AC 149 ms 38228 KiB