Submission #1066003


Source Code Expand

import java.util.Scanner;

public class Main
{	
	private static long[] input = new long[100010];
	
	public static void main(String[] args)
	{
		Scanner scan = new Scanner(System.in);
	
		int i , j , n;
		long a , b , ans = 0;
		
		n = scan.nextInt();
		a = scan.nextInt();
		b = scan.nextInt();
		
		for (i = 1;i <= n;i ++)
			input[i] = scan.nextInt();
		for (i = 1;i <= n - 1;i ++)
		{
			long diff = input[i + 1] - input[i];
			long cost1 = b , cost2 = a * diff;
			ans += Math.min(cost1 , cost2);
		}
		
		System.out.println(ans);
	}
    
}








Submission Info

Submission Time
Task D - Walk and Teleport
User nevergiveup
Language Java7 (OpenJDK 1.7.0)
Score 500
Code Size 591 Byte
Status AC
Exec Time 501 ms
Memory 48888 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 12
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 125 ms 9812 KB
sample_02.txt AC 197 ms 9684 KB
sample_03.txt AC 125 ms 9812 KB
subtask_1_balancedmax_01.txt AC 469 ms 34072 KB
subtask_1_balancedmax_02.txt AC 468 ms 34124 KB
subtask_1_max_01.txt AC 485 ms 48888 KB
subtask_1_max_02.txt AC 474 ms 34844 KB
subtask_1_min_01.txt AC 126 ms 9812 KB
subtask_1_onlya_01.txt AC 436 ms 32216 KB
subtask_1_onlyamax_01.txt AC 486 ms 34260 KB
subtask_1_onlyb_01.txt AC 409 ms 30592 KB
subtask_1_onlybmax_01.txt AC 501 ms 48024 KB
subtask_1_rand_01.txt AC 443 ms 32176 KB
subtask_1_rand_02.txt AC 466 ms 32936 KB
subtask_1_rand_03.txt AC 412 ms 30688 KB