# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1077652 | azberjibiou | Minerals (JOI19_minerals) | 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 "minerals.h"
#include <bits/stdc++.h>
using namespace std;
int solv(vector <int> v, int pval, bool ud){
int sz=v.size();
assert(sz%2==0);
if(sz==2){
Answer(v[0], v[1]);
return pval;
}
int mid=sz/4;
vector <int> nv1, nv2;
for(int i=0;i<sz;i++){
int now=Query(v[i]);
if((ud && now>pval+mid) || (!ud && now<pval-mid)){
nv1.push_back(v[i]);
Query(v[i]);
}
else{
nv2.push_back(v[i]);
}
}
int nxtv=solv(nv1, pval+(ud ? mid : -mid), ud);
return solv(nv2, nxtv, ud^1);
}
void Solve(int N) {
vector <int> v;
for(int i=1;i<=2*N;i++) v.push_back(i);
solv(v, 0, 1);
}