Submission #378083

#	Time	Username	Problem	Language	Result	Execution time	Memory
378083		rrrr10000	The Big Prize (IOI17_prize)	C++14	20 / 100	560 ms	5248 KiB

prize

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
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 rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pb emplace_back
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){for(auto x:v)outv(x);}
template<class T> void outp(T p){cout<<'('<<p.fi<<','<<p.se<<')'<<endl;}
template<class T> void outvp(T v){for(P p:v)cout<<'('<<p.fi<<','<<p.se<<')';cout<<endl;}
const ll inf=1001001001001001001;
#include "prize.h"
int find_best(int n){
    vi v(n);rep(i,n)v[i]=i;
    auto res=ask(v[0]);
    if(res[0]+res[1]==0)return v[0];
    ll sum=res[0]+res[1];
    vi cnt(n);
    rep(i,sum){
        vi rui=cnt;
        for(int j=n-2;j>=0;j--)rui[j]+=rui[j+1];
        // outv(v);
        ll l=0,r=v.size();
        while(true){
            // outp(P(l,r));
            ll md=(l+r)/2;
            auto t=ask(v[md]);
            if(t[0]+t[1]<sum){
                if(t[0]+t[1]==0)return v[md];
                cnt[v[md]]++;
                v.erase(v.begin()+md);break;
            }
            else if(t[1]==rui[v[md]])r=md;
            else l=md+1;
        }
    }
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:28:11: warning: control reaches end of non-void function [-Wreturn-type]
   28 |     vi v(n);rep(i,n)v[i]=i;
      |           ^

• Subtask 1: 20 / 20
• Subtask 2: 0 / 80