oj.uz

Submission #535594

# Submission time Handle Problem Language Result Execution time Memory
535594 2022-03-10T16:07:35 Z __Variatto Kitchen (BOI19_kitchen) C++17
29 / 100
 26 ms 672 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define ll long long
const int MAX=9e4+10;
int n, m, k, dp[MAX], a, b, suma;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin>>n>>m>>k;
    for(int i=1; i<=n; i++){
        cin>>a;
        if(a<k){
            cout<<"Impossible\n";
            return 0;
        }
        suma+=a;
    }
    int mini=MAX;
    for(int i=1; i<=MAX-2; i++)
        dp[i]=MAX;
    for(int i=1; i<=m; i++){
        cin>>b;
        for(int j=MAX-2; j>=b; j--){
            if(dp[j-b]!=MAX){
                dp[j]=min(dp[j], dp[j-b]+min(n, b));
                if(j>=suma && dp[j]>=n*k)
                    mini=min(mini, j);
            }
        }
    }
    if(mini==MAX)
        cout<<"Impossible\n";
    else
        cout<<mini-suma<<"\n";
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 596 KB Output is correct

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Incorrect 2 ms 596 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 596 KB Output is correct
2 Correct 17 ms 596 KB Output is correct
3 Correct 25 ms 672 KB Output is correct
4 Correct 26 ms 656 KB Output is correct
5 Correct 22 ms 596 KB Output is correct
6 Correct 23 ms 668 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Incorrect 2 ms 596 KB Output isn't correct
10 Halted 0 ms 0 KB -