CSES - Datatähti 2016 alku - Results
Submission details
Task:Lennot
Sender:Perdex
Submission time:2015-10-07 18:31:43
Language:Java
Status:READY
Result:61
Feedback
groupverdictscore
#1ACCEPTED24
#2ACCEPTED37
#30
Test results
testverdicttimegroup
#1ACCEPTED0.17 s1details
#2ACCEPTED0.18 s1details
#3ACCEPTED0.17 s1details
#4ACCEPTED0.17 s1details
#5ACCEPTED0.18 s1details
#6ACCEPTED0.20 s2details
#7ACCEPTED0.20 s2details
#8ACCEPTED0.19 s2details
#9ACCEPTED0.20 s2details
#10ACCEPTED0.19 s2details
#11ACCEPTED0.52 s3details
#12ACCEPTED0.59 s3details
#13ACCEPTED0.55 s3details
#14ACCEPTED0.45 s3details
#15ACCEPTED0.41 s3details
#16--3details
#17--3details

Code

import java.util.ArrayList;
import java.util.TreeSet;

public class Lennot{
    
    private static int n;
    private static long[] leastPrices;
    private static boolean[] beenTo;
    private static ArrayList<flight>[] connections;
    private static TreeSet<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 TreeSet();
        currentNodes.add(new destination(0, 0));
        
        while(currentNodes.first().city != n-1)
            fly(currentNodes.pollFirst());
        
        
        io.println(currentNodes.first().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));
                }
                
            }
        }
    }
    
    private static class destination implements Comparable{
        int city;
        Long price;
        
        public destination(int city, long price){
            this.city = city;
            this.price = price;
        }
        
        @Override
        public int compareTo(Object o){
            int ans = price.compareTo(((destination)o).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 details

Test 1

Group: 1

Verdict: ACCEPTED

input
10 20
2 1 3
7 6 4
1 6 7
1 6 1
...

correct output
8

user output
8

Test 2

Group: 1

Verdict: ACCEPTED

input
10 20
4 3 10
1 10 9
3 4 10
2 6 7
...

correct output
9

user output
9

Test 3

Group: 1

Verdict: ACCEPTED

input
10 20
5 7 4
6 1 1
7 3 8
8 4 2
...

correct output
8

user output
8

Test 4

Group: 1

Verdict: ACCEPTED

input
10 20
1 6 2
5 3 3
7 3 6
5 6 2
...

correct output
13

user output
13

Test 5

Group: 1

Verdict: ACCEPTED

input
10 20
10 8 5
2 4 7
9 4 7
9 4 1
...

correct output
4

user output
4

Test 6

Group: 2

Verdict: ACCEPTED

input
1000 2000
91 828 365044406
17 984 445675537
251 852 100987451
907 487 58830088
...

correct output
11893353673

user output
11893353673

Test 7

Group: 2

Verdict: ACCEPTED

input
1000 2000
722 939 530579090
404 606 268877348
133 750 760086153
506 46 582310443
...

correct output
30248963445

user output
30248963445

Test 8

Group: 2

Verdict: ACCEPTED

input
1000 2000
340 237 43690066
217 141 453160975
744 202 639037814
605 926 404985542
...

correct output
3126797692

user output
3126797692

Test 9

Group: 2

Verdict: ACCEPTED

input
1000 2000
88 312 190442306
480 402 411574469
29 901 397491243
636 459 323246996
...

correct output
18416073173

user output
18416073173

Test 10

Group: 2

Verdict: ACCEPTED

input
1000 2000
333 228 718389176
796 286 323493090
743 43 751876815
128 554 175625940
...

correct output
6399349335

user output
6399349335

Test 11

Group: 3

Verdict: ACCEPTED

input
100000 200000
28264 92686 186865663
92570 33956 925976418
87377 71249 644757113
16701 81203 922125505
...

correct output
518249578675

user output
518249578675

Test 12

Group: 3

Verdict: ACCEPTED

input
100000 200000
95740 71482 846654568
44131 16806 670712211
3967 49254 424174139
39369 53007 830346557
...

correct output
920862321580

user output
920862321580

Test 13

Group: 3

Verdict: ACCEPTED

input
100000 200000
79947 25489 71554257
59184 25577 328436360
82945 73554 4942918
22380 92385 874250042
...

correct output
399407698440

user output
399407698440

Test 14

Group: 3

Verdict: ACCEPTED

input
100000 200000
31139 12960 580545990
27744 95556 747296719
46969 42578 840321561
5638 28960 513805324
...

correct output
165235287505

user output
165235287505

Test 15

Group: 3

Verdict: ACCEPTED

input
99993 199980
1 3 1
3 2 1
1 4 1
4 2 1
...

correct output
2

user output
2

Test 16

Group: 3

Verdict:

input
100000 149994
93867 98509 1755709
85029 99843 1347591
10305 35305 6447
75638 80585 1829972
...

correct output
1124960

user output
(empty)

Test 17

Group: 3

Verdict:

input
100000 200000
70413 71496 49
15963 40963 18635
81291 89420 1850028
8848 33848 17316
...

correct output
110298

user output
(empty)