Submission #1067355


Source Code Expand

using System;
public class Wat {
    public static void Main() {
        string[] read = new string[3];
        read = Console.ReadLine().Split(' ');
        long N = long.Parse(read[0]);
        long A = long.Parse(read[1]);
        long B = long.Parse(read[2]);
        string[] read2 = new string[N];
        read2 = Console.ReadLine().Split(' ');
        long[] X = new long[N];
        for (int i = 0; i < N; i++) {
            X[i] = long.Parse(read2[i]);
        }
        long cost = 0;
        for (int i = 0; i < N - 1; i++) {
            if ((X[i + 1] - X[i]) * A <= B) {
                cost += (X[i + 1] - X[i]) * A;
            } else {
                cost += B;
            }
        }
        Console.WriteLine(cost);
    }
}

Submission Info

Submission Time
Task D - Walk and Teleport
User shomu36
Language C# (Mono 4.6.2.0)
Score 500
Code Size 766 Byte
Status AC
Exec Time 68 ms
Memory 13272 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 20 ms 2776 KB
sample_02.txt AC 19 ms 2648 KB
sample_03.txt AC 19 ms 2648 KB
subtask_1_balancedmax_01.txt AC 66 ms 13272 KB
subtask_1_balancedmax_02.txt AC 67 ms 13272 KB
subtask_1_max_01.txt AC 66 ms 13272 KB
subtask_1_max_02.txt AC 66 ms 13272 KB
subtask_1_min_01.txt AC 19 ms 2648 KB
subtask_1_onlya_01.txt AC 43 ms 8152 KB
subtask_1_onlyamax_01.txt AC 66 ms 13272 KB
subtask_1_onlyb_01.txt AC 32 ms 6104 KB
subtask_1_onlybmax_01.txt AC 68 ms 13272 KB
subtask_1_rand_01.txt AC 49 ms 9304 KB
subtask_1_rand_02.txt AC 59 ms 11480 KB
subtask_1_rand_03.txt AC 37 ms 6616 KB