Task: | Sadonkorjuu |
Sender: | Finnduino |
Submission time: | 2022-11-11 00:43:38 +0200 |
Language: | Java |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | RUNTIME ERROR | 0 |
#2 | RUNTIME ERROR | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | RUNTIME ERROR | 0.11 s | 1, 2 | details |
#2 | WRONG ANSWER | 0.11 s | 1, 2 | details |
#3 | WRONG ANSWER | 0.11 s | 1, 2 | details |
#4 | WRONG ANSWER | 0.12 s | 1, 2 | details |
#5 | WRONG ANSWER | 0.12 s | 1, 2 | details |
#6 | WRONG ANSWER | 0.22 s | 1, 2 | details |
#7 | TIME LIMIT EXCEEDED | -- | 2 | details |
#8 | WRONG ANSWER | 0.24 s | 1, 2 | details |
#9 | TIME LIMIT EXCEEDED | -- | 2 | details |
#10 | WRONG ANSWER | 0.22 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 | WRONG ANSWER | 0.22 s | 1, 2 | details |
#16 | WRONG ANSWER | 0.23 s | 1, 2 | details |
#17 | WRONG ANSWER | 0.23 s | 1, 2 | details |
#18 | WRONG ANSWER | 0.27 s | 1, 2 | details |
#19 | WRONG ANSWER | 0.22 s | 1, 2 | details |
#20 | WRONG ANSWER | 0.23 s | 1, 2 | details |
#21 | TIME LIMIT EXCEEDED | -- | 2 | details |
#22 | TIME LIMIT EXCEEDED | -- | 2 | details |
#23 | TIME LIMIT EXCEEDED | -- | 2 | details |
#24 | WRONG ANSWER | 0.32 s | 1, 2 | details |
#25 | TIME LIMIT EXCEEDED | -- | 2 | details |
#26 | WRONG ANSWER | 0.33 s | 1, 2 | details |
#27 | TIME LIMIT EXCEEDED | -- | 2 | details |
#28 | WRONG ANSWER | 0.23 s | 1, 2 | details |
#29 | TIME LIMIT EXCEEDED | -- | 2 | details |
#30 | WRONG ANSWER | 0.22 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 ParallelApp {//private static int[] Ports = new int[0];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));int NodeCount = Integer.parseInt(br.readLine());long startTime = System.currentTimeMillis();// Declaring city statesint[] NodeStates;String bruh;//bruh = br.readLine().split("[^0-9]");NodeStates = Arrays.stream(br.readLine().split("[^0-9]")).mapToInt(Integer::parseInt).toArray();HashMap<Integer, int[][]> RoadDict = new HashMap<Integer, int[][]>();int[][] array = new int[NodeCount - 1][3];// Iterate and build road index:for (int i = 0; i < NodeCount - 1; i++) {bruh = br.readLine();if(bruh.length() >0){// array[i] = Arrays.stream(br.readLine().split("")).mapToInt(Integer::parseInt).toArray();System.arraycopy(Arrays.stream(bruh.split("[^0-9]")).mapToInt(Integer::parseInt).toArray(), 0, array[i],0, 3);}}Arrays.stream(array).parallel().forEach((tempArray) -> {// case 1:int[][] tempone;int[][] finalone;if (RoadDict.containsKey(tempArray[0] - 1)) {tempone = RoadDict.get(tempArray[0] - 1);// finalone = addArrayMember(tempone, new int[]{0,0});finalone = new int[tempone.length+1][2];System.arraycopy(tempone, 0, finalone, 0, tempone.length);// finalone = Arrays.copyOf(tempone, tempone.length+1);finalone[tempone.length][0] = tempArray[1] - 1;finalone[tempone.length][1] = tempArray[2];} else {finalone = new int[][] { { 0, 0 } };finalone[0][0] = tempArray[1] - 1;finalone[0][1] = tempArray[2];}RoadDict.put(tempArray[0] - 1, finalone);// case 2:int[][] temptwo;int[][] finaltwo;if (RoadDict.containsKey(tempArray[1] - 1)) {temptwo = RoadDict.get(tempArray[1] - 1);// finaltwo = addArrayMember(temptwo, new int[]{0,0});finaltwo = new int[temptwo.length+1][2];System.arraycopy(temptwo, 0, finaltwo, 0, temptwo.length);// finaltwo = Arrays.copyOf(temptwo, temptwo.length+1);finaltwo[temptwo.length][0] = tempArray[0] - 1;finaltwo[temptwo.length][1] = tempArray[2];} else {finaltwo = new int[][] { { 0, 0 } };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();ArrayList<Node> PortNodesList = new ArrayList<Node>();Node[] NodeList = new Node[NodeCount];int counter = 0;for (int i = 0; i < NodeCount; i++) {NodeList[i] = new Node();NodeList[i].value = i;if (NodeStates[i] == 0) {NodeList[i].addDistance(0);PortNodesList.add(NodeList[i]);counter +=1;}}Node[] PortNodes = new Node[PortNodesList.size()];PortNodes = PortNodesList.toArray(PortNodes);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 NodeThread extends Thread {@Overridepublic void run() {}}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: RUNTIME ERROR
input |
---|
1 0 |
correct output |
---|
0 |
user output |
---|
(empty) |
Error:
Exception in thread "main" java.lang.NullPointerException at ParallelApp.lambda$main$1(Pa...
Test 2
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
5 0 0 0 0 0 1 2 1 2 3 2 3 4 3 ... |
correct output |
---|
0 |
user output |
---|
0 39 |
Test 3
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
4 1 0 1 1 1 2 10 2 3 20 2 4 30 |
correct output |
---|
60 |
user output |
---|
60 39 |
Test 4
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
5 0 1 1 1 0 1 2 10 2 3 20 3 4 30 ... |
correct output |
---|
80 |
user output |
---|
80 38 |
Test 5
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
5 0 1 0 1 1 1 2 1 2 3 5 3 4 3 ... |
correct output |
---|
6 |
user output |
---|
6 39 |
Test 6
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
5506363 |
user output |
---|
5506363 146 |
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 ... |
correct output |
---|
1795118520 |
user output |
---|
(empty) |
Test 8
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 0 0 1 0 1 1 0 1 0 1 1 0 0 0 1 ... |
correct output |
---|
293576 |
user output |
---|
293576 166 |
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 ... |
correct output |
---|
816932444 |
user output |
---|
(empty) |
Test 10
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
3089 |
user output |
---|
3089 146 |
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 ... |
correct output |
---|
40839 |
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 ... |
correct output |
---|
5683983203973 |
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 ... |
correct output |
---|
58572993 |
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 ... |
correct output |
---|
32755 |
user output |
---|
(empty) |
Test 15
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
126238345 |
user output |
---|
126238345 150 |
Test 16
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 0 0 0 1 0 1 1 1 0 0 1 0 1 1 0 ... |
correct output |
---|
278678 |
user output |
---|
278678 162 |
Test 17
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 ... |
correct output |
---|
34929 |
user output |
---|
34929 160 |
Test 18
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1543963 |
user output |
---|
1543963 189 |
Test 19
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
39606 |
user output |
---|
39606 152 |
Test 20
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 1 0 1 0 1 0 0 0 0 1 1 0 0 0 1 ... |
correct output |
---|
321598 |
user output |
---|
321598 160 |
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 ... |
correct output |
---|
978670626 |
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 ... |
correct output |
---|
375218 |
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 ... |
correct output |
---|
60422556 |
user output |
---|
(empty) |
Test 24
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
291990 |
user output |
---|
291990 248 |
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 ... |
correct output |
---|
59607954 |
user output |
---|
(empty) |
Test 26
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
990 |
user output |
---|
990 249 |
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 ... |
correct output |
---|
199982 |
user output |
---|
(empty) |
Test 28
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
7987 |
user output |
---|
7987 159 |
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 ... |
correct output |
---|
3137875 |
user output |
---|
(empty) |
Test 30
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
4657693 |
user output |
---|
4657693 145 |
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 ... |
correct output |
---|
1652889357 |
user output |
---|
(empty) |