oj.uz

답안 #493104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
493104 2021-12-10T05:36:04 Z wiwiho Kitchen (BOI19_kitchen) C++14
0 / 100
 1000 ms 43664 KB 
#include <bits/stdc++.h>
 
#define printv(a, b) {\
    for(auto pv : a) b << pv << " ";\
    b << "\n";\
}
 
using namespace std;
 
typedef long long ll;
 
const ll MAX = INT_MAX;
 
void nosol(){
    cout << "Impossible\n";
    exit(0);
}
 
int n, m, k;
vector<int> a;
vector<int> b;
ll sa = 0;
 
const int SZ = 40;
 
ll calc(int h){
    
    vector<vector<ll>> dp(m + 2, vector<ll>((m + 1) * SZ + 10, -MAX));
    dp[0][0] = 0;
    for(int i = 1; i <= m; i++){
        vector<vector<ll>> dp2 = dp;
        
        for(int j = 0; j <= i; j++){
            for(int s = 0; s <= m * SZ; s++){
                ll tmp = dp[j][s] + min(b[i], h + 1);
                int nxt = j + (b[i] >= h);
                dp2[nxt][s + b[i]] = max(dp2[nxt][s + b[i]], tmp);
            }
        }
 
        dp.swap(dp2);
    }
 
    ll ans = MAX;
    for(int i = k; i <= m; i++){
        for(int j = sa; j <= m * SZ; j++){
            if(dp[i][j] >= n * k) ans = min(ans, j - sa);
        }
    }
 
    return ans;
}
 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cerr.tie(0);
 
    cin >> n >> m >> k;
    a.resize(n + 1);
    b.resize(m + 1);
 
    ll sb = 0;
    for(int i = 1; i <= n; i++) cin >> a[i], sa += a[i];
    for(int i = 1; i <= m; i++) cin >> b[i], sb += b[i];
    sort(a.begin() + 1, a.end(), greater<>());
    sort(b.begin() + 1, b.end(), greater<>());
    
    if(k > m || sa > sb){
        nosol();
    }
 
    for(int i = 1; i <= n; i++) if(a[i] < k) nosol();
 
    ll ans = MAX;
    for(int i = 0; i <= SZ; i++){
        ans = min(ans, calc(i));
    }
    if(ans == MAX) nosol();
    cout << ans << "\n";
 
    return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1086 ms 43664 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

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