# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
944072 | teacup | Chameleon's Love (JOI20_chameleon) | 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 "chameleon.h"
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ii pair<int,int>
typedef vector<int> vi;
#define iii tuple<int,int,int>
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef map<int,int> mii;
#ifndef debug
#define cerr if (0) cerr
#endif
void Solve(int N) {
vector<int> V;
for(int i=1; i<=2*N; i++){
V.push_back(i);
}
while(!V.empty()){
int L=0, R=V.size()-1, M, a, b;
while(R>=L){
M = (L+R)/2;
a = Query(vector(v.begin(),v.begin()+M));
b = Query(vector(v.begin()+1,v.begin()+M));
if (a==b) R = M;
else L = M+1;
}
a = V[0]; b = V[L];
v.erase(v.begin()); v.erase(V.begin()+L);
Answer(a,b);
}
}