Submission #1987150


Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(void) {
  int n, a, b;
  cin >> n >> a >> b;
  int l, r;
  cin >> l;
  ll ans = 0;
  for (int i = 1; i < n; i++) {
    cin >> r;
    ans += min(1LL * (r - l) * a, 1LL * b);
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User comethelp
Language C++14 (GCC 5.4.1)
Score 0
Code Size 322 Byte
Status WA
Exec Time 55 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 1
WA × 2
AC × 5
WA × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, 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 WA 1 ms 256 KB
sample_02.txt WA 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_balancedmax_01.txt WA 53 ms 256 KB
subtask_1_balancedmax_02.txt WA 54 ms 256 KB
subtask_1_max_01.txt WA 53 ms 256 KB
subtask_1_max_02.txt WA 54 ms 256 KB
subtask_1_min_01.txt AC 1 ms 256 KB
subtask_1_onlya_01.txt WA 28 ms 256 KB
subtask_1_onlyamax_01.txt WA 54 ms 256 KB
subtask_1_onlyb_01.txt AC 14 ms 256 KB
subtask_1_onlybmax_01.txt AC 55 ms 256 KB
subtask_1_rand_01.txt AC 34 ms 256 KB
subtask_1_rand_02.txt WA 44 ms 256 KB
subtask_1_rand_03.txt WA 21 ms 256 KB