제출 #1213609

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1213609		Ghulam_Junaid	Paths (RMI21_paths)	C++20	36 / 100	1094 ms	580 KiB

Main

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 2005;
int n, k, mx, par[N], mark[N];
ll d[N], ans[N];
vector<pair<int, int>> g[N];

void dfs(int v, int p = 0){
    if (d[v] > d[mx]) mx = v;
    for (auto [w, u] : g[v]){
        if (u == p) continue;
        par[u] = v;
        d[u] = d[v] + w * (!mark[u]);
        dfs(u, v);
    }
}

int main(){
    cin >> n >> k;
    for (int i = 0; i < n - 1; i ++){
        int u, v, w;
        cin >> u >> v >> w;
        g[u].push_back({w, v});
        g[v].push_back({w, u});
    }

    if (k == 1){
        dfs(1);
        int v = mx;
        d[v] = 0;
        dfs(v);
        for (int i = 1; i <= n; i ++)
            ans[i] = max(ans[i], d[i]);
        v = mx;
        d[v] = 0;
        dfs(v);
        for (int i = 1; i <= n; i ++)
            ans[i] = max(ans[i], d[i]);
        for (int i = 1; i <= n; i ++)
            cout << ans[i] << '\n';
        return 0;
    }

    for (int v = 1; v <= n; v ++){
        memset(mark, 0, sizeof mark);
        d[v] = 0;
        ll ans = 0;
        for (int i = 0; i < k; i ++){
            mx = v;
            dfs(v);
            
            ans += d[mx];
            int u = mx;

            while (!mark[u]){
                mark[u] = 1;
                if (u == v) break;
                u = par[u];
            }
        }

        cout << ans << '\n';
    }
}

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