oj.uz

Submission #1036524

# Submission time Handle Problem Language Result Execution time Memory
1036524 2024-07-27T13:31:24 Z model_code Petrol stations (CEOI24_stations) C++17
100 / 100
 2103 ms 1082960 KB 
// Author: Pepa Minařík
#include <bits/stdc++.h>

using namespace std;

#define ll long long

int n;
ll k;

struct tree {
    int sum = 0;
    tree *left_child = nullptr, *right_child = nullptr;

    void extend(ll left, ll right) {
        if (!left_child && left + 1 < right) {
            left_child = new tree();
            right_child = new tree();
        }
    }

	void add(ll kk, ll x, ll left = 0, ll right = (n + 1) * k)
	{
        sum += x;
        if (left + 1 < right) {
            if (kk < (left + right) / 2)
			{
				if (!left_child) left_child = new tree();
                left_child->add(kk, x, left, (left + right) / 2);
			}
            else
			{
				if (!right_child) right_child = new tree();
                right_child->add(kk, x, (left + right) / 2, right);
			}
        }
	}

	int get_sum(ll lq, ll rq, ll left = 0, ll right = (n + 1) * k) {
        if (lq <= left && right <= rq)
            return sum;
        if (max(left, lq) >= min(right, rq))
            return 0;
		ll answer = 0;
		if (left_child)
			answer += left_child->get_sum(lq, rq, left, (left + right) / 2);
		if (right_child)
			answer += right_child->get_sum(lq, rq, (left + right) / 2, right);
        return answer;
    }
};


ll ans[100005];
bool blocked[100005];
int depth[100005], siz[100005], keys[100005], multiplicity[100005];
int pred[100005][20];
ll dist[100005][20];
vector<pair<int, int>> graf[100005];
map<int, vector<pair<int, int>>> key_to_cars[100005];

void stage_up(int v, int f, int d, int l, int key)
{
	depth[v] = d;
	pred[v][0] = f;
	dist[v][0] = l;
	keys[v] = key;
	siz[v] = multiplicity[v] = 1;
	for (int i = 1; i < 20; i++)
	{
		pred[v][i] = pred[pred[v][i-1]][i-1];
		dist[v][i] = dist[v][i-1] + dist[pred[v][i-1]][i-1];
	}
	for (auto u : graf[v])
	{
		if (u.first == f || blocked[u.first]) continue;
		int new_key = key;
		if (d == 0)
			new_key = u.first;
		stage_up(u.first, v, d+1, u.second, new_key);
		siz[v] += siz[u.first];
	}

	int u = v;
	ll dist_from_v = 0;
	for (int i = 19; i >= 0; i--)
	{
		if (dist_from_v + dist[u][i] <= k)
		{
			dist_from_v += dist[u][i];
			u = pred[u][i];
		}
	}
	if (depth[u])
		multiplicity[u] += multiplicity[v];
	else
        key_to_cars[u][keys[v]].push_back({k - dist_from_v, multiplicity[v]});
}

void stage_down(int v, int f, ll dist_from_root, tree *t, int total_size, int key_size)
{
	ans[v] += (multiplicity[v] - 1) * (ll)(total_size - key_size);
	for (auto u : graf[v])
	{
		if (u.first == f || blocked[u.first]) continue;
		if (!dist_from_root)
			for (auto car: key_to_cars[v][keys[u.first]])
				t->add(car.first, -car.second);	
		ll multiplicity_to_add = t->get_sum(dist_from_root, dist_from_root + u.second);
		ans[v] += multiplicity_to_add * (ll)siz[u.first];
        t->add(dist_from_root + k, multiplicity_to_add);
		int new_key_size = depth[v] ? key_size : siz[u.first];
		stage_down(u.first, v, dist_from_root + u.second, t, total_size, new_key_size);
        t->add(dist_from_root + k, -multiplicity_to_add);
		if (!dist_from_root)
			for (auto car: key_to_cars[v][keys[u.first]])
				t->add(car.first, car.second);	
	}
}


int find_centroid(int v, int f, int s)
{
	for (auto u : graf[v])
	{
		if (u.first == f || blocked[u.first]) continue;
		if (siz[u.first] > s/2)
			return find_centroid(u.first, v, s);
	}
	return v;
}

void solve(int v)
{
	stage_up(v, v, 0, 0, -1);
    tree *t = new tree();
	for (auto pair: key_to_cars[v])
		for (auto car : pair.second)
			t->add(car.first, car.second);

	stage_down(v, v, 0, t, siz[v], 0);

	blocked[v] = true;
	for (auto u : graf[v])
	{
		if (blocked[u.first]) continue;
		int c = find_centroid(u.first, v, siz[u.first]);
		solve(c);
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> k;
	int u, v, l;
	for (int i = 0; i < n-1; i++)
	{
		cin >> u >> v >> l;
		graf[u].push_back({v, l});
		graf[v].push_back({u, l});
	}
	solve(0);

	for (int i = 0; i < n; i++)
		cout << ans[i] << "\n";	
	return 0;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 7 ms 16476 KB Output is correct
4 Correct 7 ms 16220 KB Output is correct
5 Correct 6 ms 16476 KB Output is correct
6 Correct 9 ms 18012 KB Output is correct
7 Correct 7 ms 16472 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 6 ms 16732 KB Output is correct
10 Correct 7 ms 16732 KB Output is correct
11 Correct 6 ms 16732 KB Output is correct
12 Correct 6 ms 16732 KB Output is correct
13 Correct 8 ms 16732 KB Output is correct
14 Correct 6 ms 15708 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 530 ms 126976 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 530 ms 126976 KB Output is correct
5 Correct 1778 ms 1082960 KB Output is correct
6 Correct 1836 ms 1077884 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 567 ms 106320 KB Output is correct
4 Correct 707 ms 148336 KB Output is correct
5 Correct 1044 ms 184672 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 608 ms 115416 KB Output is correct
8 Correct 631 ms 115488 KB Output is correct
9 Correct 532 ms 115604 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 567 ms 106320 KB Output is correct
4 Correct 707 ms 148336 KB Output is correct
5 Correct 1044 ms 184672 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 608 ms 115416 KB Output is correct
8 Correct 631 ms 115488 KB Output is correct
9 Correct 532 ms 115604 KB Output is correct
10 Correct 419 ms 103520 KB Output is correct
11 Correct 418 ms 101408 KB Output is correct
12 Correct 450 ms 98284 KB Output is correct
13 Correct 471 ms 106028 KB Output is correct
14 Correct 543 ms 101076 KB Output is correct
15 Correct 547 ms 104784 KB Output is correct
16 Correct 280 ms 88384 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 7 ms 16476 KB Output is correct
4 Correct 7 ms 16220 KB Output is correct
5 Correct 6 ms 16476 KB Output is correct
6 Correct 9 ms 18012 KB Output is correct
7 Correct 7 ms 16472 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 6 ms 16732 KB Output is correct
10 Correct 7 ms 16732 KB Output is correct
11 Correct 6 ms 16732 KB Output is correct
12 Correct 6 ms 16732 KB Output is correct
13 Correct 8 ms 16732 KB Output is correct
14 Correct 6 ms 15708 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 530 ms 126976 KB Output is correct
17 Correct 1778 ms 1082960 KB Output is correct
18 Correct 1836 ms 1077884 KB Output is correct
19 Correct 567 ms 106320 KB Output is correct
20 Correct 707 ms 148336 KB Output is correct
21 Correct 1044 ms 184672 KB Output is correct
22 Correct 3 ms 12892 KB Output is correct
23 Correct 608 ms 115416 KB Output is correct
24 Correct 631 ms 115488 KB Output is correct
25 Correct 532 ms 115604 KB Output is correct
26 Correct 419 ms 103520 KB Output is correct
27 Correct 418 ms 101408 KB Output is correct
28 Correct 450 ms 98284 KB Output is correct
29 Correct 471 ms 106028 KB Output is correct
30 Correct 543 ms 101076 KB Output is correct
31 Correct 547 ms 104784 KB Output is correct
32 Correct 280 ms 88384 KB Output is correct
33 Correct 2103 ms 1080544 KB Output is correct
34 Correct 928 ms 377604 KB Output is correct
35 Correct 989 ms 438512 KB Output is correct
36 Correct 1143 ms 432544 KB Output is correct
37 Correct 1310 ms 532660 KB Output is correct
38 Correct 1398 ms 539660 KB Output is correct
39 Correct 1337 ms 542400 KB Output is correct
40 Correct 471 ms 182980 KB Output is correct