oj.uz

Submission #124892

# Submission time Handle Problem Language Result Execution time Memory
124892 2019-07-04T05:40:03 Z 박상수(#3055) Kitchen (BOI19_kitchen) C++14
100 / 100
 141 ms 110156 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_set>
#include <bitset>
#include <time.h>
#include <limits.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define Fi first
#define Se second
#define pb push_back
#define szz(x) (int)x.size()
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) x.begin(),x.end()
typedef tuple<int, int, int> t3;

int N, M, K, A[310], B[310];
bitset <90090> X;
int dp[310][90090];

int main() {
    scanf("%d%d%d", &N, &M, &K);
    for(int i=1;i<=N;i++) scanf("%d", A + i);
    sort(A+1, A+1+N);
    int sa = 0; for(int i=1;i<=N;i++) sa += A[i];
    for(int i=1;i<=M;i++) scanf("%d", B + i);
    sort(B+1, B+1+M, greater<int>());
    auto NO = [&]() { puts("Impossible"); exit(0); };
    for(int i=1;i<=N;i++) if(A[i] < K) NO();
    int ans = 1e9;
    memset(dp, -1, sizeof dp);
    dp[0][0] = 0;
    int sb = 0;
    for(int i=1;i<=M;i++) if(B[i] >= N) ++sb;

    auto upd = [&](int &a, int b) { if(a < b) a = b; };
    for(int i=0;i<sb;i++) {
        for(int j=0;j<90090;j++) if(dp[i][j] != -1) {
            upd(dp[i+1][j], dp[i][j]);
            upd(dp[i+1][j+B[i+1]], dp[i][j] + 1);
        }
    }
    X[0] = 1;
    for(int i=M-1;i>=sb;i--) {
        X = (X | (X << B[i+1]));
    }
    int nx[90090] = {};
    nx[90089] = -1;
    for(int i=90088;i>=0;i--) {
        if(X[i]) nx[i] = i;
        else nx[i] = nx[i+1];
    }
    rep(a, 90090) if(dp[sb][a] != -1) {
        int b = dp[sb][a];
        int c = max({0, (K - b) * N, sa - a});
        if(nx[c] != -1) {
            ans = min(ans, a + nx[c]);
        }
    }

    if(ans > 1e8) NO();
    else printf("%d\n", ans - sa);
    return 0;
}

Compilation message

kitchen.cpp: In function 'int main()':
kitchen.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &N, &M, &K);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
kitchen.cpp:38:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=N;i++) scanf("%d", A + i);
                           ~~~~~^~~~~~~~~~~~~
kitchen.cpp:41:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=M;i++) scanf("%d", B + i);
                           ~~~~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 109944 KB Output is correct
2 Correct 92 ms 109916 KB Output is correct
3 Correct 92 ms 109976 KB Output is correct
4 Correct 92 ms 110072 KB Output is correct
5 Correct 92 ms 110156 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 94 ms 109944 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 109944 KB Output is correct
2 Correct 92 ms 109916 KB Output is correct
3 Correct 92 ms 109976 KB Output is correct
4 Correct 92 ms 110072 KB Output is correct
5 Correct 92 ms 110156 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 94 ms 109944 KB Output is correct
9 Correct 94 ms 109916 KB Output is correct
10 Correct 93 ms 109944 KB Output is correct
11 Correct 93 ms 109980 KB Output is correct
12 Correct 93 ms 110072 KB Output is correct
13 Correct 93 ms 109944 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 109944 KB Output is correct
2 Correct 103 ms 110100 KB Output is correct
3 Correct 94 ms 110076 KB Output is correct
4 Correct 120 ms 109944 KB Output is correct
5 Correct 99 ms 110072 KB Output is correct
6 Correct 94 ms 110072 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 110072 KB Output is correct
2 Correct 94 ms 109956 KB Output is correct
3 Correct 109 ms 109944 KB Output is correct
4 Correct 93 ms 110072 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 91 ms 109944 KB Output is correct
2 Correct 92 ms 109916 KB Output is correct
3 Correct 92 ms 109976 KB Output is correct
4 Correct 92 ms 110072 KB Output is correct
5 Correct 92 ms 110156 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 94 ms 109944 KB Output is correct
9 Correct 94 ms 109916 KB Output is correct
10 Correct 93 ms 109944 KB Output is correct
11 Correct 93 ms 109980 KB Output is correct
12 Correct 93 ms 110072 KB Output is correct
13 Correct 93 ms 109944 KB Output is correct
14 Correct 93 ms 109944 KB Output is correct
15 Correct 103 ms 110100 KB Output is correct
16 Correct 94 ms 110076 KB Output is correct
17 Correct 120 ms 109944 KB Output is correct
18 Correct 99 ms 110072 KB Output is correct
19 Correct 94 ms 110072 KB Output is correct
20 Correct 96 ms 110072 KB Output is correct
21 Correct 94 ms 109956 KB Output is correct
22 Correct 109 ms 109944 KB Output is correct
23 Correct 93 ms 110072 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 133 ms 109944 KB Output is correct
26 Correct 118 ms 109944 KB Output is correct
27 Correct 104 ms 109944 KB Output is correct
28 Correct 112 ms 110072 KB Output is correct
29 Correct 141 ms 109944 KB Output is correct
30 Correct 113 ms 109980 KB Output is correct