oj.uz

Submission #492538

# Submission time Handle Problem Language Result Execution time Memory
492538 2021-12-07T19:29:02 Z niloyroot Kitchen (BOI19_kitchen) C++14
9 / 100
 2 ms 460 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pl = pair<ll,ll>;
#define pb push_back
#define form(m,it) for(auto it=m.begin(); it!=m.end(); it++)
#define forp(i,a,b) for(ll i=a; i<=b; i++)
#define forn(i,a,b) for(ll i=a; i>=b; i--)
#define newl '\n'
#define ff first
#define ss second
const ll mod = 1000000007;

void solve(){
    ll n,m,k; cin>>n>>m>>k;
    ll a[n+1];
    ll b[n+1];
    ll sum=0;
    forp(i,1,n){
        cin>>a[i];
        sum+=a[i];
    }
    forp(i,1,m){
        cin>>b[i];
    }

    forp(i,1,n){
        if(a[i]<k){
            cout<<"Impossible"<<newl; return;
        }
    }

    ll ans=INT_MAX;
    ll temp,cnt;
    forp(i,0,(1<<m)-1){
        temp=0;
        cnt=0;
        forp(j,0,m-1){
            if(i&(1<<j)){
                temp+=b[j+1];
                cnt+=(min(n,b[j+1]));
            }
        }

        if(temp>=sum){
            if(cnt>=n*k){
                ans=min(ans,temp-sum);
            }
        }
    }
    if(ans==INT_MAX){
        cout<<"Impossible"<<newl;
    } else {
        cout<<ans<<newl;
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t=1; //cin>>t;
    while(t--)solve();
}

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Runtime error 1 ms 460 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 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 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Runtime error 1 ms 460 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -