# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520051 | drkarlicio2107 | Minerals (JOI19_minerals) | 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 <bits/stdc++.h>
#include "minerals.h"
using namespace std; vector <int> a, b;
int cnt=0;
int diff (int x){
int a=Query (x);
if (a!=cnt){
cnt=a; return 1;
}
else{
cnt=a; return 0;
}
}
int solve (vector <int> a, vector <int> b, int x){
random_shuffle (a.begin(), a.end());
random_shuffle (b.begin(), b.end());
if (a.size()==1){
Answer (a[0], b[0]); return 0;
}
int mid=a.size()/2;
vector <int> a1, a2, b1, b2;
for (int i=0; i<mid; i++){
diff (a[i]); a1.push_back(a[i]);
}
for (int i=mid; i<a.size(); i++) a2.push_back(a[i]);
for (int i=0; i<b.size(); i++){
if (b1.size()==a1.size()) b2.push_back(b[i]);
else if (b2.size()==a2.size()) b1.push_back(b[i]);
else if ((diff (b[i])==0 && x==1) || (diff (b[i])==1 && x==0)) b1.push_back(b[i]);
else b2.push_back(b[i]);
}
solve (a1, b1, 0);
solve (a2, b2, 1);
}
int Solve(int n){
for (int i=1; i<2*n+1; i++){
if (diff (i)) b.push_back(i);
else a.push_back(i);
}
solve (a,b,1);
}