답안 #938763

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938763 2024-03-05T14:02:07 Z Alebn Kitchen (BOI19_kitchen) C++14
31 / 100
2 ms 348 KB
#include <bits/stdc++.h>
#define int long long
#define M 16

using namespace std;

int n, m, k, A = 0, B = 0, res = -1;
bool flag = false;
vector<int> a, b;

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];
    }
    // try every subset
    vector<int> diff;
    bitset<M> bin;
    int sus, sum;
    bool check;
    for(int i = 0; i < (1 << m); i++) {
        sum = 0, sus = 0;
        for(int j = 0; j < m; j++) {
            if(i & (1 << j)) {
                sum += b[j];
                sus += min(n, b[j]);
            }
        }
        if(sum >= A && sus >= n * k) {
            if(res == -1) res = sum - A;
            else res = min(res, sum - A);
        }
    }
    if(flag || res == -1) cout << "Impossible\n";
    else cout << res << "\n";
}

Compilation message

kitchen.cpp: In function 'int main()':
kitchen.cpp:27:10: warning: unused variable 'check' [-Wunused-variable]
   27 |     bool check;
      |          ^~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -