Submission #1067768
Source Code Expand
import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); long cnt = 0; int N = sc.nextInt(); long A = sc.nextInt(); long B = sc.nextInt(); long[] dp = new long[N]; for(int i=0;i<N;i++){ dp[i] = sc.nextInt(); } for (int i=0;i<N-1;i++){ // System.out.println(cnt); if( (dp[i+1]-dp[i]) * A < B ) cnt += (dp[i+1]-dp[i]) * A ; else cnt += B; // System.out.println(i); } System.out.print(cnt); System.out.println(); } }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | areku2014 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 500 |
Code Size | 693 Byte |
Status | AC |
Exec Time | 502 ms |
Memory | 34836 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 | 116 ms | 9556 KB |
sample_02.txt | AC | 117 ms | 9672 KB |
sample_03.txt | AC | 118 ms | 9548 KB |
subtask_1_balancedmax_01.txt | AC | 499 ms | 33260 KB |
subtask_1_balancedmax_02.txt | AC | 441 ms | 32964 KB |
subtask_1_max_01.txt | AC | 487 ms | 32724 KB |
subtask_1_max_02.txt | AC | 471 ms | 33144 KB |
subtask_1_min_01.txt | AC | 118 ms | 9680 KB |
subtask_1_onlya_01.txt | AC | 414 ms | 31452 KB |
subtask_1_onlyamax_01.txt | AC | 502 ms | 34836 KB |
subtask_1_onlyb_01.txt | AC | 326 ms | 29540 KB |
subtask_1_onlybmax_01.txt | AC | 489 ms | 33240 KB |
subtask_1_rand_01.txt | AC | 389 ms | 31380 KB |
subtask_1_rand_02.txt | AC | 452 ms | 32848 KB |
subtask_1_rand_03.txt | AC | 326 ms | 28524 KB |