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;
typedef long long ll;
#define fi first
#define se second
#define pll pair<ll,ll>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl;
#define MP make_pair
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define SZ(x) (ll)x.size()
#define ALL(x) x.begin(),x.end()
#define endl "\n"
const ll inf=1e18;
ll lowbit(ll x){return x&(-x);}
void Solve(int n) {
vector<int>a;
rep(i,1,2*n+1)a.pb(i);
while(!a.empty()){
ll lo=0,hi=a.size()-1;
while(lo<hi){
ll mid=lo+hi>>1;
vector<int>aa,bb;
rep(i,0,mid)aa.pb(a[i]);
rep(i,1,mid)bb.pb(a[i]);
ll x=Query(aa);
ll y=Query(bb);
if(x==y)hi=mid-1;
else lo=mid;
}
ll xx=a[0],yy=a[lo];
a.erase(a.begin());
a.erase(a.begin()+lo-1);
Answer(xx,yy);
}
}
Compilation message (stderr)
chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:27:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
27 | ll mid=lo+hi>>1;
| ~~^~~
# | 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... |