Submission #344016

#TimeUsernameProblemLanguageResultExecution timeMemory
344016juggernautLibrary (JOI18_library)C++14
0 / 100
349 ms620 KiB
#include<bits/stdc++.h> #include"library.h" #ifdef EVAL #else #include"grader.cpp" #endif using namespace std; vector<int>g[205],ans; void dfs(int v,int p){ ans.push_back(v+1); for(int to:g[v])if(to!=p)dfs(to,v); } void Solve(int n){ vector<int>m(n,0); for(int i=0;i+1<n;i++){ for(int j=i+1;j<n;j++){ m[i]=m[j]=1; if(Query(m)==1){ g[i].push_back(j); g[j].push_back(i); } m[i]=m[j]=0; } } int root=-1; for(int i=0;i<n;i++)if(g[i].size()==1)root=i; if(root!=-1)dfs(root,root); Answer(ans); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...