oj.uz

Submission #883398

# Submission time Handle Problem Language Result Execution time Memory
883398 2023-12-05T08:57:15 Z serifefedartar Regions (IOI09_regions) C++17
30 / 100
 4241 ms 52780 KB 
#include <bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 1e9 + 9;
const ll LOGN = 21;
const ll MAXN = 2e5 +  100;

vector<vector<int>> graph;
int reg[MAXN], dp[505][505];
vector<int> cnt[MAXN], Rin[25100], Rout[25100], plc[25100];
map<pair<int,int>, pair<int,bool>> memo;

void dfs(int node, int parent) {
	cnt[node][reg[node]]++;
	for (int reg_other = 1; reg_other <= 500; reg_other++)
		dp[reg_other][reg[node]] += cnt[node][reg_other];
	for (auto u : graph[node]) {
		swap(cnt[u], cnt[node]);
		dfs(u, node);
	}
	cnt[node][reg[node]]--;
	swap(cnt[parent], cnt[node]);
}
	
int T = 0;
int tin[MAXN], tout[MAXN];
void dfs2(int node, int parent) {
	tin[node] = ++T;
	Rin[reg[node]].push_back(tin[node]);
	for (auto u : graph[node])
		dfs2(u, node);
	tout[node] = ++T;
	Rout[reg[node]].push_back(tin[node]);
}

int main() {
	fast
	int N, R, Q, a, b;
	cin >> N >> R >> Q;

	graph = vector<vector<int>>(N+1, vector<int>());
	cin >> reg[1];
	plc[reg[1]].push_back(1);
	for (int i = 2; i <= N; i++) {
		int S;
		cin >> S >> reg[i];
		plc[reg[i]].push_back(i);
		graph[S].push_back(i);
	}

	if (R <= 500) {
		cnt[1] = vector<int>(505, 0);
		dfs(1, 1);
		for (int i = 0; i < Q; i++) {
			cin >> a >> b;
			cout << dp[a][b] << endl;
		}
	} else {
		dfs2(1, 1);
		for (int i = 0; i < Q; i++) {
			cin >> a >> b;
			if (memo[{a, b}].s == false) {
				int ans = 0;
				if (plc[a].size() < plc[b].size())
					for (auto u : plc[a])
						ans += (upper_bound(Rin[b].begin(), Rin[b].end(), tout[u]) - Rin[b].begin()) - (upper_bound(Rin[b].begin(), Rin[b].end(), tin[u]) - Rin[b].begin());
				else
					for (auto u : plc[b])
						ans += (upper_bound(Rin[a].begin(), Rin[a].end(), tin[u]) - Rin[a].begin()) - (upper_bound(Rout[a].begin(), Rout[a].end(), tin[u]) - Rout[a].begin());
				memo[{a, b}] = {ans, 1};
			}
			cout << memo[{a, b}].f << endl;
		}
	}
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9304 KB Output is correct
2 Correct 2 ms 9304 KB Output is correct
3 Correct 3 ms 9304 KB Output is correct
4 Correct 4 ms 9304 KB Output is correct
5 Correct 7 ms 9304 KB Output is correct
6 Correct 9 ms 9304 KB Output is correct
7 Correct 16 ms 9304 KB Output is correct
8 Correct 18 ms 9304 KB Output is correct
9 Correct 25 ms 9816 KB Output is correct
10 Correct 48 ms 9816 KB Output is correct
11 Correct 59 ms 10232 KB Output is correct
12 Correct 70 ms 10768 KB Output is correct
13 Correct 83 ms 10544 KB Output is correct
14 Correct 93 ms 10936 KB Output is correct
15 Correct 111 ms 14968 KB Output is correct

Subtask #2
15.0 / 85.0

# Verdict Execution time Memory Grader output
1 Correct 412 ms 14896 KB Output is correct
2 Correct 463 ms 13656 KB Output is correct
3 Correct 717 ms 17748 KB Output is correct
4 Incorrect 166 ms 13212 KB Output isn't correct
5 Incorrect 233 ms 16740 KB Output isn't correct
6 Incorrect 342 ms 15884 KB Output isn't correct
7 Incorrect 488 ms 16368 KB Output isn't correct
8 Incorrect 760 ms 26812 KB Output isn't correct
9 Incorrect 1600 ms 31316 KB Output isn't correct
10 Incorrect 3180 ms 40908 KB Output isn't correct
11 Incorrect 4241 ms 35516 KB Output isn't correct
12 Incorrect 1196 ms 29924 KB Output isn't correct
13 Incorrect 1630 ms 32684 KB Output isn't correct
14 Incorrect 1929 ms 33988 KB Output isn't correct
15 Incorrect 2587 ms 43444 KB Output isn't correct
16 Incorrect 2427 ms 52780 KB Output isn't correct
17 Incorrect 2305 ms 50176 KB Output isn't correct