#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
Normie's Template v2.5
Changes:
Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
a=(a<b)?a:b;
}
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
a=(a>b)?a:b;
}
//Constants.
#define MOD (ll(1000000007))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
if (!x) return 1;
ll res=BOW(a,x/2,p);
res*=res;
res%=p;
if (x%2) res*=a;
return res%p;
}
ll INV(ll a, ll p)
{
return BOW(a,p-2,p);
}
//---------END-------//
#endif
struct autoSum {
multiset<ll> top,bot;
ll lim,sum=0;
void init(int k) {
lim=k;
}
void insert(ll x) {
// cout<<"insert "<<x<<endl;
top.insert(x); sum+=x;
if (top.size()>lim) {
auto it = top.begin();
sum-=(*it);
bot.insert(*it);
top.erase(it);
}
// cout<<"end insert "<<x<<endl;
// for (auto g : top) cout<<g<<' '; cout<<endl;
// for (auto g : bot) cout<<g<<' '; cout<<endl;
}
void replace(ll x, ll y) {
// cout<<"replace "<<x<<' '<<y<<endl;
auto it = top.find(x);
if (it!=top.end()) {
top.erase(it);
top.insert(y);
sum+=y-x;
}
else {
auto it2=bot.find(x);
bot.erase(it2);
bot.insert(y);
}
if (bot.size()) {
auto it1=top.begin();
auto it2=bot.end(); it2--;
if ((*it1)<(*it2)) {
ll u1=(*it1), u2=(*it2);
top.erase(it1);
bot.erase(it2);
top.insert(u2);
bot.insert(u1);
sum+=u2-u1;
}
}
// cout<<"end replace "<<x<<' '<<y<<endl;
// for (auto g : top) cout<<g<<' '; cout<<endl;
// for (auto g : bot) cout<<g<<' '; cout<<endl;
}
};
ll n,m,i,j,k,t,t1,u,v,a,b,res,factor,root;
vector<pii(int)> gt[100001];
ll sum[100001];
ll rep[100001];
ll ans[100001];
autoSum as;
void dfs(int x, pii(int) p) {
// cout<<"dfs "<<x<<' '<<p.fi<<' '<<p.se<<endl;
int u=-1;
for (auto g : gt[x]) if (g.fi-p.fi) {
dfs(g.fi,{x,g.se});
if (u==-1 || sum[rep[g.fi]]>sum[rep[u]]) u=g.fi;
}
if (u==-1) {
rep[x]=x;
sum[x]+=p.se;
as.insert(p.se);
}
else {
rep[x]=rep[u];
as.replace(sum[rep[x]],sum[rep[x]]+p.se);
sum[rep[x]]+=p.se;
}
}
void calc(int x, pii(int) p) {
// cout<<"calc "<<x<<' '<<p.fi<<' '<<p.se<<endl;
ans[x]=as.sum;
if (gt[x].size()>=2) {
sort(gt[x].begin(), gt[x].end(), [](pii(int) a, pii(int) b){return (sum[rep[a.fi]]>sum[rep[b.fi]]);});
for (int i=0;i<gt[x].size();i++) if (gt[x][i].fi-p.fi) {
if (i==0) {
rep[x]=rep[gt[x][1].fi];
as.replace(sum[rep[x]],sum[rep[x]]+gt[x][0].se);
sum[rep[x]]+=gt[x][0].se;
as.replace(sum[rep[gt[x][0].fi]],sum[rep[gt[x][0].fi]]-gt[x][0].se);
sum[rep[gt[x][0].fi]]-=gt[x][0].se;
calc(gt[x][0].fi,{x,gt[x][0].se});
as.replace(sum[rep[gt[x][0].fi]],sum[rep[gt[x][0].fi]]+gt[x][0].se);
sum[rep[gt[x][0].fi]]+=gt[x][0].se;
as.replace(sum[rep[x]],sum[rep[x]]-gt[x][0].se);
sum[rep[x]]-=gt[x][0].se;
}
else {
rep[x]=rep[gt[x][0].fi];
as.replace(sum[rep[x]],sum[rep[x]]+gt[x][i].se);
sum[rep[x]]+=gt[x][i].se;
as.replace(sum[rep[gt[x][i].fi]],sum[rep[gt[x][i].fi]]-gt[x][i].se);
sum[rep[gt[x][i].fi]]-=gt[x][i].se;
calc(gt[x][i].fi,{x,gt[x][i].se});
as.replace(sum[rep[gt[x][i].fi]],sum[rep[gt[x][i].fi]]+gt[x][i].se);
sum[rep[gt[x][i].fi]]+=gt[x][i].se;
as.replace(sum[rep[x]],sum[rep[x]]-gt[x][i].se);
sum[rep[x]]-=gt[x][i].se;
}
}
}
}
int main()
{
fio;
cin>>n>>k;
if (n==1) {
cout<<0;
return 0;
}
if (n==2) {
cin>>a>>b>>u;
cout<<u<<endl;
cout<<u<<endl;
return 0;
}
for (i=1;i<n;i++) {
cin>>a>>b>>u;
gt[a].push_back({b,u});
gt[b].push_back({a,u});
}
for (root=1;root<=n;root++) if (gt[root].size()>=2) break;
as.init(k);
dfs(root,{-1,0});
calc(root,{-1,0});
for (i=1;i<=n;i++) cout<<ans[i]<<endl;
}
Compilation message
Main.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
23 | #pragma comment(linker, "/stack:200000000")
|
Main.cpp: In member function 'void autoSum::insert(ll)':
Main.cpp:110:17: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
110 | if (top.size()>lim) {
| ~~~~~~~~~~^~~~
Main.cpp: In function 'void calc(int, std::pair<int, int>)':
Main.cpp:181:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
181 | for (int i=0;i<gt[x].size();i++) if (gt[x][i].fi-p.fi) {
| ~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
2636 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
2636 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
2636 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
2636 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
175 ms |
12644 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
2636 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
