Submission #1077664


Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int N; cin >> N;
	int A, B; cin >> A >> B;
	vector<ll> X(N, 0LL);
	rep (i, N) cin >> X[i];
	ll res = 0LL;
	for (int i = 0; i < N - 1; ++i){
		res += (ll)min((X[i+1] - X[i]) * (ll)A, (ll)B);
	} // end for

	cout << res << endl;

	return 0;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User ty70
Language C++14 (GCC 5.4.1)
Score 500
Code Size 494 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 384 KB
sample_02.txt AC 3 ms 256 KB
sample_03.txt AC 2 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 512 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