Submission #1365624
Source Code Expand
import java.util.Scanner object Main extends App{ val sc = new Scanner(System.in) val n = sc.nextInt() val a = sc.nextInt(); val b = sc.nextInt() val x = new Array[Int](n+1) for(i <- 1 to n) x(i) = sc.nextInt() var ans = 0L for(i <- 1 to n-1) { val now: Long = x(i+1) - x(i) ans += Math.min(now * a, b) } println(ans) }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | Gobi |
Language | Scala (2.11.7) |
Score | 500 |
Code Size | 375 Byte |
Status | AC |
Exec Time | 673 ms |
Memory | 51980 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_balancedmax_01.txt, subtask_1_balancedmax_02.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_min_01.txt, subtask_1_onlya_01.txt, subtask_1_onlyamax_01.txt, subtask_1_onlyb_01.txt, subtask_1_onlybmax_01.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_rand_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 328 ms | 25148 KB |
sample_02.txt | AC | 329 ms | 25524 KB |
sample_03.txt | AC | 328 ms | 25528 KB |
subtask_1_balancedmax_01.txt | AC | 663 ms | 48932 KB |
subtask_1_balancedmax_02.txt | AC | 663 ms | 49320 KB |
subtask_1_max_01.txt | AC | 667 ms | 47484 KB |
subtask_1_max_02.txt | AC | 663 ms | 47328 KB |
subtask_1_min_01.txt | AC | 329 ms | 25384 KB |
subtask_1_onlya_01.txt | AC | 623 ms | 42836 KB |
subtask_1_onlyamax_01.txt | AC | 673 ms | 48492 KB |
subtask_1_onlyb_01.txt | AC | 587 ms | 40196 KB |
subtask_1_onlybmax_01.txt | AC | 672 ms | 51980 KB |
subtask_1_rand_01.txt | AC | 610 ms | 43836 KB |
subtask_1_rand_02.txt | AC | 634 ms | 47988 KB |
subtask_1_rand_03.txt | AC | 603 ms | 38664 KB |