Submission #1110700
Source Code Expand
import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); long A = sc.nextInt(); long B = sc.nextInt(); long minCost = 0; long[] x = new long[N]; for(int i = 0; i < N; i++) { x[i] = sc.nextLong(); } for(int i = 0; i < N - 1; i++) { minCost += Math.min((x[i + 1] - x[i]) * A, B); } System.out.println(minCost); } }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | takeya |
Language | Java8 (OpenJDK 1.8.0) |
Score | 500 |
Code Size | 474 Byte |
Status | AC |
Exec Time | 527 ms |
Memory | 34652 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 | 127 ms | 9680 KB |
sample_02.txt | AC | 134 ms | 9672 KB |
sample_03.txt | AC | 126 ms | 9676 KB |
subtask_1_balancedmax_01.txt | AC | 468 ms | 33768 KB |
subtask_1_balancedmax_02.txt | AC | 501 ms | 33412 KB |
subtask_1_max_01.txt | AC | 502 ms | 33324 KB |
subtask_1_max_02.txt | AC | 508 ms | 32860 KB |
subtask_1_min_01.txt | AC | 127 ms | 9680 KB |
subtask_1_onlya_01.txt | AC | 423 ms | 31496 KB |
subtask_1_onlyamax_01.txt | AC | 527 ms | 34652 KB |
subtask_1_onlyb_01.txt | AC | 345 ms | 29360 KB |
subtask_1_onlybmax_01.txt | AC | 504 ms | 32992 KB |
subtask_1_rand_01.txt | AC | 440 ms | 31612 KB |
subtask_1_rand_02.txt | AC | 477 ms | 32460 KB |
subtask_1_rand_03.txt | AC | 376 ms | 30068 KB |