# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
744245 | 2023-05-18T09:57:37 Z | MON | Library (JOI18_library) | C++14 | 0 ms | 0 KB |
#include <cstdio> #include <vector> #include "library.h" using namespace std; void Solve(int N) { vector<int> m(N,0); vector<int> vecini[N + 1]; int luat[N] = {0}; for(int i = 0 ; i < N - 1 ; i++) { for(int j = 0 ; j < N ; j++) { m[i] = 1; m[j] = 1; int sunt = query(M) & 1; if(sunt) vecini[i].emplace_back(j),vecini[j].emplace_back(i); } } vector<int> ans; for(int i = 0; i < N ; i++) { if(vecini[i].size() == 1) { ans.emplace_back(i + 1); break; } } while(ans.size() != N) { for(auto &it : vecini[ans.back()]) { if(!luat[it]) { luat[it] = 1; ans.emplace_back(it + 1); } } } Answer(ans); }