Submission #944077

#TimeUsernameProblemLanguageResultExecution timeMemory
944077teacupChameleon's Love (JOI20_chameleon)C++17
0 / 100
1 ms600 KiB
#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(), M, a, b; while(R>L+1){ 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; } a = V[0]; b = V[L]; V.erase(V.begin());V.erase(V.begin()+L); Answer(a,b); } }
#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...