結果

問題 No.2634 Tree Distance 3
ユーザー kaikeykaikey
提出日時 2024-02-16 22:36:06
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 951 ms / 3,000 ms
コード長 5,845 bytes
コンパイル時間 2,527 ms
コンパイル使用メモリ 227,360 KB
実行使用メモリ 58,012 KB
最終ジャッジ日時 2024-09-28 21:11:34
合計ジャッジ時間 40,021 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 618 ms
58,008 KB
testcase_01 AC 642 ms
58,008 KB
testcase_02 AC 638 ms
58,008 KB
testcase_03 AC 637 ms
58,004 KB
testcase_04 AC 642 ms
58,012 KB
testcase_05 AC 466 ms
38,212 KB
testcase_06 AC 481 ms
38,200 KB
testcase_07 AC 471 ms
38,320 KB
testcase_08 AC 569 ms
57,480 KB
testcase_09 AC 573 ms
57,400 KB
testcase_10 AC 567 ms
57,400 KB
testcase_11 AC 543 ms
57,268 KB
testcase_12 AC 542 ms
57,256 KB
testcase_13 AC 345 ms
37,880 KB
testcase_14 AC 349 ms
37,528 KB
testcase_15 AC 338 ms
37,636 KB
testcase_16 AC 647 ms
50,020 KB
testcase_17 AC 346 ms
31,096 KB
testcase_18 AC 484 ms
37,908 KB
testcase_19 AC 523 ms
44,384 KB
testcase_20 AC 126 ms
17,408 KB
testcase_21 AC 849 ms
39,548 KB
testcase_22 AC 750 ms
40,692 KB
testcase_23 AC 699 ms
41,372 KB
testcase_24 AC 951 ms
57,464 KB
testcase_25 AC 932 ms
56,824 KB
testcase_26 AC 859 ms
57,592 KB
testcase_27 AC 867 ms
37,140 KB
testcase_28 AC 854 ms
37,644 KB
testcase_29 AC 757 ms
37,260 KB
testcase_30 AC 623 ms
36,900 KB
testcase_31 AC 614 ms
37,000 KB
testcase_32 AC 555 ms
37,004 KB
testcase_33 AC 335 ms
27,472 KB
testcase_34 AC 51 ms
8,192 KB
testcase_35 AC 142 ms
17,680 KB
testcase_36 AC 83 ms
11,640 KB
testcase_37 AC 195 ms
20,100 KB
testcase_38 AC 3 ms
6,820 KB
testcase_39 AC 4 ms
6,816 KB
testcase_40 AC 3 ms
6,820 KB
testcase_41 AC 3 ms
6,820 KB
testcase_42 AC 3 ms
6,820 KB
testcase_43 AC 180 ms
20,692 KB
testcase_44 AC 108 ms
14,936 KB
testcase_45 AC 639 ms
48,448 KB
testcase_46 AC 362 ms
33,356 KB
testcase_47 AC 727 ms
53,720 KB
testcase_48 AC 736 ms
56,708 KB
testcase_49 AC 728 ms
56,708 KB
testcase_50 AC 764 ms
56,652 KB
testcase_51 AC 769 ms
56,700 KB
testcase_52 AC 756 ms
56,716 KB
testcase_53 AC 4 ms
6,820 KB
testcase_54 AC 3 ms
6,816 KB
testcase_55 AC 3 ms
6,820 KB
testcase_56 AC 4 ms
6,820 KB
testcase_57 AC 3 ms
6,820 KB
testcase_58 AC 2 ms
6,820 KB
testcase_59 AC 2 ms
6,816 KB
testcase_60 AC 647 ms
56,864 KB
testcase_61 AC 646 ms
56,740 KB
testcase_62 AC 638 ms
56,740 KB
testcase_63 AC 470 ms
56,280 KB
testcase_64 AC 281 ms
38,372 KB
testcase_65 AC 445 ms
53,044 KB
testcase_66 AC 104 ms
18,560 KB
testcase_67 AC 83 ms
15,924 KB
testcase_68 AC 295 ms
38,192 KB
testcase_69 AC 287 ms
38,176 KB
testcase_70 AC 292 ms
38,196 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
#include <random>
#include <chrono>
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(30); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto mul = [](T a, T b) -> T { return a * b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>; using VVVl = V<V<Vl>>;
template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {
    for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");
    return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
    for (T& in : v) is >> in;
    return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <class F> struct rec {
    F f;
    rec(F&& f_) : f(std::forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&... args) const {
        return f(*this, std::forward<Args>(args)...);
    }
};
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a > limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 2e18;
lint dx[8] = { 0, 1, 0, -1, 1, -1, 1, -1 }, dy[8] = { 1, 0, -1, 0, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
    lint from, to;
    lint cost;
    Edge() {

    }
    Edge(lint u, lint v, lint c) {
        cost = c;
        from = u;
        to = v;
    }
    bool operator<(const Edge& e) const {
        return cost < e.cost;
    }
};
struct WeightedEdge {
    lint to;
    lint cost;
    WeightedEdge(lint v, lint c) {
        to = v;
        cost = c;
    }
    bool operator<(const WeightedEdge& e) const {
        return cost < e.cost;
    }
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<lint, plint> tlint;
typedef pair<ld, ld> pld;
typedef pair<plint, plint> qlint;
typedef pair<Edge, lint> pEd;
typedef pair<plint, V<plint>> vVl;
typedef pair<string, string> pstr;
typedef pair<ld, lint> pint;

template< typename G >
struct DoublingLowestCommonAncestor {
	int LOG = 2;
	vector< int > dep;
	const G& g;
	vector< vector< int > > table;

	DoublingLowestCommonAncestor(const G& g) : g(g), dep(g.size()) {
		int curr = 1;
		while (curr < g.size()) {
			curr *= 2;
			LOG++;
		}
		table.assign(LOG, vector< int >(g.size(), -1));
	}

	void dfs(int idx, int par, int d) {
		table[0][idx] = par;
		dep[idx] = d;
		for (auto& to : g[idx]) {
			if (to != par) dfs(to, idx, d + 1);
		}
	}

	void build() {
		dfs(0, -1, 0);
		for (int k = 0; k + 1 < LOG; k++) {
			for (int i = 0; i < table[k].size(); i++) {
				if (table[k][i] == -1) table[k + 1][i] = -1;
				else table[k + 1][i] = table[k][table[k][i]];
			}
		}
	}

	int query(int u, int v) {
		if (dep[u] > dep[v]) swap(u, v);
		for (int i = LOG - 1; i >= 0; i--) {
			if (((dep[v] - dep[u]) >> i) & 1) v = table[i][v];
		}
		if (u == v) return u;
		for (int i = LOG - 1; i >= 0; i--) {
			if (table[i][u] != table[i][v]) {
				u = table[i][u];
				v = table[i][v];
			}
		}
		return table[0][u];
	}
};

void solve() {
	lint N;
	cin >> N;
	Vl arr(N);
	cin >> arr;
	map<lint, Vl> fx;
	REP(i, N) {
		fx[arr[i]].push_back(i);
	}

	VVl to(N);
	REP(i, N - 1) {
		lint u, v;
		cin >> u >> v; u--; v--;
		to[u].push_back(v);
		to[v].push_back(u);
	}

	DoublingLowestCommonAncestor lca(to);
	lca.build();

	Vl ans(N);
	plint edge = { -1, -1 };
	auto itr = fx.rbegin();

	auto dist = [&](lint v, lint u) {
		return lca.dep[u] + lca.dep[v] - lca.dep[lca.query(u, v)] * 2;
	};

	while (itr != fx.rend()) {
		for (auto v : (*itr).second) {
			if (edge.first == -1) edge.first = v;
			else if (edge.second == -1) edge.second = v;
			else {
				Vl _arr = { edge.first, edge.second, v };
				lint maxv = 0;
				REP(i, 3) {
					FOR(j, i + 1, 3) {
						if (chmax(maxv, (lint)dist(_arr[i], _arr[j]))) {
							edge = { _arr[i], _arr[j] };
						}
					}
				}
			}
		}
		for (auto v : (*itr).second) {
			if (edge.first != -1) chmax(ans[v], (lint)dist(v, edge.first));
			if (edge.second != -1) chmax(ans[v], (lint)dist(v, edge.second));
		}
		itr++;
	}

	cout << ans << endk;
}

int main() {
    lint T = 1;
    //cin >> T;
    while (T--) solve();
}
0