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;
typedef long long ll;
typedef vector<int>vi;
#define pb push_back
#define sz(v) (int)v.size()
#define all(x) begin(x),end(x)
#define FOR(i,a,b) for(int i=a; i<b; i++)
#define ROF(i,a,b) for(int i=b-1; i>=a; i--)
//----------------------
void Solve(int N){
vi adj[N];
FOR(i,0,N){
FOR(j,i+1,N){
vi a(N,0); a[i]=a[j]=1;
if(Query(a)==1) adj[i].pb(j),adj[j].pb(i);
}
}
vi ans;
FOR(i,0,N) if(sz(adj[i])<=1){
int prev=-1,u=i;
while(1){
ans.pb(u+1);
int nxt=-1;
for(int v: adj[u]) if(v!=prev) nxt=v;
if(nxt==-1) break;
prev=u;
u=nxt;
}
break;
}
Answer(ans);
return;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |