oj.uz

Submission #146720

# Submission time Handle Problem Language Result Execution time Memory
146720 2019-08-25T14:26:24 Z Vlatko Kitchen (BOI19_kitchen) C++14
100 / 100
 61 ms 1056 KB 
#include <bits/stdc++.h>
using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

typedef long long ll;
typedef pair<int, int> pii;



int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> a(n+1), b(m+1);
    int a_sum = 0, a_min = 1e5, b_sum = 0;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        a_sum += a[i];
        a_min = min(a_min, a[i]);
    }
    for (int i = 1; i <= m; ++i) {
        cin >> b[i];
        b_sum += b[i];
    }
    if (a_min < k || b_sum < a_sum) {
        cout << "Impossible\n";
        return 0;
    }
    vector<int> pre(b_sum+1, -1e5), cur;
    pre[0] = 0;
    for (int i = 1; i <= m; ++i) {
        cur.assign(b_sum+1, -1e5);
        for (int h = 0; h <= b_sum; ++h) {
            if (h < b[i]) {
                cur[h] = pre[h];
            } else {
                cur[h] = max(pre[h], pre[h - b[i]] + min(b[i], n));
            }
        }
        swap(pre, cur);
    }
    int ans = 1e9;
    for (int h = a_sum; h <= b_sum; ++h) {
        if (pre[h] >= n*k) {
            ans = h - a_sum;
            break;
        }
    }
    if (ans == 1e9) {
        cout << "Impossible\n";
    } else {
        cout << ans << '\n';
    }
}

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 916 KB Output is correct
2 Correct 32 ms 760 KB Output is correct
3 Correct 36 ms 764 KB Output is correct
4 Correct 59 ms 1016 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 27 ms 760 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 43 ms 916 KB Output is correct
15 Correct 32 ms 760 KB Output is correct
16 Correct 36 ms 764 KB Output is correct
17 Correct 59 ms 1016 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 27 ms 760 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 31 ms 864 KB Output is correct
26 Correct 39 ms 988 KB Output is correct
27 Correct 13 ms 512 KB Output is correct
28 Correct 31 ms 760 KB Output is correct
29 Correct 44 ms 888 KB Output is correct
30 Correct 61 ms 1056 KB Output is correct