oj.uz

Submission #1083448

# Submission time Handle Problem Language Result Execution time Memory
1083448 2024-09-03T08:15:25 Z browntoad Kitchen (BOI19_kitchen) C++14
0 / 100
 52 ms 95316 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
// #define int ll
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n+1)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define RREP1(i, n) for (int i = (n); i >= 1; i--)
#define pii pair<int, int>
#define ppi pair<pii, int>
#define pip pair<int, pii>
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)((x).size())
#define f first
#define s second
#define pb push_back
#define endl '\n'
#define IOS() ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)

const ll maxn = 305;
const ll mod = 1e9+7;
const ll inf = 1ll<<60;

ll mpw(ll a, ll p, ll m = mod){
    ll ret = 1;
    while(p > 0){
        if (p & 1){
            ret *= a;
            ret %= m;
        }
        p >>= 1;
        a *= a;
        a %= m;
    }
    return ret;
}
ll inv(ll a){
    return mpw(a, mod-2);
}

int n, m, k;

int dp[maxn][maxn*maxn];
signed main(){
    IOS();
    cin>>n>>m>>k;

    int tot = 0;
    REP(i, n){
        int tt; cin>>tt;
        tot += tt;
        if (tt < k){
            cout<<"Impossible"<<endl;
            return 0;
        }
    }

    REP1(i, m){
        int b; cin>>b;
        REP(j, maxn*maxn){
            dp[i][j] = dp[i-1][j];
            if (j >= b) dp[i][j] = max(dp[i][j], dp[i-1][j-b] + min(b, n));
        }
    }

    int ret = -1;
    REP(i, maxn*maxn){
        if (dp[m][i] >= n*k){
            ret = i;
            break;
        }
    }

    if (ret == -1) cout<<"Impossible"<<endl;
    else {
        cout<<ret-tot<<endl;
    }
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Incorrect 1 ms 1116 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Incorrect 1 ms 1116 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14940 KB Output is correct
2 Correct 8 ms 14940 KB Output is correct
3 Incorrect 8 ms 14940 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Incorrect 1 ms 1116 KB Output isn't correct
3 Halted 0 ms 0 KB -