oj.uz

Submission #949434

# Submission time Handle Problem Language Result Execution time Memory
949434 2024-03-19T08:47:33 Z Darren0724 Kitchen (BOI19_kitchen) C++17
52 / 100
 161 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define int long long
#define all(x) x.begin(), x.end()
#define endl '\n'
#define no cout<<"Impossible"<<endl;return 0;
const int N=200005;
const int INF=1e18;

int32_t main() {
    LCBorz;
    int n,m,k;cin>>n>>m>>k;
    if(m<k){
        no;
    }
    vector<int> a(n),b(m);
    int total=0,ta=0,tb=0;
    for(int i=0;i<n;i++){
        cin>>a[i];
        if(a[i]<k){
            no;
        }
        total+=a[i];
    }
    for(int i=0;i<m;i++){
        cin>>b[i];
        ta+=b[i];
        tb+=min(n,b[i]);
    }
    vector dp(ta+1,vector(tb+1,0));
    dp[0][0]=1;
    for(int i=0;i<m;i++){
        for(int j=ta;j>=b[i];j--){
            int tmp=min(b[i],n);
            for(int j1=tb;j1>=tmp;j1--){
                dp[j][j1]|=dp[j-b[i]][j1-tmp];
            }
        }
    }
    /*for(int i=0;i<=ta;i++){
        for(int j=0;j<=tb;j++){
            cout<<dp[i][j]<<' ';
        }
        cout<<endl;
    }*/
    int ans=-1;
    for(int i=total;i<=ta;i++){
        for(int j=k*n;ans==-1&&j<=tb;j++){
            if(dp[i][j]){
                ans=i;break;
            }
        }
    }
    if(ans==-1){
        no;
    }
    else{
        cout<<ans-total<<endl;
    }

    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 452 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 1884 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 161 ms 60096 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 108 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 5208 KB Output is correct
2 Correct 12 ms 2908 KB Output is correct
3 Correct 28 ms 6236 KB Output is correct
4 Correct 42 ms 9308 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 452 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 1884 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 161 ms 60096 KB Output is correct
14 Runtime error 108 ms 262144 KB Execution killed with signal 9
15 Halted 0 ms 0 KB -