oj.uz

Submission #441320

# Submission time Handle Problem Language Result Execution time Memory
441320 2021-07-04T23:47:58 Z zaneyu Kitchen (BOI19_kitchen) C++14
21 / 100
 16 ms 688 KB 
/*input
3 3 3
3 3 2
3 3 3
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=1e18+1;
const int INF=0x3f3f3f3f;
int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-3;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return (a*b)%MOD;
}
inline ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const int maxn=300+5;
const int maxlg=__lg(maxn)+2;
void die(){
    cout<<"Impossible";
    exit(0);
}
int a[maxn],b[maxn];
int dp[maxn*maxn],ndp[maxn*maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m,k;
    cin>>n>>m>>k;
    int sa=0;
    REP(i,n){
        cin>>a[i];
        sa+=a[i];
        if(a[i]<k) die();
    }
    REP1(j,maxn-1) dp[j]=-INF;
    dp[0]=0;
    REP(i,m){
        int x;
        cin>>x;
        for(int j=maxn*maxn-1;j>=x;j--){
            MXTO(dp[j],dp[j-x]+min(x,n));
        }
    }
    for(int i=sa;i<maxn*maxn;i++){
        if(dp[i]>=n*k){
            cout<<i-sa;
            return 0;
        }
    }
    die();
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Incorrect 1 ms 588 KB Output isn't correct

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Incorrect 1 ms 588 KB Output isn't correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 688 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 3 ms 588 KB Output is correct
2 Correct 3 ms 580 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 3 ms 584 KB Output is correct
5 Correct 0 ms 332 KB Output is correct

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Incorrect 1 ms 588 KB Output isn't correct