| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 378085 | rrrr10000 | The Big Prize (IOI17_prize) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
int N;
vi t;
ll cnt=0;
vi Ask(int i){
/*// out(i);
vi res(2);
rep(j,i)if(t[j]<t[i])res[0]++;
REP(j,i+1,N)if(t[j]<t[i])res[1]++;
// outv(res);
return res;*/
assert((++cnt)<9995);
return ask(i);
}
int find_best(int n){
vi v(n);rep(i,n)v[i]=i;
auto res=Ask(0);
if(res[0]+res[1]==0)return 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;
}
}
}