제출 #344019

#제출 시각아이디문제언어결과실행 시간메모리
344019Kerim도서관 (JOI18_library)C++17
0 / 100
285 ms620 KiB
#include <cstdio> #include <vector> #include "library.h" #define pb(x) push_back(x) #define ppb() pop_back() #define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++) using namespace std; #define N 1003 int val[N]; vector<int>adj[N],res; void add(int x,int y){ adj[x].pb(y); adj[y].pb(x); } void dfs(int nd,int pr){ res.pb(nd); tr(it,adj[nd]) if(*it!=pr) dfs(*it,nd); } void Solve(int n){ vector<int> M(n); for(int i=1;i<n;i++){ for(int j=0;j<n;j++)M[j]=0; int last=1,cur=0;M[i]=1; for(int j=i-1;j>=0;j--){cur+=val[j]; M[j]=1;int tmp=Query(M)+cur; if(tmp<=last) add(j+1,i+1),val[j]++; last=tmp; } } for(int i=1;i<=n;i++) if(adj[i].size()==1){ dfs(i,-1); break; } Answer(res); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...