oj.uz

답안 #534798

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
534798 2022-03-09T02:05:13 Z rk42745417 Unique Cities (JOI19_ho_t5) C++17
4 / 100
 2000 ms 42464 KB 
/*
--------------              |   /
      |                     |  /
      |                     | /
      |             *       |/          |    |         ------            *
      |                     |           |    |        /      \
      |             |       |\          |    |       |       |\          |
   \  |             |       | \         |    |       |       | \         |
    \ |             |       |  \        |    |        \     /   \        |
     V              |       |   \        \__/|         -----     \       |
*/
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << "\e[1;31m" << #x << " = " << (x) << "\e[0m\n"
#define print(x) emilia_mata_tenshi(#x, begin(x), end(x))
template<typename T> void emilia_mata_tenshi(const char *s, T l, T r) {
	cerr << "\e[1;33m" << s << " = [";
	while(l != r) {
		cerr << *l;
		cerr << (++l == r ? ']' : ',');
	}
	cerr << "\e[0m\n";
}

#define EmiliaMyWife ios::sync_with_stdio(0); cin.tie(NULL);
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using uint = uint32_t;
const double EPS  = 1e-8;
const int INF     = 0x3F3F3F3F;
const ll LINF     = 4611686018427387903;
const int MOD     = 1e9+7;
static int Lamy_is_cute = []() {
	EmiliaMyWife
	return 48763;
}();
/*--------------------------------------------------------------------------------------*/

const int N = 2e5 + 25;
vector<int> edge[N];
int max_dep[N], ans[N], arr[N], dep[N];
pair<int, int> cal_dia(int u, int p) {
	pair<int, int> res = {0, u};
	for(int v : edge[u]) {
		if(v == p)
			continue;
		auto r = cal_dia(v, u);
		r.first++;
		res = max(res, r);
	}
	return res;
}
void cal_maxdep(int u, int p) {
	max_dep[u] = 0;
	for(int v : edge[u]) {
		if(v == p)
			continue;
		dep[v] = dep[u] + 1;
		cal_maxdep(v, u);
		max_dep[u] = max(max_dep[u], max_dep[v] + 1);
	}
}

int cnt[N], res = 0;
stack<int, vector<int>> cur;
void add(int x) {
	cur.push(x);
	if(cnt[arr[x]] == 0)
		res++;
	cnt[arr[x]]++;
}
void undo(stack<int, vector<int>> &del) {
	while(!del.empty())
		add(del.top()), del.pop();
}
void rem(stack<int, vector<int>> &del) {
	cnt[arr[cur.top()]]--;
	if(cnt[arr[cur.top()]] == 0)
		res--;
	del.push(cur.top());
	cur.pop();
}
void rem() {
	cnt[arr[cur.top()]]--;
	if(cnt[arr[cur.top()]] == 0)
		res--;
	cur.pop();
}
void cal_ans(int u, int p) {
	stack<int, vector<int>> del;
	int mx = 0, smx = 0;
	for(int v : edge[u]) {
		if(v == p)
			continue;
		if(max_dep[v] + 1 > mx)
			swap(mx, smx), mx = max_dep[v] + 1;
		else
			smx = max(smx, max_dep[v] + 1);
	}
	for(int v : edge[u]) {
		if(v == p || max_dep[v] + 1 != mx)
			continue;
		while(!cur.empty() && dep[cur.top()] >= dep[u] - smx)
			rem(del);
		add(u);
		cal_ans(v, u);
		rem();
	}
	for(int v : edge[u]) {
		if(v == p || max_dep[v] + 1 == mx)
			continue;
		while(!cur.empty() && dep[cur.top()] >= dep[u] - mx)
			rem(del);
		add(u);
		cal_ans(v, u);
		rem();
	}

	while(!cur.empty() && dep[cur.top()] >= dep[u] - max_dep[u])
		rem(del);
	ans[u] = max(ans[u], res);
	undo(del);
}

signed main() {
	int n, m;
	cin >> n >> m;
	for(int i = 1, u, v; i < n; i++) {
		cin >> u >> v;
		edge[u].push_back(v);
		edge[v].push_back(u);
	}
	for(int i = 1; i <= n; i++)
		cin >> arr[i];

	auto [_, d1] = cal_dia(1, 1);
	auto [__, d2] = cal_dia(d1, d1);
	for(int d : {d1, d2}) {
		dep[d] = 0;
		cal_maxdep(d, d);
		cal_ans(d, d);
	}

	for(int i = 1; i <= n; i++)
		cout << ans[i] << '\n';
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 4 ms 5068 KB Output is correct
3 Correct 21 ms 5196 KB Output is correct
4 Correct 20 ms 5196 KB Output is correct
5 Correct 4 ms 5068 KB Output is correct
6 Correct 53 ms 5324 KB Output is correct
7 Correct 15 ms 5196 KB Output is correct
8 Correct 4 ms 5068 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 4 ms 5068 KB Output is correct
12 Correct 4 ms 5068 KB Output is correct
13 Correct 46 ms 5324 KB Output is correct
14 Correct 11 ms 5252 KB Output is correct
15 Correct 11 ms 5196 KB Output is correct
16 Correct 3 ms 5068 KB Output is correct
17 Correct 28 ms 5324 KB Output is correct
18 Correct 18 ms 5404 KB Output is correct
19 Correct 4 ms 5068 KB Output is correct
20 Correct 61 ms 5416 KB Output is correct
21 Correct 17 ms 5280 KB Output is correct
22 Correct 4 ms 5136 KB Output is correct
23 Correct 4 ms 5184 KB Output is correct
24 Correct 4 ms 5168 KB Output is correct
25 Correct 4 ms 5068 KB Output is correct
26 Correct 3 ms 5068 KB Output is correct
27 Correct 28 ms 5380 KB Output is correct
28 Correct 27 ms 5328 KB Output is correct
29 Correct 12 ms 5264 KB Output is correct
30 Correct 4 ms 5068 KB Output is correct
31 Correct 29 ms 5340 KB Output is correct
32 Correct 20 ms 5284 KB Output is correct

Subtask #2
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 150 ms 10696 KB Output is correct
2 Execution timed out 2075 ms 27156 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 211 ms 13508 KB Output is correct
2 Execution timed out 2071 ms 42464 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 4 ms 5068 KB Output is correct
3 Correct 21 ms 5196 KB Output is correct
4 Correct 20 ms 5196 KB Output is correct
5 Correct 4 ms 5068 KB Output is correct
6 Correct 53 ms 5324 KB Output is correct
7 Correct 15 ms 5196 KB Output is correct
8 Correct 4 ms 5068 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 4 ms 5068 KB Output is correct
12 Correct 4 ms 5068 KB Output is correct
13 Correct 46 ms 5324 KB Output is correct
14 Correct 11 ms 5252 KB Output is correct
15 Correct 11 ms 5196 KB Output is correct
16 Correct 3 ms 5068 KB Output is correct
17 Correct 28 ms 5324 KB Output is correct
18 Correct 18 ms 5404 KB Output is correct
19 Correct 4 ms 5068 KB Output is correct
20 Correct 61 ms 5416 KB Output is correct
21 Correct 17 ms 5280 KB Output is correct
22 Correct 4 ms 5136 KB Output is correct
23 Correct 4 ms 5184 KB Output is correct
24 Correct 4 ms 5168 KB Output is correct
25 Correct 4 ms 5068 KB Output is correct
26 Correct 3 ms 5068 KB Output is correct
27 Correct 28 ms 5380 KB Output is correct
28 Correct 27 ms 5328 KB Output is correct
29 Correct 12 ms 5264 KB Output is correct
30 Correct 4 ms 5068 KB Output is correct
31 Correct 29 ms 5340 KB Output is correct
32 Correct 20 ms 5284 KB Output is correct
33 Correct 150 ms 10696 KB Output is correct
34 Execution timed out 2075 ms 27156 KB Time limit exceeded
35 Halted 0 ms 0 KB -