Shortest Routes I

import java.io.IOException;
import java.io.StreamTokenizer;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.PriorityQueue;
import java.io.BufferedReader;
import java.io.InputStreamReader;

class Node {
    public int id, price;

    public Node(int id, int price) {
        this.id = id;
        this.price = price;
    }

    @Override
    public String toString() {
        return String.format("Node(%d, %d)", id, price);
    }
}

class Edge {
    public int from, to, length;

    public Edge(int from, int to, int length) {
        this.from = from;
        this.to = to;
        this.length = length;
    }
}

public class ShortestRoutesI {

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

        StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
        in.nextToken();
        int n = (int) in.nval;
        in.nextToken();
        int m = (int) in.nval;

        ArrayList<ArrayList<Edge>> adj = new ArrayList<>(n);
        for (int i = 0; i < n; i++)
            adj.add(new ArrayList<>());

        for (int i = 0; i < m; i++) {
            in.nextToken();
            int a = (int) in.nval;
            in.nextToken();
            int b = (int) in.nval;
            in.nextToken();
            int c = (int) in.nval;
            adj.get(a - 1).add(new Edge(a, b, c));
        }

        PriorityQueue<Node> pq = new PriorityQueue<>(n, Comparator.comparingInt((Node node) -> node.price));
        pq.offer(new Node(1, 0));

        int[] dist = new int[n];
        boolean[] visited = new boolean[n];
        for (int i = 0; i < dist.length; i++)
            dist[i] = Integer.MAX_VALUE;
        dist[0] = 0;

        while (!pq.isEmpty()) {
            Node current = pq.poll();

            if (visited[current.id - 1])
                continue;
            visited[current.id - 1] = true;

            for (Edge edge : adj.get(current.id - 1)) {
                int newDist = current.price + edge.length;
                if (newDist < dist[edge.to - 1]) {
                    pq.offer(new Node(edge.to, newDist));
                    dist[edge.to - 1] = newDist;
                }
            }
        }

        for (int d : dist)
            System.out.print(d + " ");
    }

}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED