Tietoverkko

import java.util.ArrayList;
import java.util.Scanner;
class Pair {
    public final int key;
    public final int value;

    public Pair(int key, int value) {
        this.key = key;
        this.value = value;
    }
}

public class Main {
    static ArrayList<ArrayList<Pair>> tree;
    static int total;
    static boolean[] kayty;
    static int n;
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        n = input.nextInt();
        tree = new ArrayList<>(n+1);
        for (int i = 0; i < n+1; i++) {
            tree.add(new ArrayList<>());
        }
        kayty = new boolean[n+1];
        for (int i = 0; i < n-1; i++) {
            int a = Integer.parseInt(input.next());
            int b = Integer.parseInt(input.next());
            int x = Integer.parseInt(input.next());
            ArrayList<Pair> neighbors = tree.get(a);
            ArrayList<Pair> neighbors2 = tree.get(b);
            neighbors.add(new Pair(b,x));
            neighbors2.add(new Pair(a,x));
        }
        for (int i = 0; i < tree.size(); i++) {
            kayty = new boolean[n+1];
            kayty[i] = true;
            count(i,Integer.MAX_VALUE);
        }
        System.out.println(total/2);
    }
    private static void count(int index, int min) {
        ArrayList<Pair> naapurit = tree.get(index);
        kayty[index] = true;
        for (Pair naapuri : naapurit) {
            if (!kayty[naapuri.key]) {
                int val = Math.min(min,naapuri.value);
                total += val;
                count(naapuri.key,val);
            }
        }
    }
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED