# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102108 | figter001 | Regions (IOI09_regions) | C++17 | 9 ms | 4992 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;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int nax = 2e5 + 50;
const int rax = 510;
int r[nax],dp[rax][rax],ans[rax][rax];
int n,R,q;
vector<int> g[nax];
void dfs(int u,int p){
for(int v : g[u]){
if(v == p)
continue;
dfs(v,u);
dp[u][r[v]]++;
}
if(p != -1){
for(int i=1;i<=R;i++)
dp[p][i] += dp[u][i];
}
for(int i=1;i<=R;i++){
ans[r[u]][i] += dp[u][i];
}
}
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
#endif
cin>>n>>R>>q;
cin>>r[1];
for(int i=2;i<=n;i++){
int p;
cin>>p>>r[i];
g[p].push_back(i);
}
dfs(1,0);
int a,b;
for(int i=0;i<q;i++){
scanf("%d%d",&a,&b);
printf("%d\n", ans[a][b]);
fflush(stdout);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |