Submission #525943

#	Time	Username	Problem	Language	Result	Execution time	Memory
525943		Josia	Paths (RMI21_paths)	C++14	36 / 100	1089 ms	11168 KiB

Main

#pragma GCC optimize ("O3")

#include <bits/stdc++.h>

using namespace std;
#define int int64_t



vector<int> parents;
vector<vector<pair<int, int>>> graph;
int n, k;



void merge(priority_queue<int> &A, priority_queue<int> &B) {
    if (A.size() > B.size()) A.swap(B);
    while(A.size()) {B.push(A.top()); A.pop();}
}



priority_queue<int> dfs(int v, int p) {
    priority_queue<int> res;

    res.push(0);

    if (parents[v] != -1) return res;

    parents[v] = p;

    for (auto u: graph[v]) {
        if (parents[u.first] != -1) continue;
        priority_queue<int> tmp = dfs(u.first, v);

        int newElem = tmp.top() + u.second;
        tmp.pop();
        tmp.push(newElem);

        merge(tmp, res);
    }

    return res;
}



// int stl(int v) {
//     vector<priority_queue<int>> tree(n);  // offset, options

//     for (int i = 0; i<n; i++) {
//         if (graph[i].size() == 1 && i!=v) tree[i].push(0);
//     }

//     order.pop_back();

//     for (int i: order) {
//         int newElem = tree[i].top() + parents[i].second;
//         tree[i].pop();
//         tree[i].push(newElem);

//         merge(tree[i], tree[parents[i].first]);
//     }

//     // cerr << "root element: ";

//     // for (int i: tree[v]) {
//     //     cerr << i << " ";
//     // } cerr << "\n";


//     int res = 0;

//     for (int i = 0; i<k; i++) {
//         res += tree[v].top();
//         tree[v].pop();
//     }

//     return res;
// }



void solve() {
    
    cin >> n >> k;
    graph.resize(n);
    parents.resize(n);

    for (int i = 0; i<n-1; i++) {
        int a, b, c; cin >> a >> b >> c;
        a--; b--;
        graph[a].push_back({b, c});
        graph[b].push_back({a, c});
    }

    for (int i = 0; i<n; i++) {
        // parents.clear();
        fill(parents.begin(), parents.end(), -1);

        priority_queue<int> pq = dfs(i, -2);

        // cerr << "order: ";
        // for (auto i: order) {
        //     cerr << i << " ";
        // } cerr << "\n";

        // cerr << "parents: ";
        // for (auto i: parents) {
        //     cerr << i.first << " ";
        // } cerr << "\n";

        int res = 0;

        for (int i = 0; i<k; i++) {
            res += pq.top();
            pq.pop();
        }

        cout << res << "\n";
        // cerr << "result: " << res << "\n";
    }
    


}

signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(0);

    solve();

    return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 11 / 11
• Subtask 3: 17 / 17
• Subtask 4: 0 / 20
• Subtask 5: 0 / 12
• Subtask 6: 0 / 32