CSES - Datatähti 2023 alku

Submission details
Task:	Sadonkorjuu
Sender:	Septicuss
Submission time:	2022-11-02 10:58:30 +0200
Language:	Java
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	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	WRONG ANSWER	0.12 s	1, 2	details
#7	WRONG ANSWER	0.90 s	2	details
#8	WRONG ANSWER	0.38 s	1, 2	details
#9	TIME LIMIT EXCEEDED	--	2	details
#10	ACCEPTED	0.55 s	1, 2	details
#11	TIME LIMIT EXCEEDED	--	2	details
#12	WRONG ANSWER	0.80 s	2	details
#13	TIME LIMIT EXCEEDED	--	2	details
#14	TIME LIMIT EXCEEDED	--	2	details
#15	WRONG ANSWER	0.11 s	1, 2	details
#16	WRONG ANSWER	0.33 s	1, 2	details
#17	ACCEPTED	0.52 s	1, 2	details
#18	WRONG ANSWER	0.18 s	1, 2	details
#19	WRONG ANSWER	0.51 s	1, 2	details
#20	WRONG ANSWER	0.36 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.31 s	1, 2	details
#25	TIME LIMIT EXCEEDED	--	2	details
#26	WRONG ANSWER	0.41 s	1, 2	details
#27	TIME LIMIT EXCEEDED	--	2	details
#28	WRONG ANSWER	0.11 s	1, 2	details
#29	WRONG ANSWER	0.80 s	2	details
#30	WRONG ANSWER	0.11 s	1, 2	details
#31	WRONG ANSWER	0.79 s	2	details

Code

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

public class E430 {

	static int n;
	static ArrayList<WeightedNode> ports = new ArrayList<>();

	static long[] mins;

	public static void main(String[] args) throws FileNotFoundException {

		FastReader reader = new FastReader();
		PrintWriter writer = new PrintWriter(new OutputStreamWriter(System.out));

		n = reader.nextInt();
		mins = new long[n + 1];
		ArrayList<WeightedNode> nodes = new ArrayList<>();

		int a, b, c, t;
		// City types
		for (int id = 1; id < (n + 1); id++) {
			t = reader.nextInt();
			WeightedNode node = new WeightedNode(id, t, id - 1);
			if (t == 0) {
				ports.add(node);
			}
			nodes.add(node);
		}

		WeightedGraph graph = new WeightedGraph(nodes);

		// Connections
		for (int i = 0; i < (n - 1); i++) {
			a = reader.nextInt() - 1;
			b = reader.nextInt() - 1;
			c = reader.nextInt();
			graph.addWeightedEdge(a, b, c);
		}

		reader.close();

		for (WeightedNode port : ports)
			graph.dijkstra(port);

		long sum = 0;

		for (long value : mins) {
			sum += value;
		}
		writer.println(sum);
		writer.flush();
		writer.close();
	}

	// ------------------------------------------------------

	static long lowestExpense = Long.MAX_VALUE;
	
	static class WeightedGraph {
		ArrayList<WeightedNode> nodes = new ArrayList<WeightedNode>();
		static PriorityQueue<WeightedNode> queue;

		public WeightedGraph(ArrayList<WeightedNode> nodes) {
			this.nodes = nodes;
		}

		void dijkstra(WeightedNode node) {
			if (queue == null)
				queue = new PriorityQueue<>();
			else
				queue.clear();
			node.distance = 0;

			queue.addAll(nodes);

			long expense = 0;
			
			while (!queue.isEmpty()) {
				
				if (expense > lowestExpense) {
					break;
				}
				WeightedNode current = queue.remove();
				
				for (WeightedNode neighbor : current.neighbors) {
					if (neighbor.type == 0) continue;
					
					if (queue.contains(neighbor)) {
						if (neighbor.distance > current.distance + current.weightMap.get(neighbor.id)) {
							neighbor.distance = (current.distance + current.weightMap.get(neighbor.id));

							if (mins[neighbor.id] != 0) {
								mins[neighbor.id] = Math.min(mins[neighbor.id], (long) neighbor.distance);
							} else {
								mins[neighbor.id] = (long) neighbor.distance;
							}

							neighbor.parent = current;
							expense += neighbor.distance;
							lowestExpense = Math.min(lowestExpense, expense);
							queue.remove(neighbor);
							queue.add(neighbor);
						}
					}
					
				}

			}

		}

		void addWeightedEdge(int a, int b, int c) {
			WeightedNode first = nodes.get(a);
			WeightedNode second = nodes.get(b);
			first.neighbors.add(second);
			first.weightMap.put(second.id, c);
			second.neighbors.add(first);
			second.weightMap.put(first.id, c);
		}
	}

	static class WeightedNode implements Comparable<WeightedNode> {
		int id;
		int type;
		ArrayList<WeightedNode> neighbors = new ArrayList<>();
		HashMap<Integer, Integer> weightMap = new HashMap<>();
		boolean visited = false;
		WeightedNode parent;
		long distance;
		int index;

		public WeightedNode(int id, int type, int index) {
			this.id = id;
			this.type = type;
			distance = 1001;
			this.index = index;
		}

		@Override
		public int compareTo(WeightedNode o) {
			return (int) (this.distance - o.distance);
		}

	}

	static class FastReader {

		private BufferedReader br;
		private StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		public FastReader(InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
				e.printStackTrace();
			}
			st = null;
			br = null;
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		String nextLine() {
			String str = "";

			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}

			return str;
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		BigInteger nextBigInteger() {
			return new BigInteger(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

	}

}

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: WRONG ANSWER

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

Test 7

Group: 2

Verdict: WRONG ANSWER

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

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

correct output
`293576` view save

user output
`202562` 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: WRONG ANSWER

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

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: WRONG ANSWER

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

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

correct output
`278678` view save

user output
`197546` 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: WRONG ANSWER

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

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

correct output
`39606` view save

user output
`37429` view save

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

correct output
`321598` view save

user output
`191558` 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: WRONG ANSWER

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
`133843` 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: WRONG ANSWER

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
`991` 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: WRONG ANSWER

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

Test 29

Group: 2

Verdict: WRONG ANSWER

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

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

correct output
`4657693` view save

user output
`1533` view save

Test 31

Group: 2

Verdict: WRONG ANSWER

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

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