Submission #1071225


Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>

using namespace std;

void solve()
{
	unsigned long long int N, A, B;
	cin >> N >> A >> B;
	vector<unsigned long long int> X(N);
	for (int i = 0; i < N; ++i)
	{
		cin >> X[i];
	}
	unsigned long long int ans = 0;
	int cur = X[0];
	for (int i = 1; i < N; ++i)
	{
		ans += min((X[i] - cur) * A, B);
		cur = X[i];
	}
	cout << ans << endl;
}

int main()
{
	solve();
	return(0);
}

Submission Info

Submission Time
Task D - Walk and Teleport
User smon
Language C++14 (GCC 5.4.1)
Score 500
Code Size 498 Byte
Status AC
Exec Time 43 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 2 ms 256 KB
sample_03.txt AC 2 ms 256 KB
subtask_1_balancedmax_01.txt AC 43 ms 1024 KB
subtask_1_balancedmax_02.txt AC 42 ms 1024 KB
subtask_1_max_01.txt AC 43 ms 1024 KB
subtask_1_max_02.txt AC 42 ms 1024 KB
subtask_1_min_01.txt AC 2 ms 256 KB
subtask_1_onlya_01.txt AC 23 ms 640 KB
subtask_1_onlyamax_01.txt AC 43 ms 1024 KB
subtask_1_onlyb_01.txt AC 12 ms 384 KB
subtask_1_onlybmax_01.txt AC 43 ms 1024 KB
subtask_1_rand_01.txt AC 28 ms 768 KB
subtask_1_rand_02.txt AC 36 ms 896 KB
subtask_1_rand_03.txt AC 17 ms 512 KB