Submission #1067587
Source Code Expand
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); long n = sc.nextInt(); long a = sc.nextInt(); long b = sc.nextInt(); long cities[] = new long[(int)n]; for(int i=0;i<n;i++){ cities[i] = sc.nextInt(); } long poyasimi = 0; for(int i=0;i<n-1;i++){ long sub = cities[i+1]-cities[i]; poyasimi += Math.min(a*sub, b); } System.out.println(poyasimi); } }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | Namazu |
Language | Java8 (OpenJDK 1.8.0) |
Score | 500 |
Code Size | 480 Byte |
Status | AC |
Exec Time | 521 ms |
Memory | 33460 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 | 9676 KB |
sample_02.txt | AC | 127 ms | 9680 KB |
sample_03.txt | AC | 127 ms | 9676 KB |
subtask_1_balancedmax_01.txt | AC | 503 ms | 33040 KB |
subtask_1_balancedmax_02.txt | AC | 488 ms | 33460 KB |
subtask_1_max_01.txt | AC | 466 ms | 33108 KB |
subtask_1_max_02.txt | AC | 508 ms | 33268 KB |
subtask_1_min_01.txt | AC | 127 ms | 9684 KB |
subtask_1_onlya_01.txt | AC | 427 ms | 30876 KB |
subtask_1_onlyamax_01.txt | AC | 521 ms | 33068 KB |
subtask_1_onlyb_01.txt | AC | 342 ms | 29176 KB |
subtask_1_onlybmax_01.txt | AC | 521 ms | 32628 KB |
subtask_1_rand_01.txt | AC | 443 ms | 31416 KB |
subtask_1_rand_02.txt | AC | 471 ms | 32896 KB |
subtask_1_rand_03.txt | AC | 355 ms | 30052 KB |