CSES - Datatähti 2023 alku

CSES - Datatähti 2023 alku - Results

Submission details
Task:	Sadonkorjuu
Sender:	DualRed
Submission time:	2022-11-01 22:47:41 +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.07 s	1, 2	details
#2	ACCEPTED	0.07 s	1, 2	details
#3	ACCEPTED	0.07 s	1, 2	details
#4	ACCEPTED	0.07 s	1, 2	details
#5	ACCEPTED	0.07 s	1, 2	details
#6	ACCEPTED	0.11 s	1, 2	details
#7	TIME LIMIT EXCEEDED	--	2	details
#8	ACCEPTED	0.11 s	1, 2	details
#9	TIME LIMIT EXCEEDED	--	2	details
#10	ACCEPTED	0.11 s	1, 2	details
#11	TIME LIMIT EXCEEDED	--	2	details
#12	TIME LIMIT EXCEEDED	--	2	details
#13	ACCEPTED	0.99 s	2	details
#14	ACCEPTED	0.99 s	2	details
#15	ACCEPTED	0.13 s	1, 2	details
#16	ACCEPTED	0.12 s	1, 2	details
#17	ACCEPTED	0.11 s	1, 2	details
#18	ACCEPTED	0.12 s	1, 2	details
#19	ACCEPTED	0.11 s	1, 2	details
#20	ACCEPTED	0.12 s	1, 2	details
#21	TIME LIMIT EXCEEDED	--	2	details
#22	ACCEPTED	1.00 s	2	details
#23	TIME LIMIT EXCEEDED	--	2	details
#24	ACCEPTED	0.12 s	1, 2	details
#25	TIME LIMIT EXCEEDED	--	2	details
#26	ACCEPTED	0.11 s	1, 2	details
#27	TIME LIMIT EXCEEDED	--	2	details
#28	ACCEPTED	0.11 s	1, 2	details
#29	TIME LIMIT EXCEEDED	--	2	details
#30	ACCEPTED	0.11 s	1, 2	details
#31	TIME LIMIT EXCEEDED	--	2	details

Code

import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        Solver solver = new Solver();
        System.out.println(solver.Solve());
    }
}


class Solver{

    public long Solve() throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

        // INPUT
        int cityCount = Integer.parseInt(bufferedReader.readLine());
        String[] cityTypes = bufferedReader.readLine().split(" ");
        City[] cities = new City[cityCount];
        for(int i = 0; i < cityCount; i++){
            cities[i] = new City(i, Integer.parseInt(cityTypes[i]) == 1);
        }
        for(int i = 0; i < cityCount - 1; i++){
            String[] inp = bufferedReader.readLine().split(" ");
            cities[Integer.parseInt(inp[0]) - 1].AddConnection(cities[Integer.parseInt(inp[1]) - 1], Integer.parseInt(inp[2]));
            cities[Integer.parseInt(inp[1]) - 1].AddConnection(cities[Integer.parseInt(inp[0]) - 1], Integer.parseInt(inp[2]));
        }

        // test generator
        /*int cityCount = 200000;
        City[] cities = new City[cityCount];
        for(int i = 0; i < cityCount; i++){
            cities[i] = new City(i, i < cityCount / 2); // amount of fields
        }
        Random random = new Random();
        for(int i = 0; i < cityCount - 1; i++){
            int randomIndex;
            do {
                randomIndex = random.nextInt(cityCount);
            }
            while (randomIndex == i);

            String[] inp = {String.valueOf(i), String.valueOf(randomIndex), "1"};
            cities[Integer.parseInt(inp[0])].AddConnection(cities[Integer.parseInt(inp[1])], Integer.parseInt(inp[2]));
            cities[Integer.parseInt(inp[1])].AddConnection(cities[Integer.parseInt(inp[0])], Integer.parseInt(inp[2]));
        }*/
        

        //long start = System.currentTimeMillis();

        // ALG
        Queue<SearchState> q = new LinkedList<>();
        long fieldCount = 0;
        for(int i = 0; i < cityCount; i++){
            if(!cities[i].isField){
                List<Integer> visited = new ArrayList<>(1);
                visited.add(i);
                q.add(new SearchState(cities[i], 0, visited));
            }
            else{
                fieldCount += 1;
            }
        }

        long totalLength = fieldCount * 999999999;
        while (q.size() > 0) {
            SearchState state = q.poll();
            for (Connection connection : state.city.connections) {
                if (!connection.destination.isField) { continue; }
                if (state.visited.contains(connection.destination.cityID)) { continue; } 

                int newCost = state.totalCost + connection.cost;
                if (newCost < connection.destination.shortestPath){
                    totalLength -= connection.destination.shortestPath - newCost;
                    connection.destination.shortestPath = newCost;
                } else { continue; }

                state.visited.add(connection.destination.cityID);
                q.add(new SearchState(connection.destination, newCost, new ArrayList<Integer>(state.visited)));
            }
        }

        //System.out.println((System.currentTimeMillis() - start) / 1000.0);
        return totalLength;
    }


    class SearchState {
        public City city;
        public int totalCost;
        public List<Integer> visited = new ArrayList<>();

        public SearchState(City city, int totalCost, List<Integer> visited){
            this.city = city;
            this.visited = visited;
            this.totalCost = totalCost;
        }
    }



    public int Solve2() throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

        // INPUT
        /*int cityCount = Integer.parseInt(bufferedReader.readLine());
        String[] cityTypes = bufferedReader.readLine().split(" ");
        City[] cities = new City[cityCount];
        for(int i = 0; i < cityCount; i++){
            cities[i] = new City(i, Integer.parseInt(cityTypes[i]) == 1);
        }
        for(int i = 0; i < cityCount - 1; i++){
            String[] inp = bufferedReader.readLine().split(" ");
            cities[Integer.parseInt(inp[0]) - 1].AddConnection(cities[Integer.parseInt(inp[1]) - 1], Integer.parseInt(inp[2]));
            cities[Integer.parseInt(inp[1]) - 1].AddConnection(cities[Integer.parseInt(inp[0]) - 1], Integer.parseInt(inp[2]));
        }*/

        // test generator
        int cityCount = 200000;
        City[] cities = new City[cityCount];
        for(int i = 0; i < cityCount; i++){
            cities[i] = new City(i, i < 200000 / 2.5); // amount of fields
        }
        for(int i = 0; i < cityCount - 1; i++){
            Random random = new Random();
            int randomIndex;
            do {
                randomIndex = random.nextInt(cityCount);
            }
            while (randomIndex == i);

            String[] inp = {String.valueOf(i), String.valueOf(randomIndex), "1"};
            cities[Integer.parseInt(inp[0])].AddConnection(cities[Integer.parseInt(inp[1])], Integer.parseInt(inp[2]));
            cities[Integer.parseInt(inp[1])].AddConnection(cities[Integer.parseInt(inp[0])], Integer.parseInt(inp[2]));
        }
        

        long start = System.currentTimeMillis();

        // ALG
        for(int i = 0; i < cityCount; i++){
            if (!cities[i].isField){
                if(!cities[i].HasFieldConnection()){
                    continue;
                }
                boolean[] usedFlags = new boolean[cityCount];
                CalculateShortestPaths(cities[i], 0, usedFlags);
            }
        }
        

        // Count
        int totalLength = 0;
        for(int i = 0; i < cityCount; i++){
            if (cities[i].isField){
                //System.out.println(String.valueOf(i) + " -> " + String.valueOf(cities[i].shortestPath));
                totalLength += cities[i].shortestPath;
            }
        }

        System.out.println((System.currentTimeMillis() - start) / 1000.0);
        return totalLength;
    }
    

    void CalculateShortestPaths(City city, int totalCost, boolean[] usedFlags){
        for (Connection connection : city.connections) {
            int thisID = connection.destination.cityID;
            if (usedFlags[thisID]) { continue; } 

            int newCost = totalCost + connection.cost;
            if (!connection.destination.isField) { continue; }
            else {
                if (newCost < connection.destination.shortestPath){
                    connection.destination.shortestPath = newCost;
                } else { continue; }
            }

            usedFlags[thisID] = true;
            CalculateShortestPaths(connection.destination, newCost, usedFlags);
            usedFlags[thisID] = false;
        }
    }



    class City {
        public int cityID;
        public boolean isField;
        public List<Connection> connections;
        public int shortestPath = 999999999;
    
        public City(int cityID, boolean isField){
            this.cityID = cityID;
            this.isField = isField;
            connections = new ArrayList<Connection>();  
        }
    
        public void AddConnection(City destination, int cost) {
            connections.add(new Connection(destination, cost));
        }

        public boolean HasFieldConnection() {
            boolean flag = false;
            for(int i = 0; i < connections.size(); i++){
                if (connections.get(i).destination.isField){
                    flag = true;
                    break;
                }
            }
            return flag;
        }
    }
    
    class Connection {
        public City destination;
        public int cost;
    
        public Connection(City destination, int cost){
            this.destination = destination;
            this.cost = cost;
        }
    }
}

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: ACCEPTED

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

Test 14

Group: 2

Verdict: ACCEPTED

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

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: ACCEPTED

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

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