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 "chameleon.h"
#include <bits/stdc++.h>
using namespace std;
void Solve(int n) {
vector<int> v;
for(int i=1;i<=n*2;i++){
v.push_back(i);
}
while(v.size()){
int sz=v.size();
int l=0,r=sz;
while(r-l>1){
int m=(l+r)>>1;
int a=Query(vector(v.begin(),v.begin()+m));
int b=Query(vector(v.begin()+1,v.begin()+m));
if(a-b==0){
r=m;
}
else{
l=m;
}
}
int a=v[0],b=v[l];
v.erase(v.begin()+l);
v.erase(v.begin());
Answer(a,b);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |