Lennot

import java.util.ArrayList;

public class Lennot{
    
    private static int index;
    private static ArrayList<destination> currentNodes;
    
    public static void main(String[] args){
        IO io = new IO();
        
        int n = io.nextInt();
        int m = io.nextInt();
        
        boolean[] beenTo = new boolean[n];
        long[] leastPrices = new long[n];
        ArrayList<flight>[] 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();
        currentNodes.add(new destination(0, 0));
        
        index = 0;
        
        while(currentNodes.get(index).city != n-1){
            int city = currentNodes.get(index).city;
            long price = currentNodes.get(index).price;
            index++;
            
            //System.out.println(city);
            
            if(beenTo[city])
                continue;

            beenTo[city] = true;

            for(flight f: connections[city]){

                long newPrice = price + f.price;

                if(f.city == n-1){
                    addSorted(new destination(n-1, newPrice));
                    continue;
                }

                for(flight f2: connections[f.city]){
                    if(leastPrices[f2.city] > newPrice){
                        leastPrices[f2.city] = newPrice;
                        addSorted(new destination(f2.city, newPrice));
                    }
                }
            }
        }
        
        io.println(currentNodes.get(index).price);
        io.close();
    }
    
    private static void addSorted(destination d){
        int min = index, max = currentNodes.size();
        
        if(currentNodes.get(max - 1).price <= d.price){
            currentNodes.add(d);
            return;
        }
        
        while(true){
            int i = (min + max) / 2;
            
            long price = currentNodes.get(i).price;
            
            if(price > d.price)
                max = i;
            else if(price < d.price)
                min = i;
            else{
                currentNodes.add(i, d);
                return;
            }
            
            if(max - min == 1){
                currentNodes.add(min, d);
                return;
            }
        }
    }
    
    
    private static class destination{
        int city;
        Long price;
        
        public destination(int city, long price){
            this.city = city;
            this.price = price;
        }
        
    }
    
    private static class flight{
        int city, price;
        
        public flight(int city, int price){
            this.city = city;
            this.price = price;
        }
    }
}

Test 1

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED