# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
744263 | 2023-05-18T10:06:56 Z | MON | Library (JOI18_library) | C++14 | 283 ms | 292 KB |
#include <cstdio> #include <vector> #include "library.h" using namespace std; void Solve(int N) { vector<int> m(N,0); int queries = 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; queries++; if(sunt) vecini[i].emplace_back(j),vecini[j].emplace_back(i); m[i] = 0; m[j] = 0; } } vector<int> ans; if(queries > 20000) return; for(int i = 0; i < N ; i++) { if(vecini[i].size() == 1) { ans.emplace_back(i); luat[i] = 1; break; } } while(ans.size() != N) { for(auto &it : vecini[ans.back()]) { if(!luat[it]) { luat[it] = 1; ans.emplace_back(it); break; } } } for(auto &it : ans) it++; Answer(ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 283 ms | 292 KB | Execution killed with signal 13 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 283 ms | 292 KB | Execution killed with signal 13 |
2 | Halted | 0 ms | 0 KB | - |