CSES - Datatähti 2023 alku

Submission details
Task:	Sadonkorjuu
Sender:	adex720
Submission time:	2022-11-12 21:09:07 +0200
Language:	Java
Status:	READY
Result:	0

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

Test results
test	verdict	time	group
#1	TIME LIMIT EXCEEDED	--	1, 2	details
#2	TIME LIMIT EXCEEDED	--	1, 2	details
#3	TIME LIMIT EXCEEDED	--	1, 2	details
#4	TIME LIMIT EXCEEDED	--	1, 2	details
#5	TIME LIMIT EXCEEDED	--	1, 2	details
#6	TIME LIMIT EXCEEDED	--	1, 2	details
#7	TIME LIMIT EXCEEDED	--	2	details
#8	TIME LIMIT EXCEEDED	--	1, 2	details
#9	TIME LIMIT EXCEEDED	--	2	details
#10	TIME LIMIT EXCEEDED	--	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	TIME LIMIT EXCEEDED	--	1, 2	details
#17	TIME LIMIT EXCEEDED	--	1, 2	details
#18	TIME LIMIT EXCEEDED	--	1, 2	details
#19	TIME LIMIT EXCEEDED	--	1, 2	details
#20	TIME LIMIT EXCEEDED	--	1, 2	details
#21	TIME LIMIT EXCEEDED	--	2	details
#22	TIME LIMIT EXCEEDED	--	2	details
#23	TIME LIMIT EXCEEDED	--	2	details
#24	TIME LIMIT EXCEEDED	--	1, 2	details
#25	TIME LIMIT EXCEEDED	--	2	details
#26	TIME LIMIT EXCEEDED	--	1, 2	details
#27	TIME LIMIT EXCEEDED	--	2	details
#28	TIME LIMIT EXCEEDED	--	1, 2	details
#29	TIME LIMIT EXCEEDED	--	2	details
#30	TIME LIMIT EXCEEDED	--	1, 2	details
#31	TIME LIMIT EXCEEDED	--	2	details

Code

import java.util.HashSet;
import java.util.Scanner;

public class F {

    public static void main(String[] args) throws InterruptedException {
        Scanner scanner = new Scanner(System.in);
        int n = Integer.parseInt(scanner.nextLine());

        String[] satamat = scanner.nextLine().split(" ");
        Kaupunki[] kaupungit = new Kaupunki[n];
        for (int i = 0; i < n; i++) {
            kaupungit[i] = new Kaupunki(i, satamat[i].charAt(0) == '1');
        }

        for (int i = 0; i < n - 1; i++) {
            String[] syote = scanner.nextLine().split(" ");
            int kaupunki1Id = Integer.parseInt(syote[0]) - 1;
            int kaupunki2Id = Integer.parseInt(syote[1]) - 1;
            kaupungit[kaupunki1Id].lisaaNaapuri(kaupungit[kaupunki2Id], Integer.parseInt(syote[2]), true);
        }

        Thread.sleep(2000);

        int yhteensa = 0;
        for (int i = 0; i < n; i++) {
            Kaupunki kaupunki = kaupungit[i];
            yhteensa += kaupunki.satamaan;
        }

        System.out.println(yhteensa + 1);
    }

    public static class Kaupunki {
        public final int id;
        public final boolean pelto;

        public int satamaan;

        public HashSet<Yhteys> naapurit;

        public Kaupunki(int id, boolean pelto) {
            this.id = id;
            this.pelto = pelto;

            satamaan = pelto ? Integer.MAX_VALUE : 0;

            naapurit = new HashSet<>();
        }

        public void lisaaNaapuri(Kaupunki kaupunki, int etaisyys, boolean takaisin) {
            if (pelto) {
                int matkaSatamaan = kaupunki.satamaan != Integer.MAX_VALUE ? kaupunki.satamaan + etaisyys : Integer.MAX_VALUE;
                if (matkaSatamaan < this.satamaan) {
                    this.satamaan = matkaSatamaan;
                    for (Yhteys yhteys : naapurit) {
                        if (yhteys.kaupunki.id != kaupunki.id)
                            yhteys.kaupunki.paivitaEtaisyysSatamaan(id, matkaSatamaan + yhteys.etaisyys);
                    }
                }
            }

            naapurit.add(new Yhteys(kaupunki, etaisyys));
            if (takaisin) kaupunki.lisaaNaapuri(this, etaisyys, false);
        }

        public void paivitaEtaisyysSatamaan(int kaupungistaId, int etaisyys) {
            if (this.satamaan <= etaisyys) return;

            this.satamaan = etaisyys;
            for (Yhteys yhteys : naapurit) {
                if (yhteys.kaupunki.id != kaupungistaId)
                    yhteys.kaupunki.paivitaEtaisyysSatamaan(this.id, etaisyys + yhteys.etaisyys);
            }
        }
    }

    public static class Yhteys {

        public final Kaupunki kaupunki;
        public final int etaisyys;

        public Yhteys(Kaupunki kaupunki, int etaisyys) {
            this.kaupunki = kaupunki;
            this.etaisyys = etaisyys;
        }
    }

}

Test details

Test 1

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

input
`1 0` view save

correct output
`0` view save

user output
(empty)

Test 2

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

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

Test 3

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

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

correct output
`60` view save

user output
(empty)

Test 4

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

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

Test 5

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

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

Test 6

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
`5506363` view save

user output
(empty)

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

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

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

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

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

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)

Test 17

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

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

Test 18

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
`1543963` view save

user output
(empty)

Test 19

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

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)

Test 20

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

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)

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

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)

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

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)

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

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)

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

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)

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