답안 #945358

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
945358	2024-03-13T16:47:10 Z	LucaIlie	Kitchen (BOI19_kitchen)	C++17	100 / 100	20 ms	796 KB

kitchen

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 300;
const int MAX_M = 300;
const int MAX_S = 9e4;
int a[MAX_N], b[MAX_M], maxSum[MAX_S + 1];

int main() {
    int n, m, k;

    cin >> n >> m >> k;
    for ( int i = 0; i < n; i++ )
        cin >> a[i];
    for ( int i = 0; i < m; i++ )
        cin >> b[i];

    if ( m < k ) {
        cout << "Impossible\n";
        return 0;
    }

    int sumA = 0;
    for ( int i = 0; i < n; i++ ) {
        sumA += a[i];
        if ( a[i] < k ) {
            cout << "Impossible\n";
            return 0;
        }
    }

    for ( int s = 0; s <= MAX_S; s++ )
        maxSum[s] = -MAX_S - 1;
    maxSum[0] = 0;
    for ( int i = 0; i < m; i++ ) {
        for ( int s = MAX_S; s >= b[i]; s-- )
            maxSum[s] = max( maxSum[s], maxSum[s - b[i]] + min( b[i], n ) );
    }

    int wasted = 0;
    while ( sumA + wasted <= MAX_S && maxSum[sumA + wasted] < n * k )
        wasted++;

    if ( sumA + wasted > MAX_S )
        cout << "Impossible\n";
    else
        cout << wasted;

    return 0;
}

Subtask #1

9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	1 ms	604 KB	Output is correct
3	Correct	1 ms	604 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	1 ms	604 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	604 KB	Output is correct

Subtask #2

22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	1 ms	604 KB	Output is correct
3	Correct	1 ms	604 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	1 ms	604 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	604 KB	Output is correct
9	Correct	2 ms	600 KB	Output is correct
10	Correct	1 ms	604 KB	Output is correct
11	Correct	2 ms	604 KB	Output is correct
12	Correct	2 ms	604 KB	Output is correct
13	Correct	2 ms	604 KB	Output is correct

Subtask #3

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	604 KB	Output is correct
2	Correct	15 ms	792 KB	Output is correct
3	Correct	20 ms	604 KB	Output is correct
4	Correct	20 ms	604 KB	Output is correct
5	Correct	20 ms	604 KB	Output is correct
6	Correct	14 ms	604 KB	Output is correct

Subtask #4

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	604 KB	Output is correct
2	Correct	3 ms	792 KB	Output is correct
3	Correct	3 ms	604 KB	Output is correct
4	Correct	3 ms	604 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct

Subtask #5

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	1 ms	604 KB	Output is correct
3	Correct	1 ms	604 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	1 ms	604 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	604 KB	Output is correct
9	Correct	2 ms	600 KB	Output is correct
10	Correct	1 ms	604 KB	Output is correct
11	Correct	2 ms	604 KB	Output is correct
12	Correct	2 ms	604 KB	Output is correct
13	Correct	2 ms	604 KB	Output is correct
14	Correct	17 ms	604 KB	Output is correct
15	Correct	15 ms	792 KB	Output is correct
16	Correct	20 ms	604 KB	Output is correct
17	Correct	20 ms	604 KB	Output is correct
18	Correct	20 ms	604 KB	Output is correct
19	Correct	14 ms	604 KB	Output is correct
20	Correct	3 ms	604 KB	Output is correct
21	Correct	3 ms	792 KB	Output is correct
22	Correct	3 ms	604 KB	Output is correct
23	Correct	3 ms	604 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	14 ms	604 KB	Output is correct
26	Correct	16 ms	796 KB	Output is correct
27	Correct	11 ms	604 KB	Output is correct
28	Correct	18 ms	796 KB	Output is correct
29	Correct	17 ms	796 KB	Output is correct
30	Correct	20 ms	604 KB	Output is correct