結果
| 問題 | No.2634 Tree Distance 3 |
| ユーザー |
 HIR180
|
| 提出日時 | 2024-02-17 01:50:38 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 2,133 ms / 3,000 ms |
| コード長 | 8,446 bytes |
| コンパイル時間 | 4,954 ms |
| コンパイル使用メモリ | 202,736 KB |
| 最終ジャッジ日時 | 2025-02-19 15:21:09 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 69 |
ソースコード
//Let's join Kaede Takagaki Fan Club !!#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#include <cstdio>#include <cstring>#include <cstdlib>#include <cmath>#include <ctime>#include <cassert>#include <string>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <functional>#include <iostream>#include <map>#include <set>//#include <unordered_map>//#include <unordered_set>#include <cassert>#include <iomanip>#include <chrono>#include <random>#include <bitset>#include <complex>#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>//#include <atcoder/convolution>//#include <atcoder/lazysegtree>//#include <atcoder/maxflow>//#include <atcoder/mincostflow>//#include <atcoder/segtree>//#include <atcoder/string>using namespace std;//using namespace atcoder;#define int long long//#define L __int128typedef long long ll;typedef pair<int,int> P;typedef pair<int,P> P1;typedef pair<P,P> P2;#define pu push#define pb push_back#define eb emplace_back#define mp make_pair#define eps 1e-7#define INF 1000000000#define a first#define b second#define fi first#define sc second#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)#define rep(i,x) for(int i=0;i<x;i++)#define gnr(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)#define per(i,b) gnr(i,0,b)#define repn(i,x) for(int i=1;i<=x;i++)#define SORT(x) sort(x.begin(),x.end())#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())#define all(x) x.begin(),x.end()#define si(x) (int)(x.size())#define pcnt(x) __builtin_popcountll(x)#define all(x) x.begin(),x.end()#ifdef LOCAL#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl#else#define dmp(x) void(0)#endiftemplate<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}template<class t> using vc=vector<t>;template<class t,class u>ostream& operator<<(ostream& os,const pair<t,u>& p){return os<<"{"<<p.fi<<","<<p.sc<<"}";}template<class t> ostream& operator<<(ostream& os,const vc<t>& v){os<<"{";for(auto e:v)os<<e<<",";return os<<"}";}//https://codeforces.com/blog/entry/62393struct custom_hash {static uint64_t splitmix64(uint64_t x) {// http://xorshift.di.unimi.it/splitmix64.cx += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}//don't make x negative!size_t operator()(pair<int,int> x)const{return operator()(uint64_t(x.first)<<32|x.second);}};//unordered_set -> dtype, null_type//unordered_map -> dtype(key), dtype(value)using namespace __gnu_pbds;template<class t,class u>using hash_table=gp_hash_table<t,u,custom_hash>;template<class T>void o(const T &a,bool space=false){cout << a << (space?' ':'\n');}//ios::sync_with_stdio(false);const ll mod = 998244353;//const ll mod = 1000000007;mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());struct mint{ll v;mint(ll vv=0){s(vv%mod+mod);}mint& s(ll vv){v=vv<mod?vv:vv-mod;return *this;}mint operator-()const{return mint()-*this;}mint &operator+=(const mint&rhs){return s(v+rhs.v);}mint &operator-=(const mint&rhs){return s(v+mod-rhs.v);}mint &operator*=(const mint&rhs){v=ll(v)*rhs.v%mod;return *this;}mint &operator/=(const mint&rhs){return *this*=rhs.inv();}mint operator+(const mint&rhs)const{return mint(*this)+=rhs;}mint operator-(const mint&rhs)const{return mint(*this)-=rhs;}mint operator*(const mint&rhs)const{return mint(*this)*=rhs;}mint operator/(const mint&rhs)const{return mint(*this)/=rhs;}mint pow(ll n)const{if(n<0)return inv().pow(-n);mint res(1),x(*this);while(n){if(n&1)res*=x;x*=x;n>>=1;}return res;}mint inv()const{return pow(mod-2);}friend mint operator+(ll x,const mint&y){return mint(x)+y;}friend mint operator-(ll x,const mint&y){return mint(x)-y;}friend mint operator*(ll x,const mint&y){return mint(x)*y;}friend mint operator/(ll x,const mint&y){return mint(x)/y;}friend ostream& operator<<(ostream&os,const mint&m){return os<<m.v;}friend istream& operator>>(istream&is,mint&m){ll x;is>>x;m=mint(x);return is;}bool operator<(const mint&r)const{return v<r.v;}bool operator==(const mint&r)const{return v==r.v;}bool operator!=(const mint&r)const{return v!=r.v;}explicit operator bool()const{return v;}};ll modpow(ll x,ll n,ll _md=mod){ll res=1;while(n>0){if(n&1) res=res*x%_md;x=x*x%_md;n>>=1;}return res;}#define _sz 1mint F[_sz],R[_sz];void make(){F[0] = 1;for(int i=1;i<_sz;i++) F[i] = F[i-1] * i;R[_sz-1] = F[_sz-1].pow(mod-2);for(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1);}mint C(int a,int b){if(b < 0 || a < b) return mint();return F[a]*R[b]*R[a-b];}using ld=long double;using vi=vc<int>;using ull=unsigned long long;/*int dst(P p, P q){return (p.a-q.a)*(p.a-q.a)+(p.b-q.b)*(p.b-q.b);}*//*template<class t>void add_inplace(t &a, t b){if(a.size() < b.size()) swap(a, b);for(int i=0;i<si(b);i++){a[i] += b[i];if(a[i] < 0) a[i] += mod;if(a[i] >= mod) a[i] -= mod;}return ;}*/template<class t>void ov(const vc<t>&a){if(a.empty()) return;rep(i, si(a)) cout << a[i] << (i+1==si(a)?'\n':' ');}//o(ans?"Yes":"No");#define SZ 200005int n;vector<int>edge[SZ];int up[20][SZ],dep[SZ];struct dbling{bool ready = 0;void dfs(int v,int u,int d){up[0][v] = u; dep[v] = d;rep(i,edge[v].size()){if(edge[v][i] == u) continue;dfs(edge[v][i], v, d+1);}}void prepare(){dfs(1,-1,0);rep(j,19){rep(i,SZ){if(up[j][i] == -1) up[j+1][i] = up[j][i];else up[j+1][i] = up[j][up[j][i]];}}ready = 1;}int get(int a,int b){if(dep[a] > dep[b]) swap(a,b);int D = dep[b]-dep[a];rep(i,20){if(((D>>i)&1)) b = up[i][b];}if(a == b) return a;for(int i=19;i>=0;i--){if(up[i][a] != up[i][b]){a = up[i][a];b = up[i][b];}}return up[0][a];}int dist(int a,int b){int c = get(a,b);return dep[a]+dep[b]-2*dep[c];}int dist(int a,int b,int c){//assuming c is lca of (a,b)return dep[a]+dep[b]-2*dep[c];}int go_up(int v,int a){if(dep[v] < a) return -1;rep(i,20) if(((a>>i)&1)) v = up[i][v];return v;}//a ---- b//と並べたときのx番目 (1-indexed)//存在しない場合は-1を返す//verified : opencup Warsaw Iint v_on_path(int a,int b,int x){int c = get(a,b);int d = dist(a,b,c);if(x <= 0 || x > d+1) return -1;if(x <= dep[a]-dep[c]+1){return go_up(a, x-1);}else{x = d+2-x;return go_up(b, x-1);}}vc<int>get_path(int a, int b){int upp = get(a, b);int cur;vc<int>ret;cur = a;while(1){ret.pb(cur);if(cur == upp) break;cur = up[0][cur];}vc<int>ret2;cur = b;while(1){if(cur == upp) break;ret2.pb(cur);cur = up[0][cur];}reverse(all(ret2));int geta = ret.size();ret.resize(ret.size()+ret2.size());rep(i, ret2.size()) ret[geta+i] = ret2[i];return ret;}P diam(){P p = mp(-1,-1);repn(i,n) chmax(p,mp(dist(1,i), i));int u = p.b;p = mp(-1,-1);repn(i,n)chmax(p,mp(dist(u,i), i));int v = p.b;return mp(u, v);}}kaede;void solve(){cin>>n;map<int,vi>ht;repn(i,n){int v;cin>>v;ht[-v].pb(i);}rep(i,n-1){int a,b;cin>>a>>b;edge[a].eb(b);edge[b].eb(a);}kaede.prepare();int u=-1,v=-1;vi ans(n+1);for(auto [_,vec]:ht){for(auto e:vec){if(u == -1){u = e, v = e;}else{int len = kaede.dist(u,v);int ue = kaede.dist(u,e);int ve = kaede.dist(v,e);if(ue > ve and ue > len){v = e;}else if(ue <= ve and ve > len){u = e;}}}cerr<<u<<" "<<v<<endl;for(auto e:vec){ans[e] = max(kaede.dist(u,e), kaede.dist(v,e));}}repn(i,n) cout<<ans[i]<<(i==n?'\n':' ');}signed main(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20);int t; t = 1; //cin >> t;while(t--) solve();}