제출 #670380

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
670380		dozer	Unique Cities (JOI19_ho_t5)	C++14	4 / 100	238 ms	3272 KiB

joi2019_ho_t5

#include <bits/stdc++.h>
using namespace std;
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define endl "\n"
#define sp " "
#define N 2005

vector<int> dist[N];
int arr[N];
vector<int> adj[N];

void dfs(int node, int root, int d)
{
	dist[d].pb(arr[node]);
	for (auto i : adj[node])
		if (i != root) dfs(i, node, d + 1);
}

int32_t main()
{
	fastio();

	int n, m;
	cin>>n>>m;
	for (int i = 1; i < n; i++)
	{
		int u, v;
		cin>>u>>v;
		adj[u].pb(v);
		adj[v].pb(u);
	}

	for (int i = 1; i <= n; i++)
		cin>>arr[i];

	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++) dist[j].clear();
		dfs(i, 0, 1);
		set<int> s;
		for (int j = 2; j <= n; j++)
		{
			if (dist[j].size() == 1) s.insert(dist[j].front());
		}
		cout<<s.size()<<endl;
	}

	cerr<<"time taken : "<<(float)clock() / CLOCKS_PER_SEC<<" seconds\n";
}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 32
• Subtask 3: 0 / 32
• Subtask 4: 0 / 32