# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108190 | wilwxk | Koala Game (APIO17_koala) | C++11 | 21 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 <bits/stdc++.h>
using namespace std;
const int MAXN=205;
int v[MAXN];
int v2[MAXN];
int minValue(int n, int w) {
v[0]=1;
playRound(v, v2);
for(int i=0; i<n; i++) if(v2[i]<=v[i]) return i;
}
int maxValue(int n, int w) {
int ok[MAXN];
for(int i=0; i<n; i++) ok[i]=1;
int cnt=n;
while(cnt!=1) {
for(int i=0; i<n; i++) {
if(ok[i]) v[i]=(w/cnt);
else v[i]=0;
}
playRound(v, v2);
for(int i=0; i<n; i++) {
if(ok[i]&&v2[i]<=v[i]) ok[i]=0, cnt--;
}
}
for(int i=0; i<n; i++) if(ok[i]) return i;
}
int greaterValue(int n, int w) {
for(int i=1; i<=14; i++) {
v[0]=i; v[1]=i;
playRound(v, v2);
if(v2[0]>i!=v2[i]>i) return v2[1]>i;
}
}
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... |