oj.uz

답안 #1106227

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1106227 2024-10-29T15:18:39 Z Semen07 Petrol stations (CEOI24_stations) C++17
100 / 100
 492 ms 18748 KB 
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define int long long
    
using namespace std;
    
template<typename T>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &u: v) in >> u;
    return in;
}
    
int n, k;
vector<vector<pair<int, int>>> g;
vector<long long> res, w;
vector<int> used, sz, st_to, cnt_to, cnt_from;
vector<pair<long long, int>> srt, st_from;
    
void calc_sz(int v, int p, long long wt) {
    sz[v] = 1;
    w[v] = wt;
    cnt_to[v] = cnt_from[v] = 0;
    for (auto [u, c]: g[v]) {
        if (u == p || used[u]) continue;
        calc_sz(u, v, wt + c);
        sz[v] += sz[u];
    }
}
    
int find_centroid(int v, int p, int full) {
    for (auto [u, c]: g[v]) {
        if (u == p || used[u]) continue;
        if (2 * sz[u] > full) return find_centroid(u, v, full);
    }
    return v;
}
    
void to_centroid(int v, int p, int paths, int mode) {
    st_to.push_back(p);
    cnt_to[v] = 0;
    for (auto [u, c]: g[v]) {
        if (u == p || used[u]) continue;
        to_centroid(u, v, paths, mode);
    }
    res[v] += cnt_to[v] * paths * mode;
    int l = -1, r = (int)st_to.size();
    while (r - l > 1) {
        int mid = (l + r) / 2;
        if (w[v] - w[st_to[mid]] > k) l = mid;
        else r = mid;
    }
    if (r == 0) srt.emplace_back(w[v], cnt_to[v] + 1);
    else cnt_to[st_to[r]] += cnt_to[v] + 1;
    st_to.pop_back();
}
    
void from_centroid_up_to_k(int v, int p, int mode) {
    int left = lower_bound(all(srt), make_pair(k - w[v] + 1, 0ll)) - srt.begin();
    int right = lower_bound(all(srt), make_pair(k - w[p] + 1, 0ll)) - srt.begin();
    int sm = (right > 0) ? srt[right - 1].second: 0;
    if (left > 0) sm -= srt[left - 1].second;
    cnt_from[v] += sm * mode;
    res[p] += sm * sz[v] * mode;
    for (auto [u, c]: g[v]) {
        if (u == p || used[u]) continue;
        from_centroid_up_to_k(u, v, mode);
    }
}

void from_centroid_more_k(int v, int p) {
    int left, right;
    int l = -1, r = (int)st_from.size();
    while (r - l > 1) {
        int mid = (l + r) / 2;
        if (w[p] - st_from[mid].first > k) l = mid;
        else r = mid;
    }
    left = r;
    l = -1, r = (int)st_from.size();
    while (r - l > 1) {
        int mid = (l + r) / 2;
        if (w[v] - st_from[mid].first > k) l = mid;
        else r = mid;
    }
    right = l;
    if (right >= left && right > -1 && left < (int)st_from.size()) {
        int sm = (right >= 0) ? st_from[right].second: 0;
        if (left > 0) sm -= st_from[left - 1].second;
        cnt_from[v] += sm;
        res[p] += sm * sz[v];
    }
    st_from.emplace_back(w[p], (st_from.empty() ? 0: st_from.back().second) + cnt_from[v]);
    for (auto [u, c]: g[v]) {
        if (u == p || used[u]) continue;
        from_centroid_more_k(u, v);
    }
    st_from.pop_back();
}
    
void build_centroid(int v) {
    calc_sz(v, v, 0);
    v = find_centroid(v, v, sz[v]);
    calc_sz(v, v, 0);
    srt.clear();
    srt.emplace_back(0, 1);
    for (auto [u, c]: g[v]) {
        if (!used[u]) to_centroid(u, v, sz[v] - sz[u], 1);
    }
    sort(all(srt));
    for (int i = 1; i < (int)srt.size(); ++i) {
        srt[i].second += srt[i - 1].second;
    }
    for (auto [u, c]: g[v]) {
        if (!used[u]) from_centroid_up_to_k(u, v, 1);
    }
    for (auto [u, c]: g[v]) {
        if (used[u]) continue;
        srt.clear();
        to_centroid(u, v, sz[v] - sz[u], 0);
        sort(all(srt));
        for (int i = 1; i < (int)srt.size(); ++i) {
            srt[i].second += srt[i - 1].second;
        }
        from_centroid_up_to_k(u, v, -1);
    }
    for (auto [u, c]: g[v]) {
        if (!used[u]) from_centroid_more_k(u, v);
    }
    used[v] = 1;
    for (auto [u, c]: g[v]) {
        if (!used[u]) build_centroid(u);
    }
}
    
void solve() {
    cin >> n >> k;
    g.assign(n, {});
    for (int _ = 0; _ < n - 1; ++_) {
        int u, v, c;
        cin >> u >> v >> c;
        g[u].emplace_back(v, c);
        g[v].emplace_back(u, c);
    }
    res.assign(n, 0);
    used.assign(n, 0);
    sz.assign(n, 0);
    w.assign(n, 0);
    cnt_to.assign(n, 0);
    cnt_from.assign(n, 0);
    st_to.clear();
    st_from.clear();
    build_centroid(0);
    for (int i = 0; i < n; ++i) {
        cout << res[i] << '\n';
    }
    cout << '\n';
}
    
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int _t = 1;
#ifdef LOCAL
    freopen("io/main.in", "r", stdin);
    freopen("io/main.out", "w", stdout);
    cin >> _t;
#endif
    while (_t--) solve();
}

Subtask #0
0.0 / 0.0

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

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 2 ms 820 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 1 ms 592 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 445 ms 15104 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 445 ms 15104 KB Output is correct
5 Correct 447 ms 16368 KB Output is correct
6 Correct 492 ms 16960 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 344 ms 9548 KB Output is correct
4 Correct 444 ms 14912 KB Output is correct
5 Correct 432 ms 18748 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 280 ms 10396 KB Output is correct
8 Correct 305 ms 10312 KB Output is correct
9 Correct 310 ms 10312 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 344 ms 9548 KB Output is correct
4 Correct 444 ms 14912 KB Output is correct
5 Correct 432 ms 18748 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 280 ms 10396 KB Output is correct
8 Correct 305 ms 10312 KB Output is correct
9 Correct 310 ms 10312 KB Output is correct
10 Correct 169 ms 11020 KB Output is correct
11 Correct 177 ms 10068 KB Output is correct
12 Correct 187 ms 10056 KB Output is correct
13 Correct 188 ms 10056 KB Output is correct
14 Correct 175 ms 10196 KB Output is correct
15 Correct 184 ms 10060 KB Output is correct
16 Correct 46 ms 14528 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 336 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Correct 2 ms 592 KB Output is correct
6 Correct 2 ms 592 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 2 ms 820 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 1 ms 592 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 445 ms 15104 KB Output is correct
17 Correct 447 ms 16368 KB Output is correct
18 Correct 492 ms 16960 KB Output is correct
19 Correct 344 ms 9548 KB Output is correct
20 Correct 444 ms 14912 KB Output is correct
21 Correct 432 ms 18748 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 280 ms 10396 KB Output is correct
24 Correct 305 ms 10312 KB Output is correct
25 Correct 310 ms 10312 KB Output is correct
26 Correct 169 ms 11020 KB Output is correct
27 Correct 177 ms 10068 KB Output is correct
28 Correct 187 ms 10056 KB Output is correct
29 Correct 188 ms 10056 KB Output is correct
30 Correct 175 ms 10196 KB Output is correct
31 Correct 184 ms 10060 KB Output is correct
32 Correct 46 ms 14528 KB Output is correct
33 Correct 296 ms 13252 KB Output is correct
34 Correct 175 ms 11516 KB Output is correct
35 Correct 184 ms 10716 KB Output is correct
36 Correct 183 ms 10708 KB Output is correct
37 Correct 205 ms 13248 KB Output is correct
38 Correct 242 ms 13256 KB Output is correct
39 Correct 217 ms 13380 KB Output is correct
40 Correct 48 ms 15020 KB Output is correct