# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1035998 | vjudge1 | Chameleon's Love (JOI20_chameleon) | C++17 | 6 ms | 492 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;
int match[10100];
vector<int> cantfind;
void dnc(int n,vector<int>v){
if(v.size()==1)return void(match[n]=v[0]);
vector<int>a,b;
for(int i=0;i<v.size();i++)
if(i%2)a.push_back(v[i]);
else b.push_back(v[i]);
a.push_back(n);
int K=Query(a);
a.pop_back();
if(K-a.size())dnc(n,b);
else dnc(n,a);
}
void Solve(int N) {
for(int i=1;i<=2*N;i++) {
cantfind.push_back(i);
if(Query(cantfind)<cantfind.size()){
cantfind.pop_back();
dnc(i,cantfind);
cantfind.erase(lower_bound(cantfind.begin(),cantfind.end(),match[i]));
}
}
for(int i=1;i<=2*N;i++)
if(match[i])
Answer(i,match[i]);
}
Compilation message (stderr)
# | 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... |