Submission #1365601
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 = 0 for(i <- 1 to n-1) { val now = 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 | 0 |
Code Size | 368 Byte |
Status | WA |
Exec Time | 672 ms |
Memory | 49412 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 360 ms | 25912 KB |
sample_02.txt | AC | 333 ms | 25276 KB |
sample_03.txt | AC | 335 ms | 25392 KB |
subtask_1_balancedmax_01.txt | WA | 668 ms | 48744 KB |
subtask_1_balancedmax_02.txt | WA | 650 ms | 48864 KB |
subtask_1_max_01.txt | WA | 669 ms | 49204 KB |
subtask_1_max_02.txt | WA | 672 ms | 47836 KB |
subtask_1_min_01.txt | AC | 334 ms | 25536 KB |
subtask_1_onlya_01.txt | WA | 626 ms | 44696 KB |
subtask_1_onlyamax_01.txt | WA | 659 ms | 49280 KB |
subtask_1_onlyb_01.txt | WA | 598 ms | 38780 KB |
subtask_1_onlybmax_01.txt | WA | 663 ms | 49412 KB |
subtask_1_rand_01.txt | WA | 627 ms | 43916 KB |
subtask_1_rand_02.txt | WA | 655 ms | 47596 KB |
subtask_1_rand_03.txt | WA | 616 ms | 38856 KB |