Tietoverkko

#include <iostream>
#include <vector>

using namespace std;

vector<pair<int, int>> adj_list[200001];

int dfs(int c, int p, int min1){
    int ans = 0;
    for(auto nei : adj_list[c]){
        if(nei.second == p)continue;
        ans += min(min1, nei.first);
        ans += dfs(nei.second, c, min(min1, nei.first));
    }
    return ans;
}

int main(){

    int n; cin >> n;
    for(int i = 0; i < n - 1; ++i){
        int a, b, x;; cin >> a >> b >> x;
        adj_list[a].push_back(make_pair(x, b));
        adj_list[b].push_back(make_pair(x, a));
    }
    int ans = 0;
    for(int i = 1; i <= n; ++i){
        ans += dfs(i, 0, 1e9);
    }
    cout << ans/2;

return 0;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED