# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
653624 | Kripton | Koala Game (APIO17_koala) | C++14 | 16 ms | 408 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 <vector>
#include <iostream>
using namespace std;
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.
return 0;
}
int maxValue(int N, int W)
{
int B[101],R[101],i,j;
vector <int> v,newv;
for(i=0; i<N; i++)
v.push_back(i);
for(i=0;; i++)
{
newv.clear();
for(j=0; j<N; j++)
B[j]=0;
for(auto it:v)
B[it]=W/v.size();
playRound(B,R);
for(j=0; j<N; j++)
if(R[j]==W/v.size()+1)
newv.push_back(j);
v=newv;
if(v.size()==1)
break;
}
return v[0];
}
int greaterValue(int N, int W)
{
}
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... |