CSES - Datatähti 2023 alku

Submission details
Task:	Sadonkorjuu
Sender:	Finnduino
Submission time:	2022-11-07 22:56:19 +0200
Language:	Java
Status:	READY
Result:	33

Feedback
group	verdict	score
#1	ACCEPTED	33
#2	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.10 s	1, 2	details
#2	ACCEPTED	0.11 s	1, 2	details
#3	ACCEPTED	0.11 s	1, 2	details
#4	ACCEPTED	0.10 s	1, 2	details
#5	ACCEPTED	0.10 s	1, 2	details
#6	ACCEPTED	0.15 s	1, 2	details
#7	TIME LIMIT EXCEEDED	--	2	details
#8	ACCEPTED	0.21 s	1, 2	details
#9	TIME LIMIT EXCEEDED	--	2	details
#10	ACCEPTED	0.21 s	1, 2	details
#11	TIME LIMIT EXCEEDED	--	2	details
#12	TIME LIMIT EXCEEDED	--	2	details
#13	TIME LIMIT EXCEEDED	--	2	details
#14	TIME LIMIT EXCEEDED	--	2	details
#15	ACCEPTED	0.15 s	1, 2	details
#16	ACCEPTED	0.20 s	1, 2	details
#17	ACCEPTED	0.20 s	1, 2	details
#18	ACCEPTED	0.20 s	1, 2	details
#19	ACCEPTED	0.20 s	1, 2	details
#20	ACCEPTED	0.19 s	1, 2	details
#21	TIME LIMIT EXCEEDED	--	2	details
#22	TIME LIMIT EXCEEDED	--	2	details
#23	TIME LIMIT EXCEEDED	--	2	details
#24	ACCEPTED	0.26 s	1, 2	details
#25	TIME LIMIT EXCEEDED	--	2	details
#26	ACCEPTED	0.26 s	1, 2	details
#27	TIME LIMIT EXCEEDED	--	2	details
#28	ACCEPTED	0.15 s	1, 2	details
#29	TIME LIMIT EXCEEDED	--	2	details
#30	ACCEPTED	0.15 s	1, 2	details
#31	TIME LIMIT EXCEEDED	--	2	details

Code

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
//import java.lang.System;
public class ParrallelApp {
    public static void main(String[] args) throws Exception {
        //Declaring City count
        //Scanner scanner = new Scanner(System.in);
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        //long startTime = System.currentTimeMillis();
        int NodeCount = Integer.parseInt(br.readLine());
        
        //Declaring city states
        int[] NodeStates;
        NodeStates = Arrays.stream(br.readLine().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(br.readLine().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]-1] == 0){
                Ports = addMember(Ports, tempArray[0]-1);
            }
            if(NodeStates[tempArray[1]-1]==0){
                Ports = addMember(Ports, tempArray[1]-1);
            }
        }
        
        //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 +=1;
        }
        
        Arrays.stream(PortNodes).parallel().forEach((startingNode)->{
            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);
        //long finish = System.currentTimeMillis();
        //System.out.println((finish-startTime));
    }

    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 details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
`1 0` view save

correct output
`0` view save

user output
`0` view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 0 0 0 0 1 2 1 2 3 2 3 4 3 ...` view save

correct output
`0` view save

user output
`0` view save

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
`4 1 0 1 1 1 2 10 2 3 20 2 4 30` view save

correct output
`60` view save

user output
`60` view save

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 1 1 1 0 1 2 10 2 3 20 3 4 30 ...` view save

correct output
`80` view save

user output
`80` view save

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 1 0 1 1 1 2 1 2 3 5 3 4 3 ...` view save

correct output
`6` view save

user output
`6` view save

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5506363` view save

user output
`5506363` view save

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1795118520` view save

user output
(empty)

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 1 0 1 1 0 1 0 1 1 0 0 0 1 ...` view save

correct output
`293576` view save

user output
`293576` view save

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`816932444` view save

user output
(empty)

Test 10

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`3089` view save

user output
`3089` view save

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`40839` view save

user output
(empty)

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5683983203973` view save

user output
(empty)

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 1 1 1 1 1 1 0 0 0 1 1 0 1 0 ...` view save

correct output
`58572993` view save

user output
(empty)

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`32755` view save

user output
(empty)

Test 15

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`126238345` view save

user output
`126238345` view save

Test 16

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 0 1 0 1 1 1 0 0 1 0 1 1 0 ...` view save

correct output
`278678` view save

user output
`278678` view save

Test 17

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 ...` view save

correct output
`34929` view save

user output
`34929` view save

Test 18

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1543963` view save

user output
`1543963` view save

Test 19

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`39606` view save

user output
`39606` view save

Test 20

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 0 1 0 1 0 0 0 0 1 1 0 0 0 1 ...` view save

correct output
`321598` view save

user output
`321598` view save

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`978670626` view save

user output
(empty)

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`375218` view save

user output
(empty)

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 0 0 0 0 0 1 0 1 0 1 1 ...` view save

correct output
`60422556` view save

user output
(empty)

Test 24

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`291990` view save

user output
`291990` view save

Test 25

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`59607954` view save

user output
(empty)

Test 26

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`990` view save

user output
`990` view save

Test 27

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`199982` view save

user output
(empty)

Test 28

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`7987` view save

user output
`7987` view save

Test 29

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`3137875` view save

user output
(empty)

Test 30

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`4657693` view save

user output
`4657693` view save

Test 31

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1652889357` view save

user output
(empty)

Datatähti 2023 alku

Sadonkorjuu

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Tasks

Submissions (Finnduino)