Submission #854294

#	Time	Username	Problem	Language	Result	Execution time	Memory
854294		ivaaaaaaan	Paths (RMI21_paths)	C++17	56 / 100	206 ms	792 KiB

Main

#include <bits/stdc++.h>

using namespace std;

struct str
{
    long long x, idx;
    bool operator < (const str & aux) const
    {
        return x < aux.x;
    }
};

const long long max_size = 2e3 + 1;

vector <pair <long long, long long>> mc[max_size];
long long dp[max_size], best[max_size], t[max_size];

void dfs (long long nod, long long par, long long val)
{
    dp[nod] = 0;
    best[nod] = 0;
    for (auto f : mc[nod])
    {
        if (f.first == par)
        {
            continue;
        }
        dfs(f.first, nod, f.second);
        if (dp[nod] < dp[f.first])
        {
            dp[nod] = dp[f.first];
            best[nod] = f.first;
        }
    }
    dp[nod] += val;
}

void dfs2 (long long nod, long long par, long long cap)
{
    t[nod] = cap;
    if (best[nod] == 0)
    {
        return;
    }
    dfs2(best[nod], nod, cap);
    for (auto f : mc[nod])
    {
        if (f.first == best[nod] || f.first == par)
        {
            continue;
        }
        dfs2(f.first, nod, f.first);
    }
}

signed main ()
{
    long long n, k;
    cin >> n >> k;
    for (long long i = 1; i < n; i++)
    {
        long long x, y, c;
        cin >> x >> y >> c;
        mc[x].push_back({y, c});
        mc[y].push_back({x, c});
    }
    for (long long i = 1; i <= n; i++)
    {
        long long ans = 0;
        t[i] = 0;
        dfs(i, 0, 0);
        dfs2(i, 0, i);
        priority_queue <str> pq;
        for (long long j = 1; j <= n; j++)
        {
            if (t[j] == j)
            {
                pq.push({dp[j], j});
            }
        }
        for (long long j = 1; j <= k; j++)
        {
            if (pq.empty())
            {
                break;
            }
            ans += pq.top().x;
            pq.pop();
        }
        cout << ans;
        if (i < n)
        {
            cout << '\n';
        }
    }
    return 0;
}

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