結果

問題 No.2634 Tree Distance 3
ユーザー akiaa11
提出日時 2024-02-23 01:33:21
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,212 bytes
コンパイル時間 6,056 ms
コンパイル使用メモリ 275,444 KB
最終ジャッジ日時 2025-02-19 18:54:16
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 8 WA * 61
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<(int)n;++i)
#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
#define M_PI 3.14159265358979323846
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
using vectp=vector<tp>;
using vectpll=vector<tpll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}
bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;}

constexpr ll INF=numeric_limits<ll>::max() >> 2;
constexpr int inf=numeric_limits<int>::max() >> 1;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

int op(int a, int b){return max(a, b);}
int e(){return -inf;}

int n;
veci a;
vector<veci> g;
veci solve(){
	cin>>n;
	a.resize(n);
	g.assign(n, {});
	rep(i, n) cin>>a[i];
	rep(i, n - 1){
		int b, c;cin>>b>>c;
		b--, c--;
		g[b].push_back(c);
		g[c].push_back(b);
	}
	veci dp(n), used(n);
	auto dfs = [&](auto f, int v, int p) -> void{
		dp[v] = 1;
		for(int nv : g[v]) if(nv != p && used[nv] == 0){
			f(f, nv, v);
			dp[v] += dp[nv];
		}
	};
	auto dfs2 = [&](auto f, int v, int p, int c) -> int{
		int u = 1;
		for(int nv : g[v]) if(used[nv] == 0){
			if(nv == p) u &= c >= 2 * (c - dp[v]);
			else u &= c >= 2 * dp[nv];
		}
		if(u) return v;
		for(int nv : g[v]) if(nv != p && used[nv] == 0){
			int r = f(f, nv, v, c);
			if(r != -1) return r;
		}
		return -1;
	};
	veci pr(n), sz(n);
	veci ls;
	vector<veci> g2(n);
	auto rec = [&](auto f, int v, int p) -> int{
		dfs(dfs, v, -1);
		int cent = dfs2(dfs2, v, -1, dp[v]);
		pr[cent] = p;
		sz[cent] = dp[v];
		used[cent] = 1;
		for(int nv : g[cent]) if(used[nv] == 0){
			g2[cent].push_back(f(f, nv, cent));
		}
		ls.push_back(cent);
		return cent;
	};
	rec(rec, 0, -1);
	veci dist(n);
	veci b;
	auto dfs3 = [&](auto f, int v, int p) -> void{
		b.push_back(v);
		for(int nv : g[v]) if(nv != p && used[nv] == 0){
			dist[nv] = dist[v] + 1;
			f(f, nv, v);
		}
	};
	vecpii lr(n);
	veci ans(n);
	veci idx(n);
	auto rec2 = [&](auto f, int v) -> void{
		map<int, veci> mp;
		int cnt = 0;
		for(int nv : g2[v]){
			dist[nv] = 1;
			dfs3(dfs3, nv, v);
			int l = cnt, r = cnt + b.size();
			while(b.size()){
				mp[a[b.back()]].push_back(b.back());
				lr[b.back()] = {l, r};
				idx[b.back()] = cnt++;
				b.pop_back();
			}
		}
		lr[v] = {cnt, cnt + 1};
		idx[v] = cnt++;
		mp[a[v]].push_back(v);
		segtree<int, op, e> sg(sz[v]);
		for(auto it = mp.rbegin(); it != mp.rend(); ++it){
			for(int nv : it->se)
					sg.set(idx[nv], dist[nv]);
			for(int nv : it->se){
				chmax(ans[nv], dist[nv] + max(sg.prod(0, lr[nv].fi), sg.prod(lr[nv].se, sz[v])));
			}
		}
		used[v] = 0;
	};
	rep(i, ls.size())
		rec2(rec2, ls[i]);
	return ans;
}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	auto r = solve();
	PrintR(r);
}
0