# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
401177 | Hazem | Koala Game (APIO17_koala) | C++14 | 72 ms | 332 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>
#include "koala.h"
using namespace std;
int B[100],R[100];
int minValue(int N, int W) {
B[0] = 1;
playRound(B,R);
if(!R[0])return 0;
else
for(int i=0;i<N;i++)
if(!R[i])return i;
}
vector<int>vec;
int maxValue(int N, int W) {
for(int i=0;i<N;i++)
vec.push_back(i);
while(vec.size()>1){
for(int i=0;i<N;i++)
B[i] = 0;
for(auto x:vec)
B[x] = W/vec.size();
playRound(B,R);
vector<int>vec1;
for(int i=0;i<N;i++)
if(R[i]>(W/vec.size()))vec1.push_back(i);
vec = vec1;
}
return vec[0];
}
int greaterValue(int N, int W) {
int l = 0,r = 14;
while(l<r){
int mid = (l+r+1)/2;
B[0] = B[1] = mid;
playRound(B,R);
if(R[0]!=R[1])
return R[0]<R[1];
if(R[0])l = mid;
else r = mid-1;
}
int cnt = -1;
while(1)
cnt++;
return cnt;
}
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... |