oj.uz

Submission #928774

# Submission time Handle Problem Language Result Execution time Memory
928774 2024-02-17T05:38:56 Z Sir_Ahmed_Imran Kitchen (BOI19_kitchen) C++17
72 / 100
 177 ms 262144 KB 
                              ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define append push_back
#define add insert
#define nl "\n"
#define ff first
#define ss second
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL)
#define N 90001
#define M 89701
bitset<M> dp[N];
void solve(){
    int n,m,o,p,q,r;
    bitset<M> tmp;
    cin>>n>>m>>o;
    dp[0][0]=1;
    r=0;
    for(int i=0;i<n;i++){
        cin>>p;
        r+=p;
        if(p<o){
            cout<<"Impossible";
            return;
        }
    }
    r-=n*o;
    for(int i=0;i<m;i++){
        cin>>p;
        q=max(0,p-n);
        p-=q;
        for(int j=n*o;j>=0;j--){
            tmp=(dp[j]<<(q+max(0,p+j-n*o)));
            dp[min(j+p,n*o)]|=tmp;
        }
    }
    for(int i=0;r+i<N;i++){
        if(dp[n*o][r+i]){
            cout<<i;
            return;
        }
    }
    cout<<"Impossible";
}
int main(){
    L0TA;
    solve();
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 7 ms 2652 KB Output is correct
12 Correct 3 ms 1884 KB Output is correct
13 Correct 68 ms 21136 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 860 KB Output is correct
2 Correct 118 ms 1112 KB Output is correct
3 Correct 140 ms 3416 KB Output is correct
4 Correct 165 ms 600 KB Output is correct
5 Correct 161 ms 600 KB Output is correct
6 Correct 111 ms 3716 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 8796 KB Output is correct
2 Correct 45 ms 7772 KB Output is correct
3 Correct 34 ms 7772 KB Output is correct
4 Correct 99 ms 16332 KB Output is correct
5 Correct 1 ms 344 KB Output is correct

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 7 ms 2652 KB Output is correct
12 Correct 3 ms 1884 KB Output is correct
13 Correct 68 ms 21136 KB Output is correct
14 Correct 139 ms 860 KB Output is correct
15 Correct 118 ms 1112 KB Output is correct
16 Correct 140 ms 3416 KB Output is correct
17 Correct 165 ms 600 KB Output is correct
18 Correct 161 ms 600 KB Output is correct
19 Correct 111 ms 3716 KB Output is correct
20 Correct 74 ms 8796 KB Output is correct
21 Correct 45 ms 7772 KB Output is correct
22 Correct 34 ms 7772 KB Output is correct
23 Correct 99 ms 16332 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Runtime error 177 ms 262144 KB Execution killed with signal 9
26 Halted 0 ms 0 KB -