CSES - Datatähti 2016 alku - Results
Submission details
Task:Lennot
Sender:Galax
Submission time:2015-10-07 00:39:50
Language:Java
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.17 s1details
#2ACCEPTED0.18 s1details
#3ACCEPTED0.17 s1details
#4ACCEPTED0.19 s1details
#5ACCEPTED0.17 s1details
#60.19 s2details
#70.19 s2details
#80.20 s2details
#90.19 s2details
#100.20 s2details
#110.56 s3details
#120.59 s3details
#130.55 s3details
#140.49 s3details
#15--3details
#16--3details
#17--3details

Code

import java.util.*;

public class t4 {
    
    public static void main(String[] args) {
        
        IO io = new IO();
        int cityAmount = io.nextInt();
        int flights = io.nextInt();
        
        ArrayList<City> cities = new ArrayList<>();
        
        for (int i = 1; i <= cityAmount; i++) {
            cities.add(new City(i));
        }
        for (int i = 0; i < flights; i++) {
            cities.get(io.nextInt()-1).neighbours.add(new Flight(cities.get(io.nextInt()-1),io.nextInt()));
        }
        flightCosts(cities.get(0));
        io.print(cities.get(cityAmount-1).minDistance);
        io.close();
    }
    
    public static void flightCosts(City source) {
        //Boolean isFree = false;
        source.minDistance = 0;
        PriorityQueue<City> cityList = new PriorityQueue<City>();
        source.flights=0;
	cityList.add(source);
        
	while (!cityList.isEmpty()) {
	    City c = cityList.poll();
            //check the logic of when the flight is free, currently every second polled one is free
            //this behaviour is incorrect
            for (Flight flight : c.neighbours) {
                City v = flight.target;
                int cost = 0;
                if (c.flights % 2 == 0) {
                    cost = flight.cost;
                }
                int newCost = c.minDistance + cost;
		if (newCost < v.minDistance) {
		    cityList.remove(v);
                    v.minDistance = newCost;
                    v.flights = c.flights + 1;
		    cityList.add(v);
		}
            }
           // isFree = !isFree;
            
        }
    }

    
}
class City implements Comparable<City>{
    public final int name;
    public ArrayList<Flight> neighbours;
    public int minDistance = Integer.MAX_VALUE;
    public int flights = 1;
    public City(int name) {
        this.name = name; 
        neighbours = new ArrayList<>();
    }
    public int compareTo(City other) {
        return Integer.compare(minDistance, other.minDistance);
    }
}


class Flight {
    public final City target;
    public final int cost;
    public Flight(City target, int cost) { 
        this.target = target; 
        this.cost = cost; 
    }
}


Test details

Test 1

Group: 1

Verdict:

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

correct output
8

user output
13

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:

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

correct output
11893353673

user output
-2055957869

Test 7

Group: 2

Verdict:

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

correct output
30248963445

user output
-227690987

Test 8

Group: 2

Verdict:

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

correct output
3126797692

user output
-1907469281

Test 9

Group: 2

Verdict:

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

correct output
18416073173

user output
-576181127

Test 10

Group: 2

Verdict:

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

correct output
6399349335

user output
-196089026

Test 11

Group: 3

Verdict:

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

correct output
518249578675

user output
-465061953

Test 12

Group: 3

Verdict:

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

correct output
920862321580

user output
26093962

Test 13

Group: 3

Verdict:

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

correct output
399407698440

user output
-549239382

Test 14

Group: 3

Verdict:

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

correct output
165235287505

user output
-1364206616

Test 15

Group: 3

Verdict:

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

correct output
2

user output
(empty)

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)