# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
403153 | A_D | 코알라 (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>
using namespace std;
int a[100];
int minValue(int N, int W) {
int ans=0;
int B[N];
int R[N];
memset(B,0,sizeof(B));
memset(R,0,sizeof(R));
B[0]=1;
playRound(B,R);
for(int i=1;i<N;i++)if(R[i]==0)ans=i;
return ans;
}
int maxValue(int N, int W) {
int l=1,r=13,ans;
int B[N];
int R[N];
bool me[N];
int cnt=1;
memset(B,0,sizeof(B));
memset(me,1,sizeof(me));
while(1){
memset(B,0,sizeof(B));
for(int i=0;i<N;i++){
if(me[i]){
B[i]=cnt;
}
}
playRound(B, R);
int u=0;
for(int i=0;i<N;i++){
if(me[i]&&R[i]>cnt){
u++;
me[i]=1;
}
else me[i]=0;
}
cnt=W/u;
cnt=min(cnt,13);
if(u==1){
for(int i=0;i<N;i++){
if(me[i])return i;
}
}
}
}
int greaterValue(int N, int W) {
int l=1,r=13,ans;
int B[N];
int R[N];
memset(B,0,sizeof(B));
while(l<=r){
int mid=(l+r)/2;
B[0]=mid;
B[1]=mid;
playRound(B, R);
int a=R[0]>mid;
int b=R[1]>mid;
if(a>b)return 0;
if(b>a)return 1;
if(a){
l=mid+1;
}
else r=mid-1;
}
assert(0);
}
bool com(int a,int b)
{
int l=1,r=13,ans;
int B[100];
int R[100];
memset(B,0,sizeof(B));
while(l<=r){
int mid=(l+r)/2;
B[a]=mid;
B[b]=mid;
playRound(B, R);
int a=R[0]>mid;
int b=R[1]>mid;
if(a>b)return 0;
if(b>a)return 1;
if(a){
l=mid+1;
}
else r=mid-1;
}
assert(0);
}
void allValues(int N, int W, int *P) {
if (W == 2*N) {
}
else {
vector<int> vec[N*3];
int ann=0;
int B[N];
int R[N];
memset(B,0,sizeof(B));
memset(R,0,sizeof(R));
B[0]=100;
playRound(B,R);
for(int i=1;i<N;i++)if(R[i]==0)ann=i;
vec[1].push_back(ans);
for(int i=0;i<N;i++){
if(i==ann)continue;
int l=2,r=13,ans;
while(l<=r){
memset(B,0,sizeof(B));
int mid=(l+r)/2;
B[i]=mid;
playRound(B,R);
if(R[i]>mid){
l=mid+1;
ans=mid;
}
else{
r=mid-1;
}
}
vec[ans].push_back(i)
}
int l=0,cnt=0;
for(int i=1;i<14;i++){
for(auto x:vec[i]){
a[cnt++]=x;
}
sort(a+l,a+cnt,com);
}
for(int i=0;i<N;i++){
P[a[i]]=i+1;
}
}
}