oj.uz

Submission #745854

# Submission time Handle Problem Language Result Execution time Memory
745854 2023-05-21T08:48:37 Z vjudge1 Kitchen (BOI19_kitchen) C++17
20 / 100
 118 ms 102112 KB 
#include <bits/stdc++.h>
using namespace std;
#define InTheNameOfGod ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
using ll = long long;

const int maxN = 2e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;


int main() {

/*#ifndef ONLINE_JUDGE
   freopen("../../input.txt", "r", stdin);
   freopen("../../output.txt", "w", stdout);
#endif*/
   InTheNameOfGod;

    int n,m,k;
    cin >>n >> m >> k;

    vector<int> a(n),b(m);
    int s = 0, must = (n)*(k-1);
    bool ok = 0;
    for(int i = 0; i < n; i++)  {
        cin >> a[i];
        s += a[i];
        if(a[i] < k) ok = 1;
    }

    for(int &i : b) cin >> i;

    if(ok || m < k) {
        cout << "Impossible\n";
        return 0;
    }

    vector<vector<int> > dp(m+1, vector<int> (s+1, -1));
    int mo = INF;
    dp[0][0] = n*k;
    for(int i = 0; i < m; i++)  {
        for(int j = 0; j < s; j++) {
            if(dp[i][j] != -1) {
                dp[i+1][j] = min(dp[i+1][j], dp[i][j]);
                if(j + b[i] >= s && dp[i][j] - min(b[i], n) <= 0) mo = min(mo, j+b[i] - s);
                else dp[i+1][j+b[i]] = dp[i][j] - min(b[i], n);
            }

            //cout << i << ", " << j << ": " << dp[i][j] << endl;
        }
    }

    if(mo == INF) cout << "Impossible\n";
    else cout << mo;

    return 0;
}

Compilation message

kitchen.cpp: In function 'int main()':
kitchen.cpp:23:16: warning: unused variable 'must' [-Wunused-variable]
   23 |     int s = 0, must = (n)*(k-1);
      |                ^~~~

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 51932 KB Output is correct
2 Correct 42 ms 45012 KB Output is correct
3 Correct 77 ms 55984 KB Output is correct
4 Correct 114 ms 89852 KB Output is correct
5 Correct 118 ms 102112 KB Output is correct
6 Correct 38 ms 41556 KB Output is correct

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

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