# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1151704 | byunjaewoo | Koala Game (APIO17_koala) | C++20 | 0 ms | 0 KiB |
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
int minValue(int N, int W) {
vector<int> v(N, 0), t;
v[0]=1;
playRound(v, t);
if(t[0]<=1) return 0;
for(int i=1; i<N; i++) if(t[i]==0) return i;
}
int maxValue(int N, int W) {
// TODO: Implement Subtask 2 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
return 0;
}
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.
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 {
// TODO: Implement Subtask 5 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
}
}