Submission #3413538


Source Code Expand

#include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;
#define int long long

signed main(){
	int N, A, B;
	cin >> N >> A >> B;
	vector<int> X(N);
	for(int i = 0; i < N; ++i) {
		cin >> X[i];
	}
	int res = 0;
	for(int i = 0; i < N - 1; ++i) {
		res += min(B, A * (X[i+1] - X[i]));
	}
	cout << res << endl;
	return 0;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User blue_jam
Language C++14 (GCC 5.4.1)
Score 500
Code Size 425 Byte
Status AC
Exec Time 41 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 41 ms 1024 KB
subtask_1_max_01.txt AC 40 ms 1024 KB
subtask_1_max_02.txt AC 41 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 41 ms 1024 KB
subtask_1_onlyb_01.txt AC 11 ms 384 KB
subtask_1_onlybmax_01.txt AC 41 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 16 ms 512 KB