oj.uz

답안 #745974

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
745974 2023-05-21T10:17:15 Z vjudge1 Kitchen (BOI19_kitchen) C++17
20 / 100
 59 ms 324 KB 
#include <bits/stdc++.h>

#define ll long long

using namespace std;

const ll MOD = 1e9+7;

#define IMPOSSIBLE {cout<<"Impossible"<<endl;return 0;}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, m, k; cin>>n>>m>>k;
    int s = 0;
    for(int i = 0; i < n; i++){
        int a; cin>>a;s += a;
    }
    vector<bool> v(90001);
    v[0] = true;
    int mx = 1e9;
    for(int i = 0; i < m; i++){
        int b; cin>>b;
        for(int j = 90000; j-b >= 0; j--){
            if(v[j-b])v[j]=true;
            if(v[j] && j >= s){
                mx = min(mx, j);
            }
        }
    }
    if(mx == 1e9)IMPOSSIBLE
    else {
        cout<<mx-s<<endl;
    }


    // int n, m, k; cin>>n>>m>>k;
    // vector<int> a(n);
    // int s = 0;
    // for(int&i:a){cin>>i;s += i;}
    // vector<int> b(m);
    // int sb = 0;
    // for(int&i:b){cin>>i;sb += i;}
    // if(k > m) IMPOSSIBLE
    // for(int i : a){
    //     if(i < k) IMPOSSIBLE;
    // }
    // if(s > sb) IMPOSSIBLE;
    // if(m == 1){
    //     cout<<sb - s<<endl;
    //     return 0;
    // }
    // if(k == 2){
    //     if(b[0] < n || b[1] < n)IMPOSSIBLE
    //     cout<<b[0]+b[1]-s<<endl;
    // } else {
    //     int egy = min(b[0], b[1]);
    //     if(egy < s) cout<<sb-s<<endl;
    //     else cout<<egy-s<<endl;
    // }
    return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 212 KB Output is correct
2 Correct 42 ms 212 KB Output is correct
3 Correct 51 ms 212 KB Output is correct
4 Correct 56 ms 312 KB Output is correct
5 Correct 59 ms 324 KB Output is correct
6 Correct 39 ms 212 KB Output is correct

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

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