#951905 (C++17) No.2634 Tree Distance 3

提出ソース

結果

問題	No.2634 Tree Distance 3
ユーザー	HIR180
提出日時	2024-02-17 03:28:35
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	411 ms / 3,000 ms
コード長	7,726 bytes
コンパイル時間	3,671 ms
コンパイル使用メモリ	198,888 KB
実行使用メモリ	172,044 KB
最終ジャッジ日時	2024-09-28 23:30:04
合計ジャッジ時間	26,997 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	404 ms 171,284 KB
testcase_01	AC	409 ms 171,340 KB
testcase_02	AC	378 ms 171,232 KB
testcase_03	AC	386 ms 171,240 KB
testcase_04	AC	389 ms 171,232 KB
testcase_05	AC	302 ms 162,408 KB
testcase_06	AC	294 ms 162,500 KB
testcase_07	AC	307 ms 162,532 KB
testcase_08	AC	358 ms 170,708 KB
testcase_09	AC	350 ms 170,768 KB
testcase_10	AC	346 ms 170,596 KB
testcase_11	AC	348 ms 170,576 KB
testcase_12	AC	354 ms 170,648 KB
testcase_13	AC	255 ms 162,024 KB
testcase_14	AC	256 ms 161,636 KB
testcase_15	AC	253 ms 161,920 KB
testcase_16	AC	293 ms 171,576 KB
testcase_17	AC	172 ms 137,908 KB
testcase_18	AC	216 ms 155,636 KB
testcase_19	AC	250 ms 168,280 KB
testcase_20	AC	91 ms 96,144 KB
testcase_21	AC	264 ms 165,720 KB
testcase_22	AC	266 ms 167,640 KB
testcase_23	AC	265 ms 168,660 KB
testcase_24	AC	345 ms 171,884 KB
testcase_25	AC	346 ms 170,624 KB
testcase_26	AC	357 ms 172,044 KB
testcase_27	AC	272 ms 161,908 KB
testcase_28	AC	270 ms 162,960 KB
testcase_29	AC	262 ms 162,332 KB
testcase_30	AC	291 ms 161,204 KB
testcase_31	AC	284 ms 161,336 KB
testcase_32	AC	294 ms 161,292 KB
testcase_33	AC	196 ms 156,100 KB
testcase_34	AC	56 ms 80,032 KB
testcase_35	AC	114 ms 119,140 KB
testcase_36	AC	75 ms 91,588 KB
testcase_37	AC	135 ms 132,384 KB
testcase_38	AC	27 ms 59,248 KB
testcase_39	AC	27 ms 57,244 KB
testcase_40	AC	27 ms 57,116 KB
testcase_41	AC	25 ms 57,176 KB
testcase_42	AC	26 ms 57,300 KB
testcase_43	AC	117 ms 105,936 KB
testcase_44	AC	86 ms 89,096 KB
testcase_45	AC	310 ms 166,008 KB
testcase_46	AC	200 ms 145,244 KB
testcase_47	AC	353 ms 168,656 KB
testcase_48	AC	385 ms 170,004 KB
testcase_49	AC	376 ms 170,120 KB
testcase_50	AC	375 ms 170,028 KB
testcase_51	AC	369 ms 170,064 KB
testcase_52	AC	368 ms 170,056 KB
testcase_53	AC	26 ms 57,136 KB
testcase_54	AC	28 ms 59,184 KB
testcase_55	AC	27 ms 57,472 KB
testcase_56	AC	27 ms 57,288 KB
testcase_57	AC	26 ms 57,320 KB
testcase_58	AC	26 ms 56,996 KB
testcase_59	AC	26 ms 55,184 KB
testcase_60	AC	411 ms 170,100 KB
testcase_61	AC	398 ms 169,980 KB
testcase_62	AC	403 ms 169,972 KB
testcase_63	AC	330 ms 169,572 KB
testcase_64	AC	232 ms 157,712 KB
testcase_65	AC	311 ms 168,432 KB
testcase_66	AC	103 ms 101,252 KB
testcase_67	AC	87 ms 95,740 KB
testcase_68	AC	253 ms 161,716 KB
testcase_69	AC	254 ms 161,628 KB
testcase_70	AC	249 ms 161,788 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

//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 __int128
typedef 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)
#endif
 
template<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/62393
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		// http://xorshift.di.unimi.it/splitmix64.c
		x += 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 1
mint 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 200005
int n;
vector<int>edge[SZ];
P ar[SZ*2]={};
int pos[SZ]={},id=0,up[SZ],dep[SZ];
P mn[20][SZ*2]={};
int sz[SZ*2]={};
struct LCA{
	//SZは元の木の頂点数より大
	//外部でedge[]に隣接状況を持って置く必要あり
	
	void dfs(int v,int u,int d){
		pos[v] = id; up[v] = u; dep[v] = d;
		ar[id++] = mp(d,v);
		for(int i=0;i<edge[v].size();i++){
			if(edge[v][i] == u) continue;
			dfs(edge[v][i],v,d+1);
			ar[id++] = mp(d,v);
		}
	}
	void prepare(){
		dfs(1,-1,0);
		for(int i=0;i<id;i++) mn[0][i] = ar[i];
		for(int j=0;j<19;j++){
			for(int i=0;i<id;i++){
				if(i+(1<<j) >= id) mn[j+1][i] = mn[j][i];
				else mn[j+1][i] = min(mn[j][i], mn[j][i+(1<<j)]);
			}
		}
		for(int i=1;i<SZ*2;i++){
			for(int j=0;j<20;j++){
				if((1<<j) <= i && i <= (2<<j)){
					sz[i] = j;
					break;
				}
			}
		}
	}
	int get(int a,int b){
		int len = max(pos[a],pos[b]) - min(pos[a],pos[b]) + 1;
		int ty = sz[len];
		P p = min(mn[ty][min(pos[a],pos[b])], mn[ty][max(pos[a],pos[b])-(1<<ty)+1]);
		return p.second;
	}
	int dist(int a,int b){
		return dep[a]+dep[b]-dep[get(a,b)]*2;
	}
}kaede;


void solve(){
	cin>>n;
	vi a(n+1), za;
	repn(i,n){
		int v;cin>>v;
		za.pb(v);
		a[i] = v;
	}
	SORT(za); ERASE(za);
	vc<vi>mem(si(za));
	repn(i,n) mem[POSL(za,a[i])].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(int i=si(za)-1;i>=0;i--){
		auto &vec=mem[i];
		
		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();
}

yukicoder

結果

テストケース

ソースコード