Submission #1066967
Source Code Expand
import java.util.Scanner; public class Main { public static void main(String args[]) { new Main().solve(); } private void solve() { try (Scanner in = new Scanner(System.in)) { int N = in.nextInt(); long A = in.nextInt(); long B = in.nextInt(); long[] X = new long[N]; for (int i = 0; i < N; i++) { X[i] = in.nextInt(); } long sum = 0; for (int i = 1; i < N; i++) { sum += Math.min(A * (X[i] - X[i - 1]), B); } System.out.println(sum); } } }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | C7BMkOO7Qbmcwck7 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 500 |
Code Size | 667 Byte |
Status | AC |
Exec Time | 525 ms |
Memory | 33580 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 | 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 | 145 ms | 10192 KB |
sample_02.txt | AC | 127 ms | 9808 KB |
sample_03.txt | AC | 127 ms | 9676 KB |
subtask_1_balancedmax_01.txt | AC | 509 ms | 33152 KB |
subtask_1_balancedmax_02.txt | AC | 493 ms | 33040 KB |
subtask_1_max_01.txt | AC | 502 ms | 32996 KB |
subtask_1_max_02.txt | AC | 505 ms | 32796 KB |
subtask_1_min_01.txt | AC | 126 ms | 9680 KB |
subtask_1_onlya_01.txt | AC | 430 ms | 30528 KB |
subtask_1_onlyamax_01.txt | AC | 515 ms | 32576 KB |
subtask_1_onlyb_01.txt | AC | 340 ms | 29500 KB |
subtask_1_onlybmax_01.txt | AC | 525 ms | 33580 KB |
subtask_1_rand_01.txt | AC | 427 ms | 31640 KB |
subtask_1_rand_02.txt | AC | 484 ms | 32348 KB |
subtask_1_rand_03.txt | AC | 350 ms | 28160 KB |