Submission #53635

#	Time	Username	Problem	Language	Result	Execution time	Memory
53635		baactree	Regions (IOI09_regions)	C++17	80 / 100	7552 ms	92348 KiB

regions

#include <bits/stdc++.h>
using namespace std;
int n, r, q;
vector<int> adj[200005];
int arr[200005];
const int sz = 600;
int cache[sz][25005];
pair<int, int> cnt[25005];
int inv[25005];
int le[200005], ri[200005];
vector<int> idx[25005];
vector<pair<int, int> > vec[25005];
int vn;
void dfs(int now, int par) {
	idx[arr[now]].push_back(vn);
	le[now] = vn++;
	for (auto &there : adj[now]) {
		if (there == par)continue;
		dfs(there, now);
	}
	ri[now] = vn++;
	vec[arr[now]].emplace_back(le[now], ri[now]);
}
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie();
	//scanf("%d%d%d", &n, &r, &q);
	cin >> n >> r >> q;
	//scanf("%d", &arr[1]);
	cin >> arr[1];
	cnt[arr[1]].first++;
	for (int i = 2; i <= n; i++) {
		int a, b;
		//scanf("%d%d", &a, &b);
		cin >> a >> b;
		adj[a].push_back(i);
		adj[i].push_back(a);
		arr[i] = b;
		cnt[arr[i]].first++;
	}
	for (int i = 0; i < 25005; i++)
		cnt[i].second = i;
	sort(cnt, cnt + 25005, [&](pair<int, int> &a, pair<int, int> &b) {
		return a > b;
	});
	for (int i = 0; i < 25005; i++)
		inv[cnt[i].second] = i;
	dfs(1, 0);
	memset(cache, -1, sizeof(cache));
	while (q--) {
		int a, b;
		//scanf("%d%d", &a, &b);
		cin >> a >> b;
		if (inv[a] < sz) {
			int &ans = cache[inv[a]][b];
			if (ans == -1) {
				ans = 0;
				for (auto &x : vec[a]) {
					int le = x.first;
					int ri = x.second;
					ans += upper_bound(idx[b].begin(), idx[b].end(), ri) - lower_bound(idx[b].begin(), idx[b].end(), le);
				}
			}
			//printf("%d\n", ans);
			cout << ans << '\n';
			fflush(stdout);
		}
		else {
			int ans = 0;
			for (auto &x : vec[a]) {
				int le = x.first;
				int ri = x.second;
				ans += upper_bound(idx[b].begin(), idx[b].end(), ri) - lower_bound(idx[b].begin(), idx[b].end(), le);
			}
			//printf("%d\n", ans);
			cout << ans << '\n';
			fflush(stdout);
		}
	}
	return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 65 / 85