oj.uz

답안 #377318

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
377318 2021-03-13T21:45:51 Z hhh07 Kitchen (BOI19_kitchen) C++14
0 / 100
 3 ms 1900 KB 
#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <climits>
#include <vector>
#include <queue>
#include <utility>
#include <iomanip>
#include <cstring>
#include <fstream>

using namespace std;

typedef unsigned long long ll;
typedef pair<ll, ll> ii;


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll n, m, k;
    cin >> n >> m >> k;
    ll a[n], b[m];
    ll sum = 0;
    for (ll i = 0; i < n; i++){
        cin >> a[i];
        sum += a[i];
        if (a[i] < k){
            cout << "Impossible";
            return 0;
        }
    }
    for (ll i = 0; i < m; i++)
        cin >> b[i];
    
    if (k > m){
        cout << "Impossible";
        return 0;
    }
    
    vector<ll> dp(90001, (ll)-1e6);
    dp[0] = 0;
    for (ll i = 0; i < m; i++){
        for (ll j = 90000 - b[i]; j >= 0 ; j--){
            dp[j + b[i]] = max(dp[j + b[i]], dp[j] + min(n, b[i]));
        }
    }
    
    for (ll i = sum; i < 90001; i++){
        if (dp[i] >= n*k){
            cout << i - sum << endl;
            return 0;
        }
    }
    cout << "Impossible";
    return 0;

}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 1900 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 1900 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 1900 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 1900 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 1900 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -