CSES - DatatÃ¤hti 2016 alku - Results
 Task: Lennot Sender: @.+-_ Submission time: 2015-10-08 17:50:03 Language: Java Status: READY Result: 0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1--1details
#20.18 s1details
#30.17 s1details
#40.18 s1details
#5ACCEPTED0.19 s1details
#6--2details
#7--2details
#8--2details
#9--2details
#10--2details
#110.66 s3details
#120.69 s3details
#130.56 s3details
#140.65 s3details
#150.59 s3details
#160.53 s3details
#170.64 s3details

### Code

```import java.util.ArrayList;
import java.util.List;

public class Lents5Silence {
static int cityCount, flightCount;
static int[][] flights;
static long[][] costs, odd, even;

public static List<Integer> getFlightsFrom(int from) {
List<Integer> result = new ArrayList<Integer>();

for(int i = 0; i < flightCount; i++)
if(flights[i][0] == from)

return result;
}

public static void main(String[] args) {
IO oi = new IO();

cityCount = oi.nextInt();
flightCount = oi.nextInt();

flights = new int[flightCount][];
costs = new long[cityCount][];

odd = new long[cityCount][2];
even = new long[cityCount][2];

for(int i = 0; i < cityCount; i++) {
costs[i] = new long[cityCount];

odd[i][1] = Long.MAX_VALUE;
even[i][1] = Long.MAX_VALUE;

for(int j = 0; j < cityCount; j++)
costs[i][j] = Long.MAX_VALUE;
}

for(int i = 0; i < flightCount; i++) {
flights[i] = new int[] { oi.nextInt()-1, oi.nextInt()-1 };
costs[flights[i][0]][flights[i][1]] = Math.min(costs[flights[i][0]][flights[i][1]], oi.nextLong());
}

List<Integer> toCheck = new ArrayList<Integer>();

int curCheck, lastNum;
long lastPrice, addedPrice, lowOdd = Long.MAX_VALUE, lowEven = Long.MAX_VALUE;
boolean lastOdd = false;

while(!toCheck.isEmpty()) {
curCheck = toCheck.get(0);
toCheck.remove(0);

lastNum = (int) (!lastOdd ? odd[curCheck][0] : even[curCheck][0]);

if(lastNum > flightCount) continue;

for(int dest : getFlightsFrom(curCheck)) {
if(lastOdd) {
lastPrice = odd[curCheck][1] == Long.MAX_VALUE ? 0 : odd[curCheck][1];

if(dest == cityCount-1) {
lowEven = Math.min(lowEven, lastPrice);
continue;
}

if(even[dest][1] < lastPrice) continue;

even[dest][0] = lastNum + 1;
even[dest][1] = lastPrice;
} else {
lastPrice = even[curCheck][1] == Long.MAX_VALUE ? 0 : even[curCheck][1];

if(dest == cityCount-1) {
lowOdd = Math.min(lowOdd, lastPrice + addedPrice);
continue;
}

if(odd[dest][1] < lastPrice + addedPrice) continue;

odd[dest][0] = lastNum + 1;
}

}

lastOdd = !lastOdd;
}

oi.println(Math.min(lowOdd, lowEven));
oi.close();
}
}```

### Test details

Group: 1

Verdict:

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

correct output
8

user output
(empty)

Group: 1

Verdict:

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

correct output
9

user output
0

Group: 1

Verdict:

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

correct output
8

user output
0

Group: 1

Verdict:

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

correct output
13

user output
10

#### 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
(empty)

#### 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
(empty)

#### 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
(empty)

#### 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
(empty)

#### 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
(empty)

#### 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
(empty)

Error:
```Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
at Lents5Silence.main(Lents5Silence.java:32)```

#### 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
(empty)

Error:
```Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
at Lents5Silence.main(Lents5Silence.java:32)```

#### 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
(empty)

Error:
```Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
at Lents5Silence.main(Lents5Silence.java:32)```

#### 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
(empty)

Error:
```Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
at Lents5Silence.main(Lents5Silence.java:32)```

#### 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)

Error:
```Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
at Lents5Silence.main(Lents5Silence.java:32)```

#### 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)

Error:
```Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
at Lents5Silence.main(Lents5Silence.java:32)```

#### 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)

Error:
```Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
at Lents5Silence.main(Lents5Silence.java:32)```