제출 #209285

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
209285		kostia244	Unique Cities (JOI19_ho_t5)	C++17	4 / 100	367 ms	764 KiB

joi2019_ho_t5

#pragma GCC optimize("O2")
#pragma GCC target("avx,avx2,sse,sse2,ssse3,fma,tune=native")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pb push_back
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pi = pair<ll, ll>;
const int maxn = 3e3 + 5;
int n, m, d[maxn], c[maxn];
vi g[maxn];
int ans;
void dfs(int v, int p, int dp) {
	if(dp) {
		if(d[dp]) d[dp]=-1;
		else d[dp] = c[v];
	}
	for(int i : g[v]) if(i!=p) dfs(i, v, dp+1);
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for(int f, t, i = 1; i < n; i++)cin >> f >> t,g[f].pb(t), g[t].pb(f);
	for(int i = 1; i <= n; i++) cin >> c[i];
	for(int i = 1; i <= n; i++) {
		memset(d, 0, sizeof d);
		dfs(i, i, 0);
		set<int> t;
		for(int i = 1; i <= n; i++) if(d[i]>0) t.insert(d[i]);
		cout << t.size() << '\n';
	}
}

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