제출 #526447

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
526447		1ne	Regions (IOI09_regions)	C++14	0 / 100	57 ms	14584 KiB

regions

#include<bits/stdc++.h>
using namespace std;
 
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int64_t n,r,q;cin>>n>>r>>q;
vector<int64_t>region(n,-1),parent(n,-1);
cin>>region[0];
region[0]--;
vector<vector<int64_t>>adj(n);
for (int64_t i = 1;i<n;++i){
	cin>>parent[i]>>region[i];
	parent[i]--;
	adj[parent[i]].push_back(i);
	region[i]--;
}
set<pair<int,int>>need;
vector<pair<int,int>>query;
vector<bool>visited(n,false);
vector<int64_t>region_count(r,0);
for (int64_t i = 0;i<q;++i){
	int64_t x,y;cin>>x>>y;
	--x;
	--y;
	need.insert({x,y});
	query.push_back({x,y});
}
map<pair<int64_t,int64_t>,int64_t>brr;
function<void(int64_t)> dfs = [&](int64_t cur){
	if (visited[cur]){
		return;
	}
	visited[cur]=true;
	for (int j = 0;j<r;++j){
		if (j!=region[cur]&&region_count[j]>0&&need.find({j,region[cur]})!=need.end())
			brr[{j,region[cur]}]+=region_count[j];
	}
	region_count[region[cur]]++;
	for (auto x:adj[cur]){
		if (!visited[x])
			dfs(x);
	}
	region_count[region[cur]]--;
};

for (int64_t i = 0;i<n;++i){
	if (!visited[i]){
		dfs(i);
	}
}
for (auto x:query){
	cout<<brr[x]<<endl;
}

return 0;}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 85