| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1170987 | monkey133 | Petrol stations (CEOI24_stations) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i)
#define RFOR(i, x, n) for (ll i =x; i>=n; --i)
#pragma GCC optimize("O3","unroll-loops")
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll n, k;
vector<pii> adj[200005];
ll dp[200005];
ll siz[200005];
map<ll, ll> hh[200005];
ll offset[200005], ans[200005];
void dfs(ll x, ll p, ll c, ll w)
{
if (siz[c]!=-1) return;
siz[c] = 1;
hh[c].clear();
offset[c] = 0;
hh[c][k] = 1;
for (pii u: adj[x]) if (u.f!=p)
{
dfs(u.f, x, u.s.s, u.s.f);
//offset[u.s.s] -= u.s.f;
if (0)
{
swap(hh[c], hh[u.s.s]);
swap(offset[c], offset[u.s.s]);
}
siz[c] += siz[u.s.s];
for (pi y: hh[u.s.s]) hh[c][y.f + offset[u.s.s] -u.f.f - offset[c]] += y.s;
}
ll ps = 0;
//show2(x, p);
assert(hh[c].begin()->f + offset[c]>= 0);
while (hh[c].size() && hh[c].begin()->f + offset[c] < w)
{
ps += hh[c].begin()->s;
hh[c].erase(hh[c].begin());
}
hh[c][k - offset[c]] += ps;
ans[x] += ps * (n-siz[c]);
}
int main()
{
cin >> n >> k;
for (ll i=0; i<2*(n); ++i) siz[i] = -1;
for (ll i=0; i<n-1; ++i)
{
ll u, v, w;
cin >> u >> v >> w;
adj[u].pb(mp(v, mp(w, i)));
adj[v].pb(mp(u, mp(w, i + n-1)));
}
for (ll i=0; i<n; ++i) for (pii u: adj[i]) dfs(u.f, i, u.s.s, u.s.f);
for (ll i=0; i<n; ++i) cout << ans[i] << endl;
return 0;
}