Submission #1067622
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[] x = new long[n]; long dist = 0; long ans = 0; for(int i=0; i<n; i++){ x[i] = sc.nextInt(); } for(int i=0; i<n-1; i++){ dist = x[i+1] - x[i]; if(dist * a < b){ ans += dist * a; }else{ ans += b; } } System.out.println(ans); return; } }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | tsniper1237 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 500 |
Code Size | 504 Byte |
Status | AC |
Exec Time | 572 ms |
Memory | 34708 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 | 126 ms | 9672 KB |
sample_03.txt | AC | 134 ms | 9684 KB |
subtask_1_balancedmax_01.txt | AC | 516 ms | 33204 KB |
subtask_1_balancedmax_02.txt | AC | 528 ms | 33672 KB |
subtask_1_max_01.txt | AC | 486 ms | 33784 KB |
subtask_1_max_02.txt | AC | 483 ms | 33036 KB |
subtask_1_min_01.txt | AC | 127 ms | 9552 KB |
subtask_1_onlya_01.txt | AC | 430 ms | 31272 KB |
subtask_1_onlyamax_01.txt | AC | 526 ms | 34272 KB |
subtask_1_onlyb_01.txt | AC | 316 ms | 29060 KB |
subtask_1_onlybmax_01.txt | AC | 572 ms | 34708 KB |
subtask_1_rand_01.txt | AC | 443 ms | 30732 KB |
subtask_1_rand_02.txt | AC | 487 ms | 32776 KB |
subtask_1_rand_03.txt | AC | 358 ms | 29592 KB |