Submission #768609

#TimeUsernameProblemLanguageResultExecution timeMemory
768609raysh07Library (JOI18_library)C++17
0 / 100
45 ms336 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); adj.resize(n); for (int i = 0; i < n; i++){ while (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; } adj[i].push_back(l); adj[l].push_back(i); } } for (int i = 0; i < n; i++){ if (adj[i].size() == 1){ dfs(i); break; } } assert(comp.size() == n); Answer(comp); }

Compilation message (stderr)

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from library.cpp:1:
library.cpp: In function 'void Solve(int)':
library.cpp:84:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   84 |     assert(comp.size() == n);
      |            ~~~~~~~~~~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...