oj.uz

Submission #1108247

# Submission time Handle Problem Language Result Execution time Memory
1108247 2024-11-03T13:33:04 Z flyingkite Kitchen (BOI19_kitchen) C++17
21 / 100
 32 ms 191084 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define pll pair<long long, long long>
#define pb push_back
#define F first
#define S second  
#define all(x) (x).begin(), (x).end()
 
const ll N = 305;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll block = 450;
ll n,m,k,sA = 0, sB = 0, sMn = 0;
ll a[N], b[N], dp[N][N * N];
void to_thic_cau(){
    cin >> n >> m >> k;
    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]; sMn += min(b[i], n);
    }
    for(int i = 1; i <= n;i++) if(a[i] < k){cout << "Impossible" << '\n'; return;}
    if(sB < sA){
        cout << "Impossible" << '\n';
        return;
    }
    if(sMn < n * k){
        cout << "Impossible" << '\n';
        return;
    }
    for(int i = 1; i <= m;i++){
        for(int j = 0; j <= sB;j++){
            dp[i][j] = dp[i-1][j];
            if(j >= b[i]) dp[i][j] = max(dp[i][j], dp[i - 1][j - b[i]] + min(n, b[i]));
        }
    }
    for(int j = sA; j <= sB;j++){
        if(dp[m][j] >= n * k){
            cout << j - sA << '\n';
            return;
        }
    }
    cout << "Impossible" << '\n';
}    
 
signed main()   
{  
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll tc = 1;
    //cin >> tc;
    while(tc--) to_thic_cau();
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Incorrect 1 ms 2384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Incorrect 1 ms 2384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 191084 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 31056 KB Output is correct
2 Correct 3 ms 31056 KB Output is correct
3 Correct 3 ms 31056 KB Output is correct
4 Correct 4 ms 31056 KB Output is correct
5 Correct 1 ms 336 KB Output is correct

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Incorrect 1 ms 2384 KB Output isn't correct
3 Halted 0 ms 0 KB -