Submission #768625

#TimeUsernameProblemLanguageResultExecution timeMemory
768625raysh07Candies (JOI18_candies)C++17
Compilation error
0 ms0 KiB
#include <bits/stdc++.h> #include "library.h" using namespace std; vector<vector<int>> adj; vector<int> comp; bool check(int i, int j, int n){ if (i == j) return false; vector <int> m(n, 0); for (int k = i; k <= j; k++){ m[k] = 1; } int cnt = 0; for (auto x : adj[i]) m[x] = 0; for (int i = 0; i < n; i++) cnt += m[i]; if (cnt == 1) return false; int a1 = Query(m); m[i] = 0; int a2; if (cnt != 2) a2 = Query(m); else a2 = 1; return a2 >= a1; } void dfs(int u, int par = -1){ comp.push_back(u + 1); for (int v : adj[u]){ if (v != par){ dfs(v, u); } } } void Solve(int n) { // vector<int> M(N); // for(int i = 0; i < N; i++) { // M[i] = 1; // } // int A = Query(M); // vector<int> res(N); // for(int i = 0; i < N; i++) { // res[i] = i + 1; // } // Answer(res); if (n == 1){ Answer({1}); return; } if (n == 2){ Answer({1, 2}); return; } adj.resize(n); int ok = 0; for (int i = 0; i < n; i++){ while (adj[i].size() < 2 && check(i, n - 1, n)){ int l = i + 1, r = n - 1; while (l != r){ int m = (l + r)/2; if (check(i, m, n)) r = m; else l = m + 1; } ok++; adj[i].push_back(l); adj[l].push_back(i); } } // assert(ok == n - 1); int holy = 0; for (int i = 0; i < n; i++) { holy += adj[i].size(); // assert(adj[i].size() >= 1); } // assert(holy == 2 * n - 2); for (int i = 0; i < n; i++){ if (adj[i].size() == 1){ dfs(i); break; } } // assert(comp.size() == n); Answer(comp); }

Compilation message (stderr)

candies.cpp:2:10: fatal error: library.h: No such file or directory
    2 | #include "library.h"
      |          ^~~~~~~~~~~
compilation terminated.