oj.uz

답안 #1042213

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1042213 2024-08-02T16:10:06 Z Lucpp Petrol stations (CEOI24_stations) C++17
100 / 100
 1392 ms 189180 KB 
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
using ll = long long;

constexpr int NODES = 11e6;
constexpr ll MAX = 1ll << 46;
ll seg[NODES];
int L[NODES], R[NODES];
int nxtNode = 1;

int upd(ll p, ll x, int i, ll l = 0, ll r = MAX){
	int node = nxtNode++;
	seg[node] = seg[i];
	L[node] = L[i];
	R[node] = R[i];
	if(l+1 == r) seg[node] += x;
	else{
		ll m = (l + r) / 2;
		if(p < m) L[node] = upd(p, x, L[i], l, m);
		else R[node] = upd(p, x, R[i], m, r);
		seg[node] = seg[L[node]] + seg[R[node]];
	}
	return node;
}

ll qry(ll ql, ll qr, int i, ll l = 0, ll r = MAX){
	if(i == 0) return 0;
	if(ql <= l && r <= qr) return seg[i];
	if(r <= ql || qr <= l) return 0;
	ll m = (l + r) / 2;
	return qry(ql, qr, L[i], l, m) + qry(ql, qr, R[i], m, r);
}


vector<vector<pair<int, ll>>> g;
ll k;
vector<ll> ans;

vector<int> sub;
vector<vector<pair<ll, int>>> segInit;
vector<int> cars;
vector<pair<ll, int>> depthHist;

void subDfs(int u, int par){
	sub[u] = 1;
	for(auto [v, len] : g[u]){
		if(v == par) continue;
		subDfs(v, u);
		sub[u] += sub[v];
	}
}

int findCent(int u, int par, int want){
	for(auto [v, len] : g[u]){
		if(v != par && sub[v] > want) return findCent(v, u, want);
	}
	return u;
}

void goUp(int u, int par, ll depth, int start, ll factor){
	depthHist.emplace_back(depth, u);
	cars[u] = 0;
	for(auto [v, len] : g[u]){
		if(v == par) continue;
		goUp(v, u, depth + len, start, factor);
	}
	ans[u] += cars[u] * factor;
	cars[u]++;
	if(depth <= k) segInit[start].emplace_back(depth, cars[u]);
	else{
		auto it = lower_bound(all(depthHist), make_pair(depth - k, -1));
		cars[it->second] += cars[u];
	}
	depthHist.pop_back();
}

void goDown(int u, int par, ll depth, ll parLen, int node){
	ll cnt = qry(max(0ll, depth-k-parLen), depth-k, node);
	ans[par] += cnt * sub[u];
	node = upd(depth - parLen, cnt, node);
	for(auto [v, len] : g[u]){
		if(v == par) continue;
		goDown(v, u, depth+len, len, node);
	}
}

void solve(int s){
	if(g[s].empty()) return;
	nxtNode = 1;
	subDfs(s, -1);
	int cent = findCent(s, -1, sub[s]/2);
	subDfs(cent, -1);
	// cerr << cent << "\n";
	int node = 0;
	for(auto [u, len] : g[cent]){
		segInit[u].clear();
		goUp(u, cent, len, u, sub[cent] - sub[u]);
		for(auto [d, cnt] : segInit[u]){
			node = upd(k-d, cnt, node);
		}
	}
	node = upd(k, 1, node);
	// for(ll x : ans) cerr << x << " ";
	// cerr << "\n";
	for(auto [u, len] : g[cent]){
		int myNode = node;
		for(auto [d, cnt] : segInit[u]){
			myNode = upd(k-d, -cnt, myNode);
		}
		goDown(u, cent, k+len, len, myNode);
	}
	// for(ll x : ans) cerr << x << " ";
	// cerr << "\n";
	vector<int> childs;
	for(auto [u, len] : g[cent]) childs.push_back(u);
	for(int u : childs){
		for(auto it = g[u].begin(); it != g[u].end(); it++){
			if(it->first == cent){
				g[u].erase(it);
				break;
			}
		}
	}
	g[cent].clear();
	for(int u : childs){
		solve(u);
	}
}
	
int main(){
	cin.tie(0)->sync_with_stdio(false);
	int n;
	cin >> n >> k;
	g.resize(n);
	for(int i = 0; i < n-1; i++){
		int u, v; ll len;
		cin >> u >> v >> len;
		g[u].emplace_back(v, len);
		g[v].emplace_back(u, len);
	}
	ans.resize(n);
	sub.resize(n);
	segInit.resize(n);
	cars.resize(n);
	solve(0);
	for(ll x : ans) cout << x << "\n";
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 6 ms 2140 KB Output is correct
4 Correct 9 ms 2852 KB Output is correct
5 Correct 3 ms 1372 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 9 ms 2936 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 1372 KB Output is correct
10 Correct 5 ms 1372 KB Output is correct
11 Correct 4 ms 1288 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 4 ms 1372 KB Output is correct
14 Correct 3 ms 2648 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 745 ms 65220 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 745 ms 65220 KB Output is correct
5 Correct 830 ms 66720 KB Output is correct
6 Correct 1392 ms 143876 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 718 ms 66780 KB Output is correct
4 Correct 808 ms 67020 KB Output is correct
5 Correct 1174 ms 189180 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 591 ms 63576 KB Output is correct
8 Correct 593 ms 63596 KB Output is correct
9 Correct 582 ms 63600 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 718 ms 66780 KB Output is correct
4 Correct 808 ms 67020 KB Output is correct
5 Correct 1174 ms 189180 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 591 ms 63576 KB Output is correct
8 Correct 593 ms 63596 KB Output is correct
9 Correct 582 ms 63600 KB Output is correct
10 Correct 402 ms 66888 KB Output is correct
11 Correct 515 ms 64500 KB Output is correct
12 Correct 503 ms 64336 KB Output is correct
13 Correct 448 ms 64080 KB Output is correct
14 Correct 462 ms 64080 KB Output is correct
15 Correct 495 ms 64204 KB Output is correct
16 Correct 157 ms 166688 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 6 ms 2140 KB Output is correct
4 Correct 9 ms 2852 KB Output is correct
5 Correct 3 ms 1372 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 9 ms 2936 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 1372 KB Output is correct
10 Correct 5 ms 1372 KB Output is correct
11 Correct 4 ms 1288 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 4 ms 1372 KB Output is correct
14 Correct 3 ms 2648 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 745 ms 65220 KB Output is correct
17 Correct 830 ms 66720 KB Output is correct
18 Correct 1392 ms 143876 KB Output is correct
19 Correct 718 ms 66780 KB Output is correct
20 Correct 808 ms 67020 KB Output is correct
21 Correct 1174 ms 189180 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 591 ms 63576 KB Output is correct
24 Correct 593 ms 63596 KB Output is correct
25 Correct 582 ms 63600 KB Output is correct
26 Correct 402 ms 66888 KB Output is correct
27 Correct 515 ms 64500 KB Output is correct
28 Correct 503 ms 64336 KB Output is correct
29 Correct 448 ms 64080 KB Output is correct
30 Correct 462 ms 64080 KB Output is correct
31 Correct 495 ms 64204 KB Output is correct
32 Correct 157 ms 166688 KB Output is correct
33 Correct 1159 ms 172576 KB Output is correct
34 Correct 421 ms 66660 KB Output is correct
35 Correct 533 ms 64596 KB Output is correct
36 Correct 475 ms 64344 KB Output is correct
37 Correct 870 ms 174488 KB Output is correct
38 Correct 881 ms 174536 KB Output is correct
39 Correct 894 ms 174568 KB Output is correct
40 Correct 222 ms 167104 KB Output is correct