Submission #1080030


Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include "iostream"
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;

int main(void)
{
	int n;
	ll a, b;
	ll atmina;
	ll power = 0;
	cin >> n >> a >> b;
	vector<ll> x(n);
	for (int i = 0; i < n; i++)
	{
		cin >> x[i];
	}

	for (int i = 0; i < n - 1; i++)
	{
		atmina = min(a*(x[i + 1] - x[i]), b);
		power += atmina;
	}


	cout << power << endl;

	return 0;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User tolufu
Language C++14 (GCC 5.4.1)
Score 500
Code Size 473 Byte
Status AC
Exec Time 44 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 43 ms 1024 KB
subtask_1_balancedmax_02.txt AC 44 ms 1024 KB
subtask_1_max_01.txt AC 43 ms 1024 KB
subtask_1_max_02.txt AC 44 ms 1024 KB
subtask_1_min_01.txt AC 3 ms 256 KB
subtask_1_onlya_01.txt AC 24 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 29 ms 768 KB
subtask_1_rand_02.txt AC 37 ms 896 KB
subtask_1_rand_03.txt AC 17 ms 512 KB