| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1083260 | rayan_bd | Regions (IOI09_regions) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#define getar(ar,n) for(ll i=0;i<n;++i) cin>>ar[i]
#define show(n) cout<<n<<'\n'
#define all(v) v.begin(), v.end()
#define br cout<<"\n"
#define pb push_back
#define nl '\n'
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ret return
#define ll long long
#define ld long double
#define sza(x) ((int)x.size())
const int mxN = 2e5 + 50;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;
ll color[mxN][505];
vector<ll> adj[mxN];
ll hd[mxN];//,lt[mxN],st[mxN],en[mxN];
//ll seg[mxN*4][501],tin=-1;
/*void build(ll node,ll start,ll end){
if(start==end){
seg[node][lt[start]]=1;
return;
}
ll mid=start+(end-start)/2;
build(node*2+1,start,mid);
build(node*2+2,mid+1,end);
for(ll i=1;i<=500;++i){
seg[node][i]=seg[node*2+1][i]+seg[node*2+2][i];
}
}*/
/*void dfs(ll u=1,ll par=-1){
st[u]=++tin;
lt[tin]=hd[u];
for(auto it:adj[u]){
if(it^par){
dfs(it,u);
}
}
en[u]=tin;
}
ll qry(ll node,ll start,ll end,ll l,ll r,ll v){
if(start>r||end<l) return 0;
if(start>=l&&end<=r) return seg[node][v];
ll mid=start+(end-start)/2;
return qry(node*2+1,start,mid,l,r,v)+qry(node*2+2,mid+1,end,l,r,v);
}*/
void solve(ll tc) {
ll n,r,q,r1,r2,h,super;cin>>n>>r>>q;
cin>>hd[1];
unordered_map<ll,vector<ll>> mp;
mp[hd[1]].pb(1);
vector<ll> out(n+1,0);
color[1][hd[1]]=1;
for(ll i=2;i<=n;++i){
cin>>super>>hd[i];
adj[i].pb(super);
mp[hd[i]].pb(i);
++out[super];
color[i][hd[i]]=1;
}
// memset(seg,0,sizeof(seg));
//dfs();
//build(0,0,tin);
set<ll> st;
for(ll i=1;i<=n;++i){
if(out[i]==0){
st.insert(i);
}
}
while(st.size()){
ll u=*st.begin();
st.erase(u);
for(auto it:adj[u]){
for(ll i=1;i<505;++i){
color[it][i]+=color[u][i];
}
if(--out[it]==0) st.insert(it);
}
}
while(q--){
cin>>r1>>r2;
ll ans=0;
for(auto it:mp[hd[r1]]){
ans+=color[it][r2];
//show();
}
cout<<ans<<endl;
}
//cout<<color[2][2];
//cout<<qry(0,0,tin,st[1],en[1],2)<<nl;
}