Submission #1067031


Source Code Expand

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		long a = scanner.nextInt(); // walk
		long b = scanner.nextInt(); // telaport
		
		long count = 0l;
		int tmp = scanner.nextInt(); // 始めの場所
		for (int i = 1; i < n; i++) {
			int pos = scanner.nextInt();
			long aMove = (pos - tmp) * a;
			if (aMove > b) {
				count += b;
			}else {
				count += aMove;
			}
			tmp = pos;
		}
		System.out.println(count);
	}
}

Submission Info

Submission Time
Task D - Walk and Teleport
User Kousou_Yama
Language Java8 (OpenJDK 1.8.0)
Score 500
Code Size 557 Byte
Status AC
Exec Time 530 ms
Memory 32388 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 124 ms 9684 KB
sample_02.txt AC 126 ms 9552 KB
sample_03.txt AC 126 ms 9680 KB
subtask_1_balancedmax_01.txt AC 499 ms 30384 KB
subtask_1_balancedmax_02.txt AC 454 ms 30128 KB
subtask_1_max_01.txt AC 501 ms 30556 KB
subtask_1_max_02.txt AC 524 ms 30620 KB
subtask_1_min_01.txt AC 124 ms 9548 KB
subtask_1_onlya_01.txt AC 426 ms 30652 KB
subtask_1_onlyamax_01.txt AC 516 ms 30612 KB
subtask_1_onlyb_01.txt AC 319 ms 28400 KB
subtask_1_onlybmax_01.txt AC 530 ms 32388 KB
subtask_1_rand_01.txt AC 421 ms 31016 KB
subtask_1_rand_02.txt AC 474 ms 30932 KB
subtask_1_rand_03.txt AC 387 ms 29116 KB