Submission #1097503


Source Code Expand

import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		long a = Long.parseLong(sc.next());
		long b = Long.parseLong(sc.next());
		long sum = 0;
		long from = Long.parseLong(sc.next());
		long to = Long.parseLong(sc.next());
		sum += (a*(to - from) < b) ? a*(to - from) : b;
		for(int i = 0; i < n - 2; i++) {
			from = to;
			to = Long.parseLong(sc.next());
			sum += (a*(to - from) < b) ? a*(to - from) : b;
		}
		System.out.println(String.valueOf(sum));
	}
}

Submission Info

Submission Time
Task D - Walk and Teleport
User zadihayusi
Language Java8 (OpenJDK 1.8.0)
Score 500
Code Size 588 Byte
Status AC
Exec Time 423 ms
Memory 31112 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 122 ms 9672 KB
sample_02.txt AC 123 ms 9548 KB
sample_03.txt AC 122 ms 9548 KB
subtask_1_balancedmax_01.txt AC 413 ms 30608 KB
subtask_1_balancedmax_02.txt AC 413 ms 30700 KB
subtask_1_max_01.txt AC 413 ms 30796 KB
subtask_1_max_02.txt AC 412 ms 30908 KB
subtask_1_min_01.txt AC 122 ms 9680 KB
subtask_1_onlya_01.txt AC 334 ms 29680 KB
subtask_1_onlyamax_01.txt AC 423 ms 30580 KB
subtask_1_onlyb_01.txt AC 277 ms 23352 KB
subtask_1_onlybmax_01.txt AC 415 ms 31112 KB
subtask_1_rand_01.txt AC 375 ms 29824 KB
subtask_1_rand_02.txt AC 412 ms 30284 KB
subtask_1_rand_03.txt AC 332 ms 27916 KB