CSES - Datatähti 2023 alku

CSES - Datatähti 2023 alku - Results

Submission details
Task:	Sadonkorjuu
Sender:	lompakkomies
Submission time:	2022-11-04 09:06:37 +0200
Language:	Java
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	RUNTIME ERROR	0
#2	RUNTIME ERROR	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.12 s	1, 2	details
#2	ACCEPTED	0.13 s	1, 2	details
#3	ACCEPTED	0.13 s	1, 2	details
#4	ACCEPTED	0.14 s	1, 2	details
#5	ACCEPTED	0.13 s	1, 2	details
#6	RUNTIME ERROR	0.63 s	1, 2	details
#7	TIME LIMIT EXCEEDED	--	2	details
#8	ACCEPTED	0.29 s	1, 2	details
#9	TIME LIMIT EXCEEDED	--	2	details
#10	ACCEPTED	0.30 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	TIME LIMIT EXCEEDED	--	1, 2	details
#16	RUNTIME ERROR	0.56 s	1, 2	details
#17	ACCEPTED	0.28 s	1, 2	details
#18	RUNTIME ERROR	0.59 s	1, 2	details
#19	RUNTIME ERROR	0.57 s	1, 2	details
#20	RUNTIME ERROR	0.58 s	1, 2	details
#21	TIME LIMIT EXCEEDED	--	2	details
#22	TIME LIMIT EXCEEDED	--	2	details
#23	TIME LIMIT EXCEEDED	--	2	details
#24	RUNTIME ERROR	0.67 s	1, 2	details
#25	TIME LIMIT EXCEEDED	--	2	details
#26	RUNTIME ERROR	0.58 s	1, 2	details
#27	TIME LIMIT EXCEEDED	--	2	details
#28	RUNTIME ERROR	0.58 s	1, 2	details
#29	TIME LIMIT EXCEEDED	--	2	details
#30	RUNTIME ERROR	0.57 s	1, 2	details
#31	TIME LIMIT EXCEEDED	--	2	details

Code

import java.util.Scanner;

public class Sadonkorjuu {
    public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);

        int n = scan.nextInt();

        int[] cities = new int[n];

        for(int i = 0; i < n; i++) {
            cities[i] = scan.nextInt();
        }

        int[][] connections = new int[2*(n-1)][3];

        for(int i = 0; i < n-1; i++) {
            connections[i][0] = scan.nextInt();
            connections[i][1] = scan.nextInt();
            connections[i][2] = scan.nextInt();

            connections[i+n-1][1] = connections[i][0];
            connections[i+n-1][0] = connections[i][1];
            connections[i+n-1][2] = connections[i][2];
        }
        int temp1 = 0, temp2 = 0, temp3 = 0;

        for(int i = 0; i < connections.length; i++) {
            for(int j = 0; j < connections.length - 1; j++) {
                if(connections[j][0] > connections[j+1][0]) {
                    temp1 = connections[j][0];
                    temp2 = connections[j][1];
                    temp3 = connections[j][2];

                    connections[j][0] = connections[j+1][0];
                    connections[j][1] = connections[j+1][1];
                    connections[j][2] = connections[j+1][2];

                    connections[j+1][0] = temp1;
                    connections[j+1][1] = temp2;
                    connections[j+1][2] = temp3;
                }
            }
        }

        int[] cityLocations = new int[n+1];

        temp1 = 1;

        for(int i = 0; i < connections.length; i++) {
            if(temp1 == connections[i][0]) {
                cityLocations[temp1 - 1] = i;
                temp1++;
            }
        }
        cityLocations[n] = connections.length;

        /*for(int k = 0; k < n; k++) {
            System.out.println("city" + k + "connections:");
            for(int i = cityLocations[k]; i < cityLocations[k+1]; i++) {
                for(int j = 0; j < connections[0].length; j++) {
                    System.out.print(connections[i][j] + ", ");
                }
                System.out.print("\n");
            }
        }

        for(int i = 0; i < cityLocations.length; i++) {
            System.out.print(cityLocations[i]);
        }*/

        int[] distances = new int[n];

        for(int i = 0; i < n; i++) {
            distances[i] = -1;
        }

        int sum = 0;

        for(int i = 0; i < n; i++) {
            if(cities[i] == 1) {
                distance(connections, cityLocations, cities, distances, i, 0, 0, i);
                if(distances[i] != -1) {
                    sum += distances[i];
                }
            }
        }
        System.out.println(sum);

        /*for(int i = 0; i < n; i++) {
            System.out.print(", " + distances[i]);
        }*/
    }

    public static void distance(int[][] connections, int[] cityLocations, int[] cities, int[] distances, int cityNum, int distance, int prevCity, int startCity) {

        if(cities[cityNum] == 1) {
            for(int i = cityLocations[cityNum]; i < cityLocations[cityNum + 1]; i++) {
                if(connections[i][1] != prevCity) {
                    if((distance < distances[startCity] && distances[startCity] != -1) || distances[startCity] == -1) {
                        //System.out.println( connections[i][0] + ", " +  connections[i][1] + ", " + connections[i][2]);
                        distance(connections, cityLocations, cities, distances, connections[i][1]-1, distance + connections[i][2], cityNum, startCity);
                    }
                }
            }
        } else {
            if(distance < distances[startCity] || distances[startCity] == -1) {
                distances[startCity] = distance;
            }
        }
    }
}

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: RUNTIME ERROR

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
(empty)

Error:

Exception in thread "main" java.lang.StackOverflowError
	at Sadonkorjuu.distance(Sadonkorj...

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: TIME LIMIT EXCEEDED

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
(empty)

Test 16

Group: 1, 2

Verdict: RUNTIME ERROR

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
(empty)

Error:

Exception in thread "main" java.lang.StackOverflowError
	at Sadonkorjuu.distance(Sadonkorj...

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: RUNTIME ERROR

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
(empty)

Error:

Exception in thread "main" java.lang.StackOverflowError
	at Sadonkorjuu.distance(Sadonkorj...

Test 19

Group: 1, 2

Verdict: RUNTIME ERROR

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
(empty)

Error:

Exception in thread "main" java.lang.StackOverflowError
	at Sadonkorjuu.distance(Sadonkorj...

Test 20

Group: 1, 2

Verdict: RUNTIME ERROR

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
(empty)

Error:

Exception in thread "main" java.lang.StackOverflowError
	at Sadonkorjuu.distance(Sadonkorj...

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: RUNTIME ERROR

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
(empty)

Error:

Exception in thread "main" java.lang.StackOverflowError
	at Sadonkorjuu.distance(Sadonkorj...

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: RUNTIME ERROR

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
(empty)

Error:

Exception in thread "main" java.lang.StackOverflowError
	at Sadonkorjuu.distance(Sadonkorj...

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: RUNTIME ERROR

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
(empty)

Error:

Exception in thread "main" java.lang.StackOverflowError
	at Sadonkorjuu.distance(Sadonkorj...

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: RUNTIME ERROR

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
(empty)

Error:

Exception in thread "main" java.lang.StackOverflowError
	at Sadonkorjuu.distance(Sadonkorj...

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 (lompakkomies)