| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 887850 | vjudge1 | Koala Game (APIO17_koala) | C++17 | 11 ms | 344 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;
const int mxn = 123;
int a[mxn], b[mxn];
int minValue(int n, int w)
{
a[0] = 1;
fill(a+1, a+n, 0);
playRound(a, b);
if(b[0] <= 1)
{
return 0;
}
for(int i = 1; i < n; i++)
{
if(!b[i])
{
return i;
}
}
}
int maxValue(int n, int w)
{
int cnt = 0;
bool mark[n];
fill(mark, mark+n, 0);
while(cnt < (n-1))
{
fill(a, a+n, 0);
for(int i = 0; i < n; i++)
{
if(!mark[i])
{
a[i] = w/(n-cnt);
}
}
playRound(a, b);
for(int i = 0; i < n; i++)
{
if(mark[i])
{
continue;
}
if(b[i] <= a[i])
{
mark[i] = 1;
cnt++;
}
}
}
for(int i = 0; i < n; i++)
{
if(!mark[i])
{
return i;
}
}
}
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... | ||||
