Sadonkorjuu

import java.util.Scanner;
 
import java.util.ArrayList;
 
import java.util.Arrays;
import java.util.HashMap;
 
public class App {
    public static void main(String[] args) throws Exception {
        //Declaring City count
        Scanner scanner = new Scanner(System.in);
        int NodeCount = Integer.parseInt(scanner.nextLine());
        
        //Declaring city states
        int[] NodeStates;
        NodeStates = Arrays.stream(scanner.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
        HashMap<Integer, int[][]> RoadDict = new HashMap<Integer, int[][]>();
        int[] Ports = new int[0];
        //Iterate and build road index:
        for (int i = 0; i < NodeCount-1; i++) {
            int[] tempArray = Arrays.stream(scanner.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
            //case 1:
            int[][] tempone;
            int[][] finalone = {{0, 0}};
            if(RoadDict.containsKey(tempArray[0]-1)){
                tempone = RoadDict.get(tempArray[0]-1);
                finalone = addArrayMember(tempone, new int[]{0,0});
                //finalone = Arrays.copyOf(tempone, tempone.length+1);
                finalone[tempone.length][0] = tempArray[1]-1;
                finalone[tempone.length][1] = tempArray[2];
            }
            else{
                finalone[0][0] = tempArray[1]-1;
                finalone[0][1] = tempArray[2];
            }
            RoadDict.put(tempArray[0]-1,finalone);
            //case 2:
            int[][] temptwo;
            int[][] finaltwo = {{0, 0}};
            if(RoadDict.containsKey(tempArray[1]-1)){
                temptwo = RoadDict.get(tempArray[1]-1);
                finaltwo = addArrayMember(temptwo, new int[]{0,0});
                //finaltwo = Arrays.copyOf(temptwo, temptwo.length+1);
                finaltwo[temptwo.length][0] = tempArray[0]-1;
                finaltwo[temptwo.length][1] = tempArray[2];
            }
            else{
                finaltwo[0][0] = tempArray[0]-1;
                finaltwo[0][1] = tempArray[2];
            }
            RoadDict.put(tempArray[1]-1,finaltwo);
            if(NodeStates[tempArray[0]] == 0){
                Ports = addMember(Ports, tempArray[0]);
            }
        }
        
        scanner.close();
        Node[] NodeList = new Node[NodeCount];
        for (int i = 0; i < NodeCount; i++) {
            NodeList[i] = new Node();
            NodeList[i].value = i;
            if(NodeStates[i]==0){
                NodeList[i].addDistance(0);
            }
        }
 
        Node[] PortNodes = new Node[Ports.length];
        int counter = 0;
        for (int i : Ports) {
            PortNodes[counter] = NodeList[i];
            counter ++;
        }
        
 
        for(Node startingNode : PortNodes){
            Node node = startingNode;
            int startingNodeValue = startingNode.value;
            boolean[] travelledNodes = new boolean[NodeCount];
            for(boolean state : travelledNodes){
                state = false;
            }
            ArrayList<Node> Queue = new ArrayList<Node>();
            Queue.add(startingNode);
            travelledNodes[startingNodeValue] = true;
            while(Queue.size()>0){
                node = Queue.get(0);
                Queue.remove(0);
                int nodeValue = node.value;
                for(int[] neighbor : RoadDict.get(nodeValue)){
                    int neighborValue = neighbor[0];
                    Node neighborNode = NodeList[neighborValue];
                    if(NodeStates[neighborValue]==0){
                        travelledNodes[neighborValue] = true;
                    }
                    else if(!travelledNodes[neighborValue]){
                        travelledNodes[neighborValue] = true;
                        Queue.add(neighborNode);
                        neighborNode.addDistance(connection(nodeValue, neighborValue, RoadDict)+node.distance);
                    }
                }
            }
        }
 
        int sum = 0;
        for(Node node : NodeList){
            sum += node.distance;
        }
        System.out.println(sum);
    }
 
    public static int[][] addArrayMember(int[][] arr, int[] x){
        int size = arr.length;
        int[][] newArr = new int[size+1][1];
        for (int i = 0; i < size; i++) {
            newArr[i] = arr[i];
        }
        newArr[size] = x;
        return newArr;
    }
 
    public static int[] addMember( int[] arr, int x)
    {
        int size = arr.length;
        int[] newArr = new int[size+1];
        for (int i = 0; i < size; i++) {
            newArr[i] = arr[i];
        }
        newArr[size] = x;
        return newArr;
    }
 
    public static int connection(int node, int target, HashMap<Integer, int[][]> RoadDict){
        for (int[] con : RoadDict.get(node)) {
            if(con[0] == target){
                return con[1];
            }
        }
        return 0;
    }
}
 
class Node{
    int value;
    int distance = Integer.MAX_VALUE;
    void addDistance(int testDistance){
        if(testDistance < Node.this.distance){
        Node.this.distance = testDistance;
        }
    }
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: WRONG ANSWER

Test 5

Group: 1, 2

Verdict: WRONG ANSWER

Test 6

Group: 1, 2

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: Index 1000 out of bou...

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1, 2

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: Index 1000 out of bou...

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 1, 2

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: Index 1000 out of bou...

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 1, 2

Verdict: ACCEPTED

Test 16

Group: 1, 2

Verdict: ACCEPTED

Test 17

Group: 1, 2

Verdict: ACCEPTED

Test 18

Group: 1, 2

Verdict: WRONG ANSWER

Test 19

Group: 1, 2

Verdict: WRONG ANSWER

Test 20

Group: 1, 2

Verdict: WRONG ANSWER

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 1, 2

Verdict: WRONG ANSWER

Test 25

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 26

Group: 1, 2

Verdict: WRONG ANSWER

Test 27

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 28

Group: 1, 2

Verdict: WRONG ANSWER

Test 29

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 30

Group: 1, 2

Verdict: WRONG ANSWER

Test 31

Group: 2

Verdict: TIME LIMIT EXCEEDED