Submission #431047

#TimeUsernameProblemLanguageResultExecution timeMemory
431047tengiz05Regions (IOI09_regions)C++17
75 / 100
8077 ms100420 KiB
#include <bits/stdc++.h> using i64 = long long; constexpr int N = 2e5, R = 550, RR = 25000; int ans[R][R]; std::vector<int> e[N], c[RR], actual[RR]; int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); int n, m, q; std::cin >> n >> m >> q; std::vector<int> a(n); std::cin >> a[0]; for (int i = 1, p; i < n; i++) { std::cin >> p >> a[i]; p--; e[p].push_back(i); } std::vector<int> in(n), out(n); int timeStamp = 0; std::function<void(int)> dfs = [&](int u) { in[u] = timeStamp++; for (auto v : e[u]) { dfs(v); } out[u] = timeStamp; }; dfs(0); for (int i = 0; i < n; i++) { c[--a[i]].push_back(in[i]); actual[a[i]].push_back(i); } auto is = [&](int u, int v) { return in[u] < in[v] && out[u] >= out[v]; }; if (m <= R) { std::vector<int> last; std::function<void(int)> dfs2 = [&](int u) { std::vector<int> t(R); for (auto v : e[u]) { dfs2(v); for (int i = 0; i < R; i++) { t[i] += last[i]; } } t[a[u]]++; for (int i = 0; i < R; i++) { ans[a[u]][i] += t[i]; } last = t; }; dfs2(0); while (q--) { int r1, r2; std::cin >> r1 >> r2; r1--; r2--; std::cout << ans[r1][r2] << std::endl; } return 0; } for (int i = 0; i < RR; i++) { std::sort(c[i].begin(), c[i].end()); } while (q--) { int r1, r2; std::cin >> r1 >> r2; r1--; r2--; int ans = 0; for (auto u : actual[r1]) { ans += upper_bound(c[r2].begin(), c[r2].end(), out[u] - 1) - upper_bound(c[r2].begin(), c[r2].end(), in[u] - 1); } std::cout << ans << std::endl; } return 0; }

Compilation message (stderr)

regions.cpp: In function 'int main()':
regions.cpp:32:10: warning: variable 'is' set but not used [-Wunused-but-set-variable]
   32 |     auto is = [&](int u, int v) { return in[u] < in[v] && out[u] >= out[v]; };
      |          ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...