제출 #1289203

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289203		EkinOnal	Paths (RMI21_paths)	C++20	68 / 100	1098 ms	55736 KiB

Main

//#pragma GCC optimize("O3,unroll-loops,Ofast")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
 
#define MAX 200005
#define pb push_back
// #define mp make_pair 
#define int long long
#define f first
#define s second
#define vi vector<int>
#define pii pair<int,int>
#define si set<int>
#define vpii vector<pair<int,int>> 
const int mod = 1e9+7;
const int INF = 1e18;
// myMap.begin()->first :  key
// myMap.begin()->second : value
 
int epow(int a,int b){int ans=1;while(b){if(b&1) ans*=a;a*=a;b>>=1;ans%=mod;a%=mod;}return ans%mod;}
int gcd(int a,int b) {if(a<b)swap(a,b);while(b){int tmp=b;b=a%b;a=tmp;}return a;}
int mul(int a,int b){return ((a%mod)*(b%mod))%mod;}
int sum(int a,int b){return ((a%mod)+(b%mod))%mod;}
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
//typedef
// tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_multiset;

vector<vpii> adj;
vpii arr,mx;

void dfs(int node,int par){
	for(auto u : adj[node]){
		if(u.f==par) continue;
		dfs(u.f,node);
		if(!mx[u.f].f){
			if(u.s<=mx[node].f) arr.pb({u.s,u.f});
			else{
				arr.pb({mx[node].f,mx[node].s});
				mx[node].f=u.s; mx[node].s=u.f;
			}
		}
		else{
			if(mx[u.f].f+u.s<=mx[node].f){
				arr.pb({mx[u.f].f+u.s,mx[u.f].s});
			}	
			else{
				arr.pb({mx[node].f,mx[node].s});
				mx[node]={ mx[u.f].f+u.s , mx[u.f].s };
			}
		}
	}
}

vi dist,dep;
void dia(int node,int par){
	for(auto u : adj[node]){
		if(u.f==par) continue;
		dist[u.f]=dist[node]+u.s;
		dia(u.f,node);
	}
}

vector<vi> p,d;
void dfs2(int node,int par){
	dep[node]=dep[par]+1;
	for(int i=1;i<=20;i++){
		p[node][i]=p[p[node][i-1]][i-1];
		d[node][i]=d[node][i-1]+d[p[node][i-1]][i-1];
	}

	for(auto u : adj[node]){
		if(u.f==par) continue;
		p[u.f][0]=node; d[u.f][0]=u.s;
		dfs2(u.f,node);
	}
}

int find_lca(int a,int b){
	if(dep[a]<dep[b]) swap(a,b);
	int fark=dep[a]-dep[b];
	for(int i=20;i>=0;i--){
		if(fark&(1ll<<i)) a=p[a][i];
	}
	if(a==b) return a;

	for(int i=20;i>=0;i--){
		if(p[a][i]!=p[b][i]){
			a=p[a][i], b=p[b][i];
		}
	}
	return p[a][0];
}	
	
void solve(){ 
	int n,k; cin>>n>>k;

	dist.resize(n+5);	adj.resize(n+5); mx.resize(n+5); dep.resize(n+5);	// arr.resize(n+5);
	p = d = vector<vi>(n+5,vi(22));

	for(int i=1;i<n;i++){
		int a,b,c; cin>>a>>b>>c;
		adj[a].pb({b,c}); adj[b].pb({a,c});
	}	

	if(k==1){
		dia(1,0); int node1=1,node2=0;
		for(int i=2;i<=n;i++) if(dist[i]>dist[node1]) node1=i;
		dist[node1]=0;	dia(node1,0);
		for(int i=1;i<=n;i++) if(dist[i]>dist[node2]) node2=i;
	//	cout<<node1<<" "<<node2<<"  23\n";	

		dfs2(1,0);
//		cout<<d[2][20]+d[node1][20]-2*d[find_lca(node1,2)][20] <<"\n\n";

		for(int i=1;i<=n;i++){
cout << max( d[i][20]+d[node1][20]-2*d[find_lca(node1,i)][20] , d[i][20]+d[node2][20]-2*d[find_lca(node2,i)][20] )<<endl;
		}

		return;
	}



	for(int root=1;root<=n;root++){

		dfs(root,0);

		arr.pb({mx[root].f,mx[root].s});
		sort(arr.begin(),arr.end(),greater<pii>());

		int ans=0;
		for(int i=0;i<k;i++) ans+=arr[i].f;
		cout<<ans<<endl;

		arr.clear();
		for(int i=1;i<=n;i++) mx[i]={0,0};

	}


}	
	
int32_t main(/*int32_t argc, char* argv[]*/){
	std::ios_base::sync_with_stdio(0); std::cin.tie(0);	

	int t=1;
	// cin >> t;
	while (t--) solve();
 	
	return 0;
}	

• Subtask 1: 8 / 8
• Subtask 2: 11 / 11
• Subtask 3: 17 / 17
• Subtask 4: 20 / 20
• Subtask 5: 12 / 12
• Subtask 6: 0 / 32