Tietoverkko

#include <iostream>
#include <vector>
#include <tuple>
#include <algorithm>

using namespace std;
using ll = long long;

ll k[200200], s[200200];
vector<tuple<int, int, int>> q;

int id(int x);
bool same(int a, int b);
void join(int a, int b);

int main()
{
	int n;
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		k[i] = i;
		s[i] = 1;
	}
	for (int i = 1; i < n; ++i) {
		int a, b, x;
		cin >> a >> b >> x;
		q.emplace_back(x, a, b);
	}
	sort(q.begin(), q.end(), greater<tuple<int, int, int>>());
	ll t = 0;
	for (auto [x, a, b] : q) {
		if (same(a, b)) {
			t += x;
		} else {
			t += s[id(a)]*s[id(b)]*x;
			join(a, b);
		}
	}
	cout << t << endl;
}

int id(int x)
{
	while (k[x] != x)
		x = k[x];
	return x;
}

bool same(int a, int b)
{
	return id(a) == id(b);
}

void join(int a, int b)
{
	a = id(a);
	b = id(b);
	if (s[a] < s[b]) swap(a, b);
	k[b] = a;
	s[a] += s[b];
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED