oj.uz

답안 #991226

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
991226 2024-06-01T15:28:08 Z VMaksimoski008 Kitchen (BOI19_kitchen) C++17
100 / 100
 61 ms 100184 KB 
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

int dp[305][305*305];

int32_t main() {
    int n, m, k;
    cin >> n >> m >> k;

    vector<int> A(n+1), B(m+1);
    for(int i=1; i<=n; i++) cin >> A[i];
    for(int i=1; i<=m; i++) cin >> B[i];
    sort(A.begin() + 1, A.end());
    sort(B.begin() + 1, B.end());

    if(A[1] < k || m < k) {
        cout << "Impossible\n";
        return 0;
    }

    if(k == 1) {
        ll sum = 0;
        for(int i=1; i<=n; i++) sum += A[i];

        bitset<maxn> bs;
        bs[0] = 1;
        
        for(int i=1; i<=m; i++) bs |= (bs << B[i]);

        for(int i=sum; i<=300*300; i++) {
            if(bs[i]) {
                cout << i - sum << '\n';
                return 0;
            }
        }

        cout << "Impossible\n";
        return 0;
    }

    if(m <= 20) {
        ll ans = 1e18;
        ll sum = 0;
        for(int i=1; i<=n; i++) sum += A[i];
        //cout << sum << '\n';
 
        for(int s=1; s<(1<<(m+1)); s++) {
            if(s & 1) continue;
            if(__builtin_popcount(s) < k) continue;
            
            int sum2=0, area=0;
 
            for(int i=1; i<=m; i++) {
                if(s & (1 << i)) {
                    sum2 += B[i];
                    if(area < n * k) area += min(B[i], n);
                }
            }
 
            if(sum2 >= sum && area >= n * k) ans = min(ans, sum2 - sum);
        }
 
        if(ans == 1e18) cout << "Impossible\n";
        else cout << ans << '\n';
        return 0;
    }

    ll sumA = 0, sumB = 0;
    for(int i=1; i<=n; i++) sumA += A[i];
    for(int i=1; i<=m; i++) sumB += B[i];
    
    for(int i=1; i<=m; i++) {
        for(int j=0; j<=sumB; j++) {
            dp[i][j] = dp[i-1][j];
            if(j >= B[i]) dp[i][j] = max(dp[i][j], dp[i-1][j-B[i]] + min(n, B[i]));
        }
    }

    for(int i=sumA; i<=sumB; i++) {
        if(dp[m][i] >= n * k) {
            cout << i - sumA << '\n';
            return 0;
        }
    }
    
    cout << "Impossible\n";
    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 476 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 476 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 476 KB Output is correct
6 Correct 1 ms 472 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 860 KB Output is correct
2 Correct 0 ms 608 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 476 KB Output is correct
14 Correct 1 ms 476 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 476 KB Output is correct
19 Correct 1 ms 472 KB Output is correct
20 Correct 0 ms 860 KB Output is correct
21 Correct 0 ms 608 KB Output is correct
22 Correct 0 ms 860 KB Output is correct
23 Correct 0 ms 860 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 32 ms 50388 KB Output is correct
26 Correct 38 ms 62300 KB Output is correct
27 Correct 13 ms 19004 KB Output is correct
28 Correct 32 ms 51284 KB Output is correct
29 Correct 52 ms 69980 KB Output is correct
30 Correct 61 ms 100184 KB Output is correct