/*
IN THE NAME OF GOD
*/
#include <bits/stdc++.h>
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<int, pii> ipii;
typedef pair<pii, int> piii;
typedef pair<ll, pll> lpll;
typedef pair<pll, ll> plll;
typedef pair<pii, pii> piipii;
typedef pair<pll, pll> pllpll;
typedef long double ld;
#define SQ 350
#define endl '\n'
#define F first
#define S second
#define Mp make_pair
#define pb push_back
#define pf push_front
#define PQ priority_queue
#define size(x) ((ll)x.size())
#define all(x) (x).begin(),(x).end()
#define kill(x) cout << x << '\n', exit(0);
#define set_dec(x) cout << fixed << setprecision(x);
#define ios ios_base::sync_with_stdio(false), cin.tie(0)
#define fuck(x) cout << "(" << #x << " , " << x << ")" << endl
#define file_io(x,y) freopen(x, "r", stdin); freopen(y, "w", stdout);
const int N = 4e5+25, lg=18;
ll Mod = 1e9+7;
//ll Mod = 998244353;
ll MOD(ll a, ll mod=Mod) {return (a>=0&&a<mod ? a : ((a%mod+mod)%mod));}
ll max(ll a, ll b) {return (a>b ? a : b);}
ll min(ll a, ll b) {return (a<b ? a : b);}
ll abso(ll a) {return (a<0?-a:a);}
inline ll poww(ll a, ll b) {
ll ans = 1;
a=MOD(a);
while (b) {
if (b & 1) ans = MOD(ans*a);
b >>= 1;
a = MOD(a*a);
}
return ans;
}
ll ans = 0;
int n, k, subt[N], mark[N];
ll c[N];
vector<pii> adj[N];
vector<vector<pii>> vec;
inline ll lowbit(int x) { return x & (-x); }
inline void update(int x, int d) { while (x <= n+2) { c[x] += d; x += lowbit(x); } }
inline ll query(int x) {int res = 0; while(x) { res += c[x]; x -= lowbit(x); } return res; }
int findCentroid(int v, int p, int sz) {
for(auto u : adj[v]) {
if(u.F == p || mark[u.F]) continue;
if(subt[u.F] > sz/2) return findCentroid(u.F, v, sz);
}
return v;
}
void calcSubt(int v, int p) {
subt[v] = 1;
for(auto u : adj[v]) {
if(mark[u.F] || u.F == p) continue;
calcSubt(u.F, v);
subt[v] += subt[u.F];
}
}
void calcCandidates(int v, int p, int mx, int l) {
vec.back().pb({mx, l});
if(mx - l >= k) {ans++;}
for(auto u : adj[v]) {
if(u.F == p || mark[u.F]) continue;
calcCandidates(u.F, v, max(u.S, mx), l+1);
}
}
void solve(int v) {
calcSubt(v, 0);
int cent = findCentroid(v, 0, subt[v]);
while(size(vec)) vec.pop_back();
vector<pii> vec2;
for(auto u : adj[cent]) {
if(mark[u.F]) continue;
vec.pb({});
calcCandidates(u.F, cent, u.S, 1);
for(auto it : vec.back()) vec2.pb(it);
}
sort(all(vec2));
for(auto it : vec2) {
if(it.F-k-it.S>=0) ans += ((ll)query(it.F-it.S-k));
update(it.S, 1);
}
for(auto it : vec2) update(it.S, -1);
for(int i=0; i<size(vec); i++) {
vec2 = vec[i];
sort(all(vec2));
for(auto it : vec2) {
if(it.F-it.S-k>=0) ans -= ((ll)query(it.F-it.S-k));
update(it.S, 1);
}
for(auto it : vec2) update(it.S, -1);
}
mark[cent] = 1;
for(auto u : adj[cent]) {
if(mark[u.F]) continue;
solve(u.F);
}
}
int main () {
ios;
cin>>n>>k;
for(int v,u,w,i=1; i<n; i++) {
cin>>v>>u>>w;
adj[v].pb({u, w});
adj[u].pb({v, w});
}
solve(1);
cout<<2*ans<<endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
9684 KB |
Output is correct |
2 |
Correct |
5 ms |
9652 KB |
Output is correct |
3 |
Correct |
6 ms |
9684 KB |
Output is correct |
4 |
Correct |
7 ms |
9812 KB |
Output is correct |
5 |
Correct |
6 ms |
9884 KB |
Output is correct |
6 |
Correct |
6 ms |
9812 KB |
Output is correct |
7 |
Correct |
6 ms |
9812 KB |
Output is correct |
8 |
Correct |
6 ms |
9812 KB |
Output is correct |
9 |
Correct |
5 ms |
9744 KB |
Output is correct |
10 |
Correct |
5 ms |
9728 KB |
Output is correct |
11 |
Correct |
5 ms |
9812 KB |
Output is correct |
12 |
Correct |
6 ms |
9812 KB |
Output is correct |
13 |
Correct |
6 ms |
9812 KB |
Output is correct |
14 |
Correct |
6 ms |
9800 KB |
Output is correct |
15 |
Correct |
6 ms |
9812 KB |
Output is correct |
16 |
Correct |
5 ms |
9812 KB |
Output is correct |
17 |
Correct |
6 ms |
9812 KB |
Output is correct |
18 |
Correct |
6 ms |
9812 KB |
Output is correct |
19 |
Correct |
6 ms |
9812 KB |
Output is correct |
20 |
Correct |
6 ms |
9812 KB |
Output is correct |
21 |
Correct |
6 ms |
9812 KB |
Output is correct |
22 |
Correct |
6 ms |
9812 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
9684 KB |
Output is correct |
2 |
Correct |
5 ms |
9684 KB |
Output is correct |
3 |
Correct |
5 ms |
9684 KB |
Output is correct |
4 |
Correct |
6 ms |
9812 KB |
Output is correct |
5 |
Correct |
26 ms |
11188 KB |
Output is correct |
6 |
Correct |
130 ms |
16996 KB |
Output is correct |
7 |
Correct |
235 ms |
24416 KB |
Output is correct |
8 |
Correct |
285 ms |
24264 KB |
Output is correct |
9 |
Correct |
244 ms |
24268 KB |
Output is correct |
10 |
Correct |
295 ms |
24304 KB |
Output is correct |
11 |
Correct |
240 ms |
24232 KB |
Output is correct |
12 |
Correct |
275 ms |
24308 KB |
Output is correct |
13 |
Correct |
240 ms |
24244 KB |
Output is correct |
14 |
Correct |
286 ms |
24312 KB |
Output is correct |
15 |
Correct |
328 ms |
24244 KB |
Output is correct |
16 |
Correct |
281 ms |
24320 KB |
Output is correct |
17 |
Correct |
284 ms |
24188 KB |
Output is correct |
18 |
Correct |
332 ms |
24316 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
9684 KB |
Output is correct |
2 |
Correct |
5 ms |
9652 KB |
Output is correct |
3 |
Correct |
6 ms |
9684 KB |
Output is correct |
4 |
Correct |
7 ms |
9812 KB |
Output is correct |
5 |
Correct |
6 ms |
9884 KB |
Output is correct |
6 |
Correct |
6 ms |
9812 KB |
Output is correct |
7 |
Correct |
6 ms |
9812 KB |
Output is correct |
8 |
Correct |
6 ms |
9812 KB |
Output is correct |
9 |
Correct |
5 ms |
9744 KB |
Output is correct |
10 |
Correct |
5 ms |
9728 KB |
Output is correct |
11 |
Correct |
5 ms |
9812 KB |
Output is correct |
12 |
Correct |
6 ms |
9812 KB |
Output is correct |
13 |
Correct |
6 ms |
9812 KB |
Output is correct |
14 |
Correct |
6 ms |
9800 KB |
Output is correct |
15 |
Correct |
6 ms |
9812 KB |
Output is correct |
16 |
Correct |
5 ms |
9812 KB |
Output is correct |
17 |
Correct |
6 ms |
9812 KB |
Output is correct |
18 |
Correct |
6 ms |
9812 KB |
Output is correct |
19 |
Correct |
6 ms |
9812 KB |
Output is correct |
20 |
Correct |
6 ms |
9812 KB |
Output is correct |
21 |
Correct |
6 ms |
9812 KB |
Output is correct |
22 |
Correct |
6 ms |
9812 KB |
Output is correct |
23 |
Correct |
5 ms |
9684 KB |
Output is correct |
24 |
Correct |
5 ms |
9684 KB |
Output is correct |
25 |
Correct |
5 ms |
9684 KB |
Output is correct |
26 |
Correct |
6 ms |
9812 KB |
Output is correct |
27 |
Correct |
26 ms |
11188 KB |
Output is correct |
28 |
Correct |
130 ms |
16996 KB |
Output is correct |
29 |
Correct |
235 ms |
24416 KB |
Output is correct |
30 |
Correct |
285 ms |
24264 KB |
Output is correct |
31 |
Correct |
244 ms |
24268 KB |
Output is correct |
32 |
Correct |
295 ms |
24304 KB |
Output is correct |
33 |
Correct |
240 ms |
24232 KB |
Output is correct |
34 |
Correct |
275 ms |
24308 KB |
Output is correct |
35 |
Correct |
240 ms |
24244 KB |
Output is correct |
36 |
Correct |
286 ms |
24312 KB |
Output is correct |
37 |
Correct |
328 ms |
24244 KB |
Output is correct |
38 |
Correct |
281 ms |
24320 KB |
Output is correct |
39 |
Correct |
284 ms |
24188 KB |
Output is correct |
40 |
Correct |
332 ms |
24316 KB |
Output is correct |
41 |
Correct |
5 ms |
9684 KB |
Output is correct |
42 |
Correct |
240 ms |
24292 KB |
Output is correct |
43 |
Correct |
289 ms |
24196 KB |
Output is correct |
44 |
Correct |
265 ms |
24216 KB |
Output is correct |
45 |
Correct |
305 ms |
24260 KB |
Output is correct |
46 |
Correct |
247 ms |
24200 KB |
Output is correct |
47 |
Correct |
285 ms |
24432 KB |
Output is correct |
48 |
Correct |
290 ms |
24244 KB |
Output is correct |
49 |
Correct |
302 ms |
24232 KB |
Output is correct |
50 |
Correct |
293 ms |
24252 KB |
Output is correct |
51 |
Correct |
307 ms |
24272 KB |
Output is correct |
52 |
Correct |
114 ms |
16112 KB |
Output is correct |
53 |
Correct |
132 ms |
16104 KB |
Output is correct |
54 |
Correct |
91 ms |
15940 KB |
Output is correct |
55 |
Correct |
135 ms |
16300 KB |
Output is correct |
56 |
Correct |
130 ms |
16296 KB |
Output is correct |
57 |
Correct |
241 ms |
16464 KB |
Output is correct |
58 |
Correct |
254 ms |
16428 KB |
Output is correct |
59 |
Correct |
258 ms |
16624 KB |
Output is correct |
60 |
Correct |
297 ms |
16620 KB |
Output is correct |
61 |
Correct |
293 ms |
16588 KB |
Output is correct |
62 |
Correct |
207 ms |
16216 KB |
Output is correct |
63 |
Correct |
218 ms |
16304 KB |
Output is correct |
64 |
Correct |
291 ms |
16404 KB |
Output is correct |
65 |
Incorrect |
11 ms |
10068 KB |
Output isn't correct |
66 |
Halted |
0 ms |
0 KB |
- |