Submission #944970

#TimeUsernameProblemLanguageResultExecution timeMemory
944970XiaoyangChameleon's Love (JOI20_chameleon)C++17
4 / 100
18 ms600 KiB
#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(); while(lo<hi){ ll mid=lo+hi+1>>1; ll x= Query(vector(a.begin(),a.begin()+mid)); ll y = Query(vector(a.begin()+1,a.begin()+mid)); 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:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   27 |    ll mid=lo+hi+1>>1;
      |           ~~~~~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...