#include<bits/stdc++.h>
#include "chameleon.h"
using namespace std;
int n;
vector<int> v[512];
int u[512][512];
void Solve(int N)
{
n=N;
for(int i=1;i<=2*N;i++)
{
for(int j=i+1;j<=2*N;j++)
{
int q=Query({i,j});
if(q==1)
{
v[i].push_back(j);
v[j].push_back(i);
}
}
}
for(int i=1;i<=2*n;i++)
{
if(v[i].size()==3)
{
int v0=v[i][0],v1=v[i][1],v2=v[i][2];
int q1=Query({v0,v1,i});
int q2=Query({v0,v2,i});
if(q1==1)u[i][v2]=u[v2][i]=1;
else if(q2==1)u[i][v1]=u[v1][i]=1;
else u[i][v0]=u[v0][i]=1;
}
}
for(int i=1;i<=2*n;i++)
{
for(int j=0;j<v[i].size();j++)
{
int nb=v[i][j];
if(i<nb&&!u[i][nb])
{
//cout<<i<<" "<<nb<<endl;
Answer(i,nb);
}
}
}
}
| # | 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... |