oj.uz

Submission #648505

# Submission time Handle Problem Language Result Execution time Memory
648505 2022-10-06T18:36:50 Z Lobo Kitchen (BOI19_kitchen) C++17
30 / 100
 1000 ms 136116 KB 
#include<bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

const int maxn = 303;

int n, m, k, a[maxn], b[maxn];
int m1, m2, b1[maxn], b2[maxn], mv1, mv2;
int dp1[maxn][maxn*maxn], dp2[maxn][maxn*maxn];

void solve() {
    cin >> n >> m >> k;

    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for(int i = 1; i <= m; i++) {
        cin >> b[i];
    }

    int sma = 0;
    for(int i = 1; i <= n; i++) {
        sma+= a[i];
        if(a[i] < k) {
            cout << "Impossible" << endl;
            return;
        }
    }
    int smb = 0;
    for(int i = 1; i <= m; i++) {
        smb+= b[i];
        if(b[i] <= n) {
            b1[++m1] = b[i];
            mv1+= b[i];
        }
        else {
            b2[++m2] = b[i];
            mv2+= b[i];
        }
    }

    if(m < k || smb < sma) {
        cout << "Impossible" << endl;
        return;
    }

    dp1[0][0] = 1;
    for(int i = 1; i <= m1; i++) {
        for(int j = 0; j <= mv1; j++) {
            dp1[i][j] = dp1[i-1][j];
            if(j-b1[i] >= 0) dp1[i][j]|= dp1[i-1][j-b1[i]];
        }
    }

    dp2[0][0] = 0;
    for(int i = 1; i <= mv2; i++) dp2[0][i] = -inf;
    for(int i = 1; i <= m2; i++) {
        for(int j = 0; j <= mv2; j++) {
            dp2[i][j] = dp2[i-1][j];
            if(j-b2[i] >= 0) dp2[i][j] = max(dp2[i][j],dp2[i-1][j-b2[i]]+1);
        }
    }

    int ans = inf;
    for(int i = 0; i <= mv1; i++) {
        if(dp1[m1][i] == 0) continue;
        for(int j = 0; j <= mv2; j++) {
            if(dp2[m2][j] >= 0 && i+j >= sma && i+dp2[m2][j]*n >= n*k) {
                ans = min(ans, i+j-sma);
            }
        }
    }
    cout << ans << endl;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);
    int tt = 1;
    // cin >> tt;
    while(tt--) {
        solve();
    }

}

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 136116 KB Output is correct
2 Correct 50 ms 101784 KB Output is correct
3 Correct 124 ms 107272 KB Output is correct
4 Execution timed out 1098 ms 106224 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 840 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #5
0 / 28.0

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