oj.uz

답안 #264931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
264931 2020-08-14T11:22:03 Z Hehehe Kitchen (BOI19_kitchen) C++14
0 / 100
 80 ms 99576 KB 
#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<long double, long double>
#define sz(x) (int)((x).size())
//#define int long long

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

const ll inf = 2e9;
const ll mod = 1e9 + 7;
const int N = 3e2 + 11;
const ll INF64 = 3e18 + 1;
const double eps = 1e-14;
const double PI = acos(-1);

//ifstream in(".in");
//ofstream out(".out");

int n, m, k, a[N], b[N], dp[N][N*N], s;


void solve(){

    cin >> n >> m >> k;

    for(int i = 1; i <= n; i++){
        cin >> a[i];
        s += a[i];
        if(a[i] < k)cout << "Impossible" << '\n';
    }

    for(int i = 1; i <= m; i++){
        cin >> b[i];
    }

    for(int i = 1; i < N*N; i++)dp[0][i] = -inf;

    for(int i = 1; i <= m; i++){
        for(int j = 1; j < N*N; j++){
            dp[i][j] = dp[i - 1][j];
            if(b[i] <= j){
                dp[i][j] = max(dp[i][j], dp[i - 1][j - b[i]] + min(n, b[i]));
            }
        }
    }

    for(int i = 1; i < N*N; i++){
        if(dp[m][i] >= k*n){
            cout << i - s << '\n';
            return;
        }
    }


    cout << "Impossible" << '\n';
}



int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);

    //cout << setprecision(6) << fixed;

    int T = 1;
    //cin >> T;
    while(T--){
        solve();
    }
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

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