제출 #344017

#제출 시각아이디문제언어결과실행 시간메모리
344017juggernautLibrary (JOI18_library)C++14
19 / 100
327 ms748 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=0;
    for(int i=0;i<n;i++)if(g[i].size()==1)root=i;
    dfs(root,root);
    Answer(ans);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...