# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
933030 | vjudge1 | Regions (IOI09_regions) | C++98 | 146 ms | 20936 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 unsigned long long ull;
int n, r, q;
int papa[200000];
int reg[200000];
vector<vector<int>> adj;
int busca(int node, int &r2){
int cnt=0;
if(reg[node]==r2)
cnt++;
for(int i=0; i<adj[node].size(); i++){
cnt+=busca(adj[node][i], r2);
}
return cnt;
}
void checa(int r1, int r2){
int ans=0;
for(int i=0; i<n; i++){
if(reg[i]==r1){
ans+=busca(i, r2);
}
if(r1==r2)
ans--;
}
cout<< ans;
fflush(stdout);
}
void solve(){
int x;
cin>> n>> r>> q;
adj.resize(n);
cin>> reg[0];
for(int i=1; i<n; i++){
cin>> papa[i]>> reg[i];
papa[i]--;
adj[papa[i]].push_back(i);
//adj[i].push_back(papa[i]);
}
int r1, r2;
for(int i=0; i<q; i++){
cin>> r1>> r2;
checa(r1, r2);
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int t=1;
//cin>> t;
while(t--){
solve();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |