# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
775644 | MohamedAliSaidane | Koala Game (APIO17_koala) | C++14 | 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<bits/stdc++.h>
using namespace std;
#define pb push_back
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) {
// 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;
}
vector<int> p;
int n;
void srch(int l, int r, vector<int> idx)
{
if(l == r)
{
for(auto e: idx)
p[e] = l;
return ;
}
vector<int> B, Res;
B.assign(n, 0);
Res.assign(n, 0);
for(auto e: idx)
B[e] = 1;
playRound(B, Res);
int mid = (l + r)/2 ;
vector<int> L, R;
for(auto e: idx)
{
if(B[e] == 2)
R.pb(e);
else
L.pb(e);
}
srch(l, mid, L);
srch(mid + 1, r, R);
}
void allValues(int N, int W, int *P) {
vector<int> idx;
for(int i = 0; i < n; i++)
idx.pb(i);
srch(1, N, idx);
for(int i = 0; i < n; i++)
P[i] = p[i];
return ;
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.
}
}