| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 916005 | Juanchoki | Regions (IOI09_regions) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int mapa[25001][25001];
vector<int> adj[200001];
int region[200001];
vector<int> zona[501];
vector<int> euler;
int ini[200001], fin[200001], cnt = 0;
void dfs(int nodo)
{
euler.push_back(nodo);
ini[nodo] = cnt++;
for (int v: adj[nodo])
dfs(v);
euler.push_back(nodo);
fin[nodo] = cnt++;
}
int main()
{
int n, r, q, a; cin >> n >> r >> q;
cin >> region[1];
zona[region[1]].push_back(1);
for (int i = 2; i <= n; i++)
{
cin >> a;
adj[a].push_back(i);
cin >> a;
region[i] = a;
zona[a].push_back(i);
}
dfs(1);
//for (int x: euler) cout << x << " " << region[x] << '\n';
for (int i = 1; i <= 500; i++)
{
for (int pos: zona[i])
{
for (int j = ini[pos]+1; j < fin[pos]; j++)
{
mapa[i][region[euler[j]]]++;
}
}
}
while (q--)
{
cin >> a >> r;
cout << mapa[a][r]/2 << endl;
}
}