# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200377 | Nordway | Koala Game (APIO17_koala) | C++14 | 202 ms | 504 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
#define sz(v) v.size()
using namespace std;
int b[111],R[111];
int minValue(int N, int W) {
b[0]=1;
playRound(b,R);
int w=0;
for(int i=0;i<N;i++){
if(R[i]==0)return i;
}
return 0;
}
int maxValue(int N, int W) {
vector<int>v;
for(int i=0;i<N;i++){
v.pb(i);
}
while(sz(v)>1){
int k=W/sz(v);
for(int i=0;i<N;i++)b[i]=0;
for(int i=0;i<sz(v);i++)b[v[i]]=k;
playRound(b,R);
v.clear();
for(int i=0;i<N;i++){
if(R[i]>k)v.pb(i);
}
}
return v[0];
}
int greaterValue(int N, int W) {
int l=1,r=7,res=0;
while(l<=r){
int mid=(l+r)/2;
b[0]=mid;
b[1]=mid;
playRound(b,R);
if(R[0]+R[1]<=2*mid+1)r=mid-1;
else l=mid+1,res=mid;
}
b[0]=res+1;
b[1]=res+1;
playRound(b,R);
if(R[0]>R[1])return 0;
return 1;
}
void allValues(int N, int W, int *P) {
if (W == 2*N) {
// TODO: Implement Subtask 4 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
} else {
// TODO: Implement Subtask 5 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |