Submission #122999

#	Time	Username	Problem	Language	Result	Execution time	Memory
122999		model_code	Kitchen (BOI19_kitchen)	Cpython 2	0 / 100	14 ms	3016 KiB

kitchen

import array
N = 300
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()]
supply = array.array('i', [-N*N for i in range(N*N+1)])
supply[0] = 0;
def solve():
    if(min(a) < k):
        return 'Impossible'
    bsum = 0
    for x in b:
        bsum += x
        for i in range(bsum,-1,-1):
            supply[i+x] = max(supply[i+x],supply[i]+min(x,n))
    for i in range(sum(a),N*N+1):
        if(supply[i] >= n*k):
            return i-sum(a)
    return 'Impossible'
print(solve())

• Subtask 1: 0 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 20
• Subtask 4: 0 / 21
• Subtask 5: 0 / 28