oj.uz

답안 #394379

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
394379 2021-04-26T12:59:59 Z rocks03 Kitchen (BOI19_kitchen) C++14
100 / 100
 536 ms 116936 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << ": " << x << " "
#define nl cout << "\n"
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int INF = 1e9;
const int MAXN = 300+10;
int N, M, K, a[MAXN], b[MAXN], memo[MAXN][MAXN * MAXN];
 
void Impossible(){
    cout << "Impossible"; exit(0);
}
 
int f(int i, int sum){
    if(i == M){
        if(sum == 0) return 0;
        else return INF;
    }
    int& ans = memo[i][sum];
    if(ans != INF){
        return ans;
    }
    ans = f(i + 1, sum);
    if(sum - b[i] >= 0){
        ans = min(ans, f(i + 1, sum - b[i]) - min(N, b[i]));
    }
    return ans;
}
 
void solve(){
    cin >> N >> M >> K;
    rep(i, 0, N) cin >> a[i];
    rep(i, 0, M) cin >> b[i];
    int s = 0;
    rep(i, 0, N){
        if(a[i] < K) Impossible();
        s += a[i];
    }
    int sb = 0;
    rep(i, 0, M){
        sb += b[i];
    }
    if(s > sb) Impossible();
    if(M < K) Impossible();
    rep(i, 0, MAXN){
        rep(j, 0, MAXN * MAXN){
            memo[i][j] = INF;
        }
    }
    for(int ans = 0; ans + s <= sb; ans++){
        if(N * K + f(0, ans + s) <= 0){
            cout << ans; return;
        }
    }
    Impossible();
}
 
int main(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    solve();
    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 116804 KB Output is correct
2 Correct 66 ms 116864 KB Output is correct
3 Correct 75 ms 116812 KB Output is correct
4 Correct 74 ms 116892 KB Output is correct
5 Correct 76 ms 116804 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 208 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 116804 KB Output is correct
2 Correct 66 ms 116864 KB Output is correct
3 Correct 75 ms 116812 KB Output is correct
4 Correct 74 ms 116892 KB Output is correct
5 Correct 76 ms 116804 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 64 ms 116800 KB Output is correct
10 Correct 67 ms 116900 KB Output is correct
11 Correct 72 ms 116844 KB Output is correct
12 Correct 70 ms 116792 KB Output is correct
13 Correct 69 ms 116804 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 158 ms 116800 KB Output is correct
2 Correct 168 ms 116908 KB Output is correct
3 Correct 188 ms 116924 KB Output is correct
4 Correct 297 ms 116916 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 170 ms 116912 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 116856 KB Output is correct
2 Correct 69 ms 116868 KB Output is correct
3 Correct 67 ms 116896 KB Output is correct
4 Correct 81 ms 116804 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #5
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 116804 KB Output is correct
2 Correct 66 ms 116864 KB Output is correct
3 Correct 75 ms 116812 KB Output is correct
4 Correct 74 ms 116892 KB Output is correct
5 Correct 76 ms 116804 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 64 ms 116800 KB Output is correct
10 Correct 67 ms 116900 KB Output is correct
11 Correct 72 ms 116844 KB Output is correct
12 Correct 70 ms 116792 KB Output is correct
13 Correct 69 ms 116804 KB Output is correct
14 Correct 158 ms 116800 KB Output is correct
15 Correct 168 ms 116908 KB Output is correct
16 Correct 188 ms 116924 KB Output is correct
17 Correct 297 ms 116916 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 170 ms 116912 KB Output is correct
20 Correct 74 ms 116856 KB Output is correct
21 Correct 69 ms 116868 KB Output is correct
22 Correct 67 ms 116896 KB Output is correct
23 Correct 81 ms 116804 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 266 ms 116912 KB Output is correct
26 Correct 536 ms 116912 KB Output is correct
27 Correct 123 ms 116836 KB Output is correct
28 Correct 184 ms 116936 KB Output is correct
29 Correct 286 ms 116812 KB Output is correct
30 Correct 307 ms 116916 KB Output is correct