Submission #937446

#TimeUsernameProblemLanguageResultExecution timeMemory
937446guagua0407Chameleon's Love (JOI20_chameleon)C++17
0 / 100
16 ms444 KiB
#include "chameleon.h" #include<bits/stdc++.h> namespace { int n; } // namespace void Solve(int N) { using namespace std; n=N; int B=31; vector<bool> used(2*n+1); int cnt=0; while(cnt<n){ vector<int> vec; for(int i=1;i<=2*n;i++){ if(used[i]) continue; int sz=vec.size(); vec.push_back(i); if(Query(vec)==sz){ vec.pop_back(); for(auto v:vec){ if(Query({v,i})==1){ //cout<<v<<' '<<i<<'\n'; Answer(v,i); used[v]=used[i]=true; cnt++; } } } else if((int)vec.size()>B) vec.pop_back(); } } }
#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...