제출 #913983

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
913983		MilosMilutinovic	Hard route (IZhO17_road)	C++14	100 / 100	688 ms	93160 KiB

road

#include<bits/stdc++.h>
 
#define pb push_back
#define fi first
#define se second
#define mp make_pair
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
 
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
 
ll readint(){
	ll x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
 
int n,tot;
int mx[500005],cnt[500005];
vector<int> g[500005];
ll res=0,c=1;
 
void addedge(int x,int y){ g[x].pb(y); g[y].pb(x); }
 
void dfs(int x,int px,int d){
	mx[x]=d;
	cnt[x]=1;
	for(auto&v:g[x]){
		if(v==px) continue;
		dfs(v,x,d+1);
		if(mx[v]==mx[x]) cnt[x]+=cnt[v];
		else if(mx[x]<mx[v]) cnt[x]=cnt[v];
		mx[x]=max(mx[x],mx[v]);
	}
}
 
void reroot(int x,int px,int dep){
	for(auto&v:g[x]){
		if(v!=px) mx[v]-=dep;
	}
	sort(g[x].begin(),g[x].end(),[&](int i,int j){return mx[i]>mx[j];});
	if((int)g[x].size()>=3){
		ll cur=0,cc=0;
		cur=mx[g[x][0]]*1ll*(mx[g[x][1]]+mx[g[x][2]]);
		ll s=0;
		for(int j=0;j<(int)g[x].size();j++){
			if(mx[g[x][j]]==mx[g[x][2]]) cc+=s*cnt[g[x][j]];
			if(mx[g[x][j]]==mx[g[x][1]]) s+=cnt[g[x][j]];
		}
		if(res<cur) res=cur,c=cc;
		else if(res==cur) c+=cc;
	}
	int mx_bef=mx[x],cnt_bef=cnt[x];
	int a=0,b=1,c=-1,d=0;
	for(auto&v:g[x]){
		if(mx[v]>a) c=a,d=b,a=mx[v],b=cnt[v];
		else if(mx[v]==a) b+=cnt[v];
		else if(mx[v]>c) c=mx[v],d=cnt[v];
		else if(mx[v]==c) d+=cnt[v];
	}
	for(auto&v:g[x]){
		if(v==px) continue;
		mx[x]=(mx[v]==a&&cnt[v]==b?c:a)+1;
		cnt[x]=(mx[v]==a&&cnt[v]==b?d:b-(mx[v]==a?cnt[v]:0));
		reroot(v,x,dep+1);
	}
	mx[x]=mx_bef;
	cnt[x]=cnt_bef;
}
 
int main(){
	n=readint();
	for(int i=1;i<n;i++) addedge(readint(),readint());
	dfs(1,1,0);
	reroot(1,1,0);
	printf("%lld %lld\n",res,c);
	return 0;
}

• Subtask 1: 19 / 19
• Subtask 2: 33 / 33
• Subtask 3: 48 / 48