# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
212369 | Abdullah | Chameleon's Love (JOI20_chameleon) | C++17 | 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;
vector<bool>vis(1005, 0);
void answer(a, b){
if(vis[a]||vis[b])return;
Answer(a, b);
vis[a]=1, vis[b]=1;
return;
}
void Solve(int n) {
n*=2;
vector<vector<int>>adjs(n+1);
vector<int>sizs(n+1, 0);
for(int i=1; i<=n; i++){
for(int j=i+1; j<=n; j++){
if(Query({i, j})==1){
adjs[i].push_back(j);
adjs[j].push_back(i);
}
}
}
vector<bool>vis(n+1, 0);
vector<vector<int>>B(n+1);
for(int i=1; i<=n; i++){
if(adjs[i].size()==1){
answer(i, adjs[i][0]);
}else{
for(int j=0; j<3; j++){
vector<int>A={i};
for(int a=0;a<=2; a++){
if(a!=j)A.push_back(adjs[i][a]);
}
if(Query(A)==1){
B[i].push_back(adjs[i][j]);
B[adjs[i][j]].push_back(i);
break;
}
}
}
}
for(int i=1; i<=n; i++){
for(int a:adjs[i]){
if(a!=B[i][0]&&a!=B[i][1]){
answer(i, a);
}
}
}
}
//~ #include "chameleon.h"
//~ #include <bits/stdc++.h>
//~ using namespace std;
//~ int n;
//~ int get(int x, int l ,int r, int y){
//~ vector<int>p;
//~ if(y!=-1){
//~ for(int i=l; i<=r; i++)p.push_back(i);
//~ p.push_back(y);
//~ return Query(p);
//~ }else if(x==-1){
//~ for(int i=l; i<=r; i++) p.push_back(i);
//~ return Query(p);
//~ }else{
//~ for(int i=l ; i<=r; i++){
//~ if(i==x)continue;
//~ p.push_back(i);
//~ }
//~ return Query(p);
//~ }
//~ }
//~ int rec(int x, int l, int r){
//~ int m=(l+r)/2;
//~ if(l==r) return l;
//~ if(x<=m){
//~ if(get(x, 1, m, -1)==get(-1, 1, m, -1)) return rec(x, 1, m);
//~ else return rec(x, m+1, r);
//~ }else{
//~ if(get(-1, 1, m, -1)==get(-1, 1, m, x)) return rec(x, 1, m);
//~ else return rec(x, m+1, r);
//~ }
//~ }
//~ void Solve(int N) {
//~ n=N*2;
//~ vector<bool>vis(n+1);
//~ for(int i=1; i<=n; i++){
//~ if(vis[i])continue;
//~ int j=rec(i, 1, n);
//~ Answer(i, j);
//~ vis[i]=1, vis[j]=1;
//~ }
//~ }