# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
669786 | Sorting | Koala Game (APIO17_koala) | C++17 | 0 ms | 0 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 <iostream>
#include <numeric>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
int b[103], r[103];
int minValue(int n, int w) {
fill(b, b + n, 0);
b[0] = 1;
playRound(b, r);
if(r[0] < 2)
return 0;
for(int i = 1; i < n; ++i)
if(!r[i])
return i;
assert(false);
return -1;
}
int maxValue(int n, int w) {
vector<int> poss(n);
iota(poss.begin(), poss.end(), 0);
while(poss.size() > 1){
int x = min(13, (int)n / (int)poss.size());
fill(b, b + n, 0);
for(int pos: poss)
b[pos] = x;
playRound(b, r);
poss.clear();
for(int i = 0; i < n; ++i)
if(r[i] > x)
poss.push_back(i);
}
return poss[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.
}
}