Shortest Routes I

//package week6;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;
import java.util.PriorityQueue;
 
public class ShortestRoutes {
 
    static final int INF = Integer.MAX_VALUE;
 
    public static void dijkstra(int n, int x, List<List<int[]>> adj) {
        int[] distance = new int[n + 1];
        Arrays.fill(distance, INF);
        distance[x] = 0;
 
        PriorityQueue<int[]> q = new PriorityQueue<>(Comparator.comparingInt(a -> a[0]));
        q.add(new int[]{0, x});
 
        boolean[] processed = new boolean[n + 1];
 
        while (!q.isEmpty()) {
            int[] top = q.poll();
            int a = top[1];
 
            if (processed[a]) continue;
            processed[a] = true;
 
            for (int[] u : adj.get(a)) {
                int b = u[0], w = u[1];
                if (distance[a] + w < distance[b]) {
                    distance[b] = distance[a] + w;
                    q.add(new int[]{distance[b], b});
                }
            }
        }
 
 
        for (int i = 1; i <= n; i++) {
            System.out.print((distance[i] == INF ? -1 : distance[i]) + " ");
        }
        System.out.println();
    }
 
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
 
 
        String[] values = br.readLine().split(" ");
        int n = Integer.parseInt(values[0]);
        int m = Integer.parseInt(values[1]);
 
 
        List<List<int[]>> adj = new ArrayList<>();
        for (int i = 0; i <= n; i++) {
            adj.add(new ArrayList<>());
        }
 
 
        for (int i = 0; i < m; i++) {
            String[] flight = br.readLine().split(" ");
            int a = Integer.parseInt(flight[0]);
            int b = Integer.parseInt(flight[1]);
            int c = Integer.parseInt(flight[2]);
 
 
            adj.get(a).add(new int[]{b, c});
        }
 
        dijkstra(n, 1, adj);
    }
}

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