Submission #1066602


Source Code Expand

//package com.beginner.b052;
import java.util.Scanner;

public class Main {

    public static void main(String args[]) throws Exception
    {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int a = sc.nextInt();
        int b = sc.nextInt();

        int cities [] = new int [n];
        for(int i=0;i<n;i++)
            cities[i] = sc.nextInt();

        long minCost = 0L;

        for(int i=0;i<n-1;i++){
            int dist = cities[i+1]-cities[i];
            minCost+=Math.min((long)dist*a,(long)b);
        }

        System.out.print(minCost);

        sc.close();
    }

}

Submission Info

Submission Time
Task D - Walk and Teleport
User cxr1242
Language Java8 (OpenJDK 1.8.0)
Score 500
Code Size 646 Byte
Status AC
Exec Time 540 ms
Memory 34276 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 127 ms 9676 KB
sample_02.txt AC 126 ms 9684 KB
sample_03.txt AC 130 ms 9676 KB
subtask_1_balancedmax_01.txt AC 518 ms 34276 KB
subtask_1_balancedmax_02.txt AC 492 ms 31480 KB
subtask_1_max_01.txt AC 505 ms 31704 KB
subtask_1_max_02.txt AC 540 ms 31552 KB
subtask_1_min_01.txt AC 126 ms 9676 KB
subtask_1_onlya_01.txt AC 430 ms 30508 KB
subtask_1_onlyamax_01.txt AC 522 ms 33376 KB
subtask_1_onlyb_01.txt AC 320 ms 28860 KB
subtask_1_onlybmax_01.txt AC 532 ms 31508 KB
subtask_1_rand_01.txt AC 434 ms 30628 KB
subtask_1_rand_02.txt AC 451 ms 31564 KB
subtask_1_rand_03.txt AC 367 ms 30004 KB