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 <bits/stdc++.h>
#include "library.h"
using namespace std;
const int nx=1005;
int s;
vector<int> v[nx], res;
void dfs(int u, int p)
{
res.push_back(u);
for (auto x:v[u]) if (x!=p) dfs(x, u);
}
void Solve(int N)
{
vector<int> M(N);
for (int i=0; i<N; i++)
{
for (int j=i+1; j<N; j++)
{
M[i]=M[j]=1;
if (Query(M)==1) v[i+1].push_back(j+1), v[j+1].push_back(i+1);
M[i]=M[j]=0;
}
}
for (int i=1; i<=N; i++) if ((int)v[i].size()==1) s=i;
dfs(s, s);
Answer(res);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |