| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 958717 | MilosMilutinovic | Koala Game (APIO17_koala) | 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 "koala.h"
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
int minValue(int n,int w){
int a[n],b[n];
for(int i=0;i<n;i++) a[i]=0;
a[0]=1;
playRound(a,b);
for(int i=0;i<n;i++) if(a[i]>=b[i]) return i;
}
int maxValue(int n,int w){
vector<int> c;
for(int i=0;i<n;i++) c.pb(i);
while((int)c.size()>1){
int a[n],b[n];
for(int i=0;i<n;i++) a[i]=0;
for(int i:c) a[i]=w/(int)c.size();
playRound(a,b);
c.clear();
for(int i=0;i<n;i++) if(b[i]>a[i]&&a[i]>0) c.pb(i);
}
return c[0];
}
int greaterValue(int n,int w){
int low=1,high=min(10,w/2);
while(low<=high){
int mid=(low+high)/2;
int a[n],b[n];
for(int i=0;i<n;i++) a[i]=0;
a[0]=a[1]=mid;
playRound(a,b);
if(b[0]>mid&&b[1]>mid) low=mid+1;
else if(b[0]<=mid&&b[1]<=mid) high=mid-1;
else return (b[0]>mid?0:1);
}
return 0;
}
void allValues(int n,int w,int *p){
if(w==2*n){
auto cmp=[&](int x,int y){
int a[n],b[n];
for(int i=0;i<n;i++) a[i]=0;
a[x]=a[y]=w/2;
playRound(a,b);
return b[x]<b[y];
};
function<vector<int>(int,int)> solve=[&](int l,int r){
if(l==r) return vector<int>(1,l);
int mid=(l+r)/2;
vector<int> vl=solve(l,mid);
vector<int> vr=solve(mid+1,r);
vector<int> ret;
int i=0,j=0,x=(int)vl.size(),y=(int)vr.size();
while(i<x||j<y){
if(i==x||(j<y&&!cmp(vl[i],vr[j]))) ret.pb(vr[j++]);
else ret.pb(vl[i++]);
}
return ret;
};
vector<int> res=solve(0,n-1);
for(int i=0;i<n;i++) p[res[i]]=i+1;
}else{
int ord[n][n];
for(int i=0;i<n;i++) for(int j=0;j<n;j++) ord[i][j]=0;
auto cmp=[&](int x,int y){
if(ord[x][y]!=0) return ord[x][y]==-1?true:false;
int low=1,high=min(12,w/2);
while(low<=high){
int mid=(low+high)/2;
int a[n],b[n];
for(int i=0;i<n;i++) a[i]=0;
a[x]=a[y]=mid;
playRound(a,b);
for(int i=0;i<n;i++){
for(int j=0;j<n;i++){
if(i==j) continue;
if(b[i]>a[i]&&b[j]<=a[j]&&a[i]>=a[j]) ord[i][j]=1,ord[j][i]=-1;
}
}
if(b[x]>mid&&b[y]>mid) low=mid+1;
else if(b[x]<=mid&&b[y]<=mid) high=mid-1;
else return (b[x]>mid?false:true);
}
assert(false);
};
function<vector<int>(int,int)> solve=[&](int l,int r){
if(l==r) return vector<int>(1,l);
int mid=(l+r)/2;
vector<int> vl=solve(l,mid);
vector<int> vr=solve(mid+1,r);
vector<int> ret;
int i=0,j=0,x=(int)vl.size(),y=(int)vr.size();
while(i<x||j<y){
if(i==x||(j<y&&!cmp(vl[i],vr[j]))) ret.pb(vr[j++]);
else ret.pb(vl[i++]);
}
return ret;
};
vector<int> res=solve(0,n-1);
for(int i=0;i<n;i++) p[res[i]]=i+1;
}
}