oj.uz

Submission #785938

# Submission time Handle Problem Language Result Execution time Memory
785938 2023-07-17T19:30:34 Z KiaRez Janjetina (COCI21_janjetina) C++17
50 / 110
 326 ms 19896 KB 
/*
    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 = 2e5+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;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 5028 KB Output is correct
4 Correct 4 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 4 ms 5076 KB Output is correct
8 Correct 4 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 4 ms 5076 KB Output is correct
13 Correct 4 ms 5204 KB Output is correct
14 Correct 4 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 4 ms 5040 KB Output is correct
17 Correct 3 ms 5036 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 4 ms 5044 KB Output is correct
21 Correct 4 ms 5044 KB Output is correct
22 Correct 4 ms 5076 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 5032 KB Output is correct
4 Correct 4 ms 5076 KB Output is correct
5 Correct 20 ms 6584 KB Output is correct
6 Correct 127 ms 12524 KB Output is correct
7 Correct 278 ms 19808 KB Output is correct
8 Correct 273 ms 19772 KB Output is correct
9 Correct 242 ms 19888 KB Output is correct
10 Correct 300 ms 19800 KB Output is correct
11 Correct 229 ms 19772 KB Output is correct
12 Correct 277 ms 19852 KB Output is correct
13 Correct 240 ms 19808 KB Output is correct
14 Correct 292 ms 19828 KB Output is correct
15 Correct 299 ms 19808 KB Output is correct
16 Correct 283 ms 19848 KB Output is correct
17 Correct 326 ms 19896 KB Output is correct
18 Correct 279 ms 19780 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 5028 KB Output is correct
4 Correct 4 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 4 ms 5076 KB Output is correct
8 Correct 4 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 4 ms 5076 KB Output is correct
13 Correct 4 ms 5204 KB Output is correct
14 Correct 4 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 4 ms 5040 KB Output is correct
17 Correct 3 ms 5036 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 4 ms 5044 KB Output is correct
21 Correct 4 ms 5044 KB Output is correct
22 Correct 4 ms 5076 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 2 ms 4948 KB Output is correct
25 Correct 3 ms 5032 KB Output is correct
26 Correct 4 ms 5076 KB Output is correct
27 Correct 20 ms 6584 KB Output is correct
28 Correct 127 ms 12524 KB Output is correct
29 Correct 278 ms 19808 KB Output is correct
30 Correct 273 ms 19772 KB Output is correct
31 Correct 242 ms 19888 KB Output is correct
32 Correct 300 ms 19800 KB Output is correct
33 Correct 229 ms 19772 KB Output is correct
34 Correct 277 ms 19852 KB Output is correct
35 Correct 240 ms 19808 KB Output is correct
36 Correct 292 ms 19828 KB Output is correct
37 Correct 299 ms 19808 KB Output is correct
38 Correct 283 ms 19848 KB Output is correct
39 Correct 326 ms 19896 KB Output is correct
40 Correct 279 ms 19780 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 232 ms 19824 KB Output is correct
43 Correct 303 ms 19812 KB Output is correct
44 Correct 251 ms 19808 KB Output is correct
45 Correct 292 ms 19856 KB Output is correct
46 Correct 230 ms 19872 KB Output is correct
47 Correct 285 ms 19792 KB Output is correct
48 Correct 253 ms 19844 KB Output is correct
49 Correct 285 ms 19880 KB Output is correct
50 Correct 283 ms 19864 KB Output is correct
51 Correct 283 ms 19772 KB Output is correct
52 Correct 108 ms 11684 KB Output is correct
53 Correct 115 ms 11628 KB Output is correct
54 Correct 80 ms 11472 KB Output is correct
55 Correct 115 ms 11768 KB Output is correct
56 Correct 119 ms 11832 KB Output is correct
57 Correct 216 ms 11984 KB Output is correct
58 Correct 234 ms 11904 KB Output is correct
59 Correct 225 ms 12284 KB Output is correct
60 Correct 251 ms 12188 KB Output is correct
61 Correct 255 ms 12148 KB Output is correct
62 Correct 213 ms 11752 KB Output is correct
63 Correct 224 ms 11860 KB Output is correct
64 Correct 257 ms 12004 KB Output is correct
65 Incorrect 9 ms 5504 KB Output isn't correct
66 Halted 0 ms 0 KB -