oj.uz

Submission #697942

# Submission time Handle Problem Language Result Execution time Memory
697942 2023-02-11T14:07:10 Z jiahng Kitchen (BOI19_kitchen) C++14
100 / 100
 234 ms 199320 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define int ll
typedef pair<int, int> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair <pi,pi> pipi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 310
#define INF (ll)1e18
#define MOD 998244353
typedef pair <vi, int> pvi;
typedef pair <int,pi> ipi;
typedef vector <pii> vpii;
#define DEBUG 0
#pragma GCC optimize("trapv")
int N,M,K,A[maxn],B[maxn];
int dp[maxn][maxn*maxn];

int32_t main(){
    cin >> N >> M >> K;
    FOR(i,1,N) cin >> A[i];
    FOR(i,1,M) cin >> B[i];
    int sumA = accumulate(A+1,A+N+1,0);
    int sumB = accumulate(B+1,B+M+1,0);

    if (sumA > sumB){
        cout << "Impossible"; return 0;
    }

    FOR(i,1,N){
        if (A[i] < K){
            cout << "Impossible"; return 0;
        }
    }
    dp[M+1][0] = 0;
    FOR(j,1,sumB) dp[M+1][j] = -INF;
    DEC(i,M,1){
        FOR(j,0,sumB){
            if (j >= B[i]) dp[i][j] = max(dp[i+1][j], dp[i+1][j-B[i]] + min(B[i], N));
            else dp[i][j] = dp[i+1][j];
        }
    }
    FOR(j,sumA,sumB) if (dp[1][j] >= K*N){
        cout << j - sumA; return 0;
    }
    cout << "Impossible";
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 688 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 436 KB Output is correct
13 Correct 1 ms 824 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 136632 KB Output is correct
2 Correct 119 ms 102224 KB Output is correct
3 Correct 149 ms 114772 KB Output is correct
4 Correct 234 ms 195800 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 99 ms 83164 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 944 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 944 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 688 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 436 KB Output is correct
13 Correct 1 ms 824 KB Output is correct
14 Correct 158 ms 136632 KB Output is correct
15 Correct 119 ms 102224 KB Output is correct
16 Correct 149 ms 114772 KB Output is correct
17 Correct 234 ms 195800 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 99 ms 83164 KB Output is correct
20 Correct 1 ms 944 KB Output is correct
21 Correct 1 ms 724 KB Output is correct
22 Correct 1 ms 852 KB Output is correct
23 Correct 1 ms 944 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 117 ms 99852 KB Output is correct
26 Correct 150 ms 123764 KB Output is correct
27 Correct 41 ms 37196 KB Output is correct
28 Correct 116 ms 101684 KB Output is correct
29 Correct 154 ms 139160 KB Output is correct
30 Correct 220 ms 199320 KB Output is correct