oj.uz

답안 #745812

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
745812 2023-05-21T08:10:32 Z vjudge1 Kitchen (BOI19_kitchen) C++17
9 / 100
 3 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;
#define InTheNameOfGod ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
using ll = long long;

const int maxN = 2e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;


int main() {

/*#ifndef ONLINE_JUDGE
   freopen("../../input.txt", "r", stdin);
   freopen("../../output.txt", "w", stdout);
#endif*/
   InTheNameOfGod;

    int n,m,k;
    cin >>n >> m >> k;

    vector<int> a(n),b(m);
    int s = 0, must = (n)*(k-1);
    bool ok = 0;
    for(int i = 0; i < n; i++)  {
        cin >> a[i];
        s += a[i];
        if(a[i] < k) ok = 1;
    }

    for(int &i : b) cin >> i;

    if(ok || m < k) {
        cout << "Impossible\n";
        return 0;
    }

    int mo = INF;
    for(int mask = 1; mask < (1<<m); mask++) {
        int sum = 0, maxi = -1;
        for(int i = 0; i < m; i++) {
            if((1<<i) & mask) {
                sum += b[i];
                maxi = max(maxi, b[i]);
            }
        }
        /*cout << "mask: " <<mask << endl;
        cout << "sum: " << sum << endl;
        cout << "s: " << s << endl;*/
        if(sum >= s && must <= sum - maxi) {
            mo = min(mo, sum);
        }
    }
    if(mo == INF) cout << "Impossible\n";
    else cout << mo - s;

    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Incorrect 3 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Incorrect 3 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -