제출 #1289259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289259		aeg	Paths (RMI21_paths)	C++20	0 / 100	1095 ms	9628 KiB

Main

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

#define int int64_t

void dfs(int s, int p, vector<vector<pair<int, int>>> const &adj,
         vector<int> &submax, vector<int> &a) {
  for (auto &[to, cost] : adj[s])
    if (to != p) {
      dfs(to, s, adj, submax, a);
      submax[s] = max(submax[s], submax[to] + cost);
    }

  bool flag = false;
  for (auto &[to, cost] : adj[s])
    if (to != p) {
      if (submax[to] + cost != submax[s] || flag)
        a.push_back(submax[to] + cost);
      else
        flag = true;
    }
}

signed main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, k;
  cin >> n >> k;
  vector<vector<pair<int, int>>> adj(n);
  for (int i = 1; i < n; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    a--;
    b--;
    adj[a].emplace_back(b, c);
    adj[b].emplace_back(a, c);
  }

  for (int i = 0; i < n; i++) {
    vector<int> submax(n, 0), a;
    dfs(i, -1, adj, submax, a);
    a.push_back(submax[i]);
    sort(a.begin(), a.end(), greater<int>());
    int ans = 0;
    for (int j = 0; j < k; j++)
      ans += a[i];
    cout << ans << '\n';
  }
}

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