oj.uz

답안 #938726

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938726 2024-03-05T13:29:12 Z vjudge1 Kitchen (BOI19_kitchen) C++17
9 / 100
 77 ms 428 KB 
#include <bits/stdc++.h>
#define int long long
#define M 301
 
using namespace std;
 
int n, m, k, A = 0, B = 0, res = LLONG_MAX;
bool flag = false;
vector<int> a, b;
vector<vector<bool>> dp;
 
signed main() {
    cin >> n >> m >> k;
    a = vector<int>(n), b = vector<int>(m);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        A += a[i];
        if(a[i] < k) flag = true;
    }
    for(int i = 0; i < m; i++) {
        cin >> b[i];
        B += b[i];
    }
    if(k >= 1) {
        // try every subset
    vector<int> diff;
    bitset<M> bin;
    int temp, sum;
    bool check;
    for(int i = 0; i < (1 << m); i++) {
        bin = bitset<M>(i), diff = vector<int>(n, k), sum = 0, check = true;
        for(int j = 0; j < M; j++) {
            if(bin[j]) {
                sum += b[j];
                temp = b[j];
                for(int k = 0; k < n && temp; k++) {
                    if(diff[k]) {
                        diff[k]--;
                        temp--;
                    }
                }
            }
        }
        for(int j = 0; j < n; j++) {
            if(diff[j]) {
                check = false;
                break;
            }
        }
        if(check && sum >= A) res = min(res, sum - A);
    }
    if(flag || res == LLONG_MAX) cout << "Impossible\n";
    else cout << res << "\n";
    return 0;
    }
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 11 ms 424 KB Output is correct
10 Correct 10 ms 348 KB Output is correct
11 Correct 13 ms 348 KB Output is correct
12 Correct 17 ms 428 KB Output is correct
13 Incorrect 77 ms 344 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 11 ms 424 KB Output is correct
10 Correct 10 ms 348 KB Output is correct
11 Correct 13 ms 348 KB Output is correct
12 Correct 17 ms 428 KB Output is correct
13 Incorrect 77 ms 344 KB Output isn't correct
14 Halted 0 ms 0 KB -