oj.uz

Submission #493665

# Submission time Handle Problem Language Result Execution time Memory
493665 2021-12-12T14:15:58 Z Fysty Kitchen (BOI19_kitchen) C++14
100 / 100
 22 ms 1000 KB 
#include <bits/stdc++.h>
#include <random>
#include <chrono>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T> void _do(T x){cerr<<x<<"\n";}
template<typename T,typename ...U> void _do(T x,U ...y){cerr<<x<<", ";_do(y...);}
#define dbg(...) cerr<<#__VA_ARGS__<<" = ";_do(__VA_ARGS__);

const int MOD1=1e9+7;
const int MOD2=998244353;
const ll INF=3e18;
const ld PI=3.14159265358979323846;
ll gcd(ll a,ll b){if(b==0) return a; return gcd(b,a%b);}
ll fpow(ll a,ll b,ll m)
{
    if(!b) return 1;
    ll ans=fpow(a*a%m,b/2,m);
    return (b%2?ans*a%m:ans);
}
ll inv(ll a,ll m) {return fpow(a,m-2,m);}

#define MottoHayaku ios::sync_with_stdio(false);cin.tie(0);
//#define int ll
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define repk(i,m,n) for(int i=m;i<n;i++)
#define F first
#define S second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define uni(c) c.resize(distance(c.begin(),unique(c.begin(),c.end())))
#define unisort(c) sort(c.begin(),c.end()),uni(c)
const int N=301;
ll a[N],b[N],dp[N*N];
signed main()
{
    MottoHayaku
    ll n,m,k;
    cin>>n>>m>>k;
    bool can=1;
    ll suma=0,sumb=0;
    rep1(i,n)
    {
        cin>>a[i];
        if(a[i]<k) can=0;
        suma+=a[i];
    }
    rep1(i,m)
    {
        cin>>b[i];
        sumb+=b[i];
    }
    if(!can)
    {
        cout<<"Impossible";
        return 0;
    }
    rep1(j,sumb) dp[j]=-INF;
    rep1(i,m)
    {
        for(int j=sumb-b[i];j>=0;j--)
        {
            if(dp[j]==-INF) continue;
            dp[j+b[i]]=max(dp[j+b[i]],dp[j]+min(b[i],n));
        }
    }
    ll ans=-1;
    for(int i=suma;i<=sumb;i++)
    {
        if(dp[i]>=n*k)
        {
            ans=i;
            break;
        }
    }
    if(ans==-1) cout<<"Impossible";
    else cout<<ans-suma;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 848 KB Output is correct
2 Correct 14 ms 772 KB Output is correct
3 Correct 13 ms 692 KB Output is correct
4 Correct 22 ms 972 KB Output is correct
5 Correct 22 ms 1000 KB Output is correct
6 Correct 10 ms 716 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 324 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 21 ms 848 KB Output is correct
15 Correct 14 ms 772 KB Output is correct
16 Correct 13 ms 692 KB Output is correct
17 Correct 22 ms 972 KB Output is correct
18 Correct 22 ms 1000 KB Output is correct
19 Correct 10 ms 716 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 12 ms 716 KB Output is correct
26 Correct 14 ms 824 KB Output is correct
27 Correct 6 ms 460 KB Output is correct
28 Correct 13 ms 716 KB Output is correct
29 Correct 17 ms 876 KB Output is correct
30 Correct 21 ms 980 KB Output is correct