# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1081328 | Dennis_Jason | Regions (IOI09_regions) | C++14 | 3256 ms | 131072 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>
#define NMAX 200001
#define pb push_back
#define eb emplace_back
#define MOD 100003
#define nl '\n'
#define INF 2147483647
#define LLONG_MAX 9223372036854775807
#define pii pair<int,int>
#define tpl tuple<int,int,int>
//#pragma GCC optimize("O3")
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
/*
*
*
================DEMONSTRATION===================
=====================END========================
*/
int n,r,q;
int r1,r2;
vector<int>tin(NMAX),tout(NMAX);
vector<int>h(NMAX),s(NMAX);
vector<vector<int>>G(NMAX);
vector<int>used(25001);
vector<vector<int>>ans(25001);
vector<vector<int>>reg(25001);
vector<int>R;
int timp;
void read_query()
{
cin>>r1>>r2;
}
void dfs(int node,int parent)
{
tin[node]=++timp;
used[h[node]]++;
for (auto x: G[node])
{
if (x != parent)
{
dfs(x, node);
}
}
for(auto x:R)
ans[x][h[node]]+=used[x];
used[h[node]]--;
tout[node]=timp;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>r>>q;
cin>>h[1];
reg[h[1]].pb(1);
for(int i=2;i<=n;++i)
{
cin>>s[i]>>h[i];
reg[h[i]].pb(i);
G[i].pb(s[i]);
G[s[i]].pb(i);
}
for(int i=1;i<=r;++i)
{
if(reg[i].size())
{
R.pb(i);
ans[i].resize(r+1,0);
}
}
dfs(1,-1);
while(q--)
{
read_query();
cout.flush()<<ans[r1][r2]<<nl;
cout.flush();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |