Submission #604483

#	Time	Username	Problem	Language	Result	Execution time	Memory
604483		rrrr10000	Packing Biscuits (IOI20_biscuits)	C++14	77 / 100	690 ms	3696 KiB

biscuits

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll,ll> P;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<bool> vb;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define all(a) a.begin(),a.end()
#define fi first
#define se second
#define pb emplace_back
template<class T> void out(T a){cout<<a<<endl;}
ll vec[200005];
ll count_tastiness(ll K,vi v){
    ll n=61;
    while(v.size()<n)v.pb(0);
    if(K<=10000){
        map<ll,ll> dp;
        dp[0]++;
        rep(i,n){
            map<ll,ll> ndp;
            for(auto x:dp){
                ndp[(x.fi+v[i])/2]+=x.se;
                if(x.fi+v[i]>=K)ndp[(x.fi+v[i]-K)/2]+=x.se;
            }
            dp=ndp;
        }
        ll ans=0;
        for(auto x:dp)ans+=x.se;
        return ans;
    }
    vi rui(n);
    rep(i,n)rui[i]=v[i]<<i;
    rep(i,n-1)rui[i+1]+=rui[i];
    rep(i,n)rui[i]/=K;
    vec[0]=0;
    ll cnt=1;
    rep(i,n){
        ll k=1ll<<i,l=lower_bound(vec,vec+cnt,rui[i]-k+1)-vec;
        rep(j,l)vec[cnt++]=vec[j]+k;
    }
    return cnt;
}

Compilation message (stderr)

biscuits.cpp: In function 'll count_tastiness(ll, vi)':
biscuits.cpp:20:19: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   20 |     while(v.size()<n)v.pb(0);
      |           ~~~~~~~~^~

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 21 / 21
• Subtask 4: 35 / 35
• Subtask 5: 0 / 23