Lennot

import java.util.ArrayList;
import java.util.Comparator;
 
public class Lennot{
    
    private static int n;
    private static long[] leastPrices;
    private static boolean[] beenTo;
    private static ArrayList<flight>[] connections;
    private static ArrayList<destination> currentNodes;
    
    public static void main(String[] args){
        IO io = new IO();
        
        n = io.nextInt();
        int m = io.nextInt();
        
        beenTo = new boolean[n];
        leastPrices = new long[n];
        connections = new ArrayList[n];
        for(int i = 0; i < n; i++){
            connections[i] = new ArrayList();
            leastPrices[i] = Long.MAX_VALUE;
        }
        
        
        for(int i = 0; i < m; i++){
            int a = io.nextInt() - 1, b = io.nextInt() - 1, h = io.nextInt();
            connections[a].add(new flight(b, h));
        }
        
        currentNodes = new ArrayList();
        
        destination d = new destination(0, 0);
        
        while(d.city != n-1){
            fly(d);
            d = currentNodes.get(currentNodes.size()-1);
            currentNodes.remove(currentNodes.size()-1);
        }
        
        io.println(d.price);
        io.close();
    }
    
    private static void fly(destination d){
        
        if(beenTo[d.city])
            return;
        
        beenTo[d.city] = true;
        
        for(flight f: connections[d.city]){
            
            long newPrice = d.price + f.price;
            
            if(f.city == n-1)
                currentNodes.add(new destination(n-1, newPrice));
            
            for(flight f2: connections[f.city]){
                if(leastPrices[f2.city] > newPrice){
                    leastPrices[f2.city] = newPrice;
                    currentNodes.add(new destination(f2.city, newPrice));
                }
                
            }
        }
        currentNodes.sort(com);
    }
    
    static destination com = new destination(0, 0);
    
    private static class destination implements Comparator<destination>{
        int city;
        Long price;
        
        public destination(int city, long price){
            this.city = city;
            this.price = price;
        }
        
        @Override
        public int compare(destination d1, destination d2){
            int ans = d2.price.compareTo(d1.price);
            if(ans == 0)
                return 1;
            return ans;
        }
    }
    
    private static class flight{
        int city, price;
        
        public flight(int city, int price){
            this.city = city;
            this.price = price;
        }
    }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED