Tietoverkko

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
vector<pair<ll,ll>> v[200010];
ll et[200010];
ll n;

void haku(ll s, ll e, ll d) {
  for (auto u : v[s]) {
    if (u.first == e) continue;
    haku(u.first, s, min(d, u.second));
  }
  if (d == 1000000007) et[s] = 0;
  else et[s] = d;
}

int main() {
  ll a, b, x;
  cin >> n;
  for (int i = 0; i < n-1; i++) {
    cin >> a >> b >> x;
    v[a].push_back({b, x});
    v[b].push_back({a, x});
  }
  ll s = 0;
  for (int i = 1; i <= n; i++) {
    haku(i, -1, 1000000007);
    for (int j = 1; j <= n; j++) {
      //cout << j << " " << et[j] << endl;
      s += et[j];
    }
  }
  cout << s/2 << endl;

}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED