# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
262567 | daniel920712 | Koala Game (APIO17_koala) | C++14 | 20 ms | 384 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 <stdio.h>
#include <vector>
using namespace std;
int B[105]={0},R[105]={0};
int all[105];
int where[105];
bool have[105];
int minValue(int N, int W) {
// TODO: Implement Subtask 1 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
int i;
B[0]=1;
playRound(B,R);
for(i=0;i<N;i++)
{
if(R[i]!=B[i]+1) return i;
}
return 0;
}
int maxValue(int N, int W)
{
int i,now=N,tt=0;
for(i=0;i<100;i++) if(!have[i])R[i]=2;
while(1)
{
for(i=0;i<N;i++)
{
if(have[i]) continue;
if(R[i]>1) B[i]=W/now;
else B[i]=0;
}
playRound(B,R);
now=0;
for(i=0;i<N;i++)
{
if(have[i]) continue;
if(R[i]>1) now++;
}
if(now==1) for(i=0;i<N;i++) if(R[i]>1) return i;
}
}
int greaterValue(int N, int W) {
// TODO: Implement Subtask 3 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
B[0]=1;
B[1]=1;
return 0;
}
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
{
for(int i=N;i>=1;i--)
{
int t=maxValue(i,i);
P[t]=i;
have[t]=1;
}
}
}
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... |