Submission #1070098


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#define ll long long
using namespace std;
int main() {
	cin.tie(0); ios::sync_with_stdio(false);
	ll N, A, B; cin >> N >> A >> B;
	vector<ll> X(N + 1,0);
	for (int i = 1; i <= N; i++) cin >> X[i];

	ll ans = 0;
	for (int i = 1; i < N;i++) {
		int diff = X[i + 1] - X[i];
		ans += min(A*diff, B);
	}
	cout << ans << endl;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User clavis1107
Language C++14 (GCC 5.4.1)
Score 500
Code Size 398 Byte
Status AC
Exec Time 14 ms
Memory 1024 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 3 ms 256 KB
sample_02.txt AC 3 ms 256 KB
sample_03.txt AC 3 ms 256 KB
subtask_1_balancedmax_01.txt AC 14 ms 1024 KB
subtask_1_balancedmax_02.txt AC 14 ms 1024 KB
subtask_1_max_01.txt AC 14 ms 1024 KB
subtask_1_max_02.txt AC 14 ms 1024 KB
subtask_1_min_01.txt AC 3 ms 256 KB
subtask_1_onlya_01.txt AC 8 ms 640 KB
subtask_1_onlyamax_01.txt AC 14 ms 1024 KB
subtask_1_onlyb_01.txt AC 5 ms 384 KB
subtask_1_onlybmax_01.txt AC 14 ms 1024 KB
subtask_1_rand_01.txt AC 10 ms 768 KB
subtask_1_rand_02.txt AC 12 ms 896 KB
subtask_1_rand_03.txt AC 7 ms 512 KB