oj.uz

답안 #785928

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
785928 2023-07-17T19:21:30 Z KiaRez Janjetina (COCI21_janjetina) C++17
50 / 110
 284 ms 21208 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], c[N];
vector<pii> adj[N];
vector<vector<pii>> vec;

inline int lowbit(int x) { return x & (-x); }
inline void update(int x, int d) { while (x <= n) { c[x] += d; x += lowbit(x); } }
inline int 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]);

	//cout<<v<<" ==> "<<cent<<endl;
	//fuck(ans);
	
	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(vec.back()));
	}

	//fuck(ans);
	
	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);
	}

	//fuck(ans);

	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);

	//fuck(ans);
	cout<<2*ans<<endl;

	return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5032 KB Output is correct
3 Correct 3 ms 5000 KB Output is correct
4 Correct 4 ms 5088 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 4 ms 5164 KB Output is correct
9 Correct 3 ms 5052 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5024 KB Output is correct
13 Correct 4 ms 5076 KB Output is correct
14 Correct 4 ms 5076 KB Output is correct
15 Correct 3 ms 5040 KB Output is correct
16 Correct 4 ms 5032 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 4 ms 5036 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 4 ms 5076 KB Output is correct
22 Correct 4 ms 5036 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5028 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 4 ms 5160 KB Output is correct
5 Correct 18 ms 6564 KB Output is correct
6 Correct 123 ms 12952 KB Output is correct
7 Correct 252 ms 20704 KB Output is correct
8 Correct 253 ms 21180 KB Output is correct
9 Correct 233 ms 20792 KB Output is correct
10 Correct 271 ms 21048 KB Output is correct
11 Correct 228 ms 20740 KB Output is correct
12 Correct 251 ms 21176 KB Output is correct
13 Correct 266 ms 20752 KB Output is correct
14 Correct 275 ms 21072 KB Output is correct
15 Correct 274 ms 20980 KB Output is correct
16 Correct 271 ms 21048 KB Output is correct
17 Correct 267 ms 21040 KB Output is correct
18 Correct 267 ms 21020 KB Output is correct

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5032 KB Output is correct
3 Correct 3 ms 5000 KB Output is correct
4 Correct 4 ms 5088 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 4 ms 5164 KB Output is correct
9 Correct 3 ms 5052 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5024 KB Output is correct
13 Correct 4 ms 5076 KB Output is correct
14 Correct 4 ms 5076 KB Output is correct
15 Correct 3 ms 5040 KB Output is correct
16 Correct 4 ms 5032 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 4 ms 5036 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 4 ms 5076 KB Output is correct
22 Correct 4 ms 5036 KB Output is correct
23 Correct 2 ms 5028 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 4 ms 5160 KB Output is correct
27 Correct 18 ms 6564 KB Output is correct
28 Correct 123 ms 12952 KB Output is correct
29 Correct 252 ms 20704 KB Output is correct
30 Correct 253 ms 21180 KB Output is correct
31 Correct 233 ms 20792 KB Output is correct
32 Correct 271 ms 21048 KB Output is correct
33 Correct 228 ms 20740 KB Output is correct
34 Correct 251 ms 21176 KB Output is correct
35 Correct 266 ms 20752 KB Output is correct
36 Correct 275 ms 21072 KB Output is correct
37 Correct 274 ms 20980 KB Output is correct
38 Correct 271 ms 21048 KB Output is correct
39 Correct 267 ms 21040 KB Output is correct
40 Correct 267 ms 21020 KB Output is correct
41 Correct 3 ms 4948 KB Output is correct
42 Correct 226 ms 20656 KB Output is correct
43 Correct 250 ms 21208 KB Output is correct
44 Correct 235 ms 20860 KB Output is correct
45 Correct 284 ms 21140 KB Output is correct
46 Correct 221 ms 20744 KB Output is correct
47 Correct 261 ms 21140 KB Output is correct
48 Correct 244 ms 20840 KB Output is correct
49 Correct 269 ms 21100 KB Output is correct
50 Correct 283 ms 20928 KB Output is correct
51 Correct 269 ms 21120 KB Output is correct
52 Correct 90 ms 12748 KB Output is correct
53 Correct 109 ms 13072 KB Output is correct
54 Correct 93 ms 12624 KB Output is correct
55 Correct 125 ms 13188 KB Output is correct
56 Correct 103 ms 13272 KB Output is correct
57 Correct 206 ms 13164 KB Output is correct
58 Correct 231 ms 13592 KB Output is correct
59 Correct 202 ms 13756 KB Output is correct
60 Correct 241 ms 13628 KB Output is correct
61 Correct 246 ms 13504 KB Output is correct
62 Correct 182 ms 12976 KB Output is correct
63 Correct 202 ms 13304 KB Output is correct
64 Correct 232 ms 13376 KB Output is correct
65 Incorrect 9 ms 5500 KB Output isn't correct
66 Halted 0 ms 0 KB -