Submission #2214335


Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define range(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, a) range(i, 0, a)
using namespace std;
const int INF = sizeof(int) == sizeof(long long) ? LLONG_MAX : INT_MAX;
const int MOD = 1000000007;
const long double EPS = 1e-8;

signed main() {
	int n, a, b;
	cin >> n >> a >> b;
	int x[n];
	rep (i, n) cin >> x[i];
	int ans = 0;
	rep (i, n - 1) ans += min(b, (x[i + 1] - x[i]) * a);
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User Masumi
Language C++14 (GCC 5.4.1)
Score 500
Code Size 495 Byte
Status AC
Exec Time 40 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 15
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 AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_balancedmax_01.txt AC 40 ms 1024 KB
subtask_1_balancedmax_02.txt AC 40 ms 1024 KB
subtask_1_max_01.txt AC 40 ms 1024 KB
subtask_1_max_02.txt AC 40 ms 1024 KB
subtask_1_min_01.txt AC 1 ms 256 KB
subtask_1_onlya_01.txt AC 21 ms 640 KB
subtask_1_onlyamax_01.txt AC 40 ms 1024 KB
subtask_1_onlyb_01.txt AC 11 ms 384 KB
subtask_1_onlybmax_01.txt AC 40 ms 1024 KB
subtask_1_rand_01.txt AC 26 ms 768 KB
subtask_1_rand_02.txt AC 34 ms 896 KB
subtask_1_rand_03.txt AC 15 ms 512 KB