Submission #1593568


Source Code Expand

#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

int main(){
	int N;
	ll A,B;
	vector<ll>X;
	cin >> N >> A >> B;
	ll input;
	for(int i=0;i<N;i++){
		cin >> input;
		X.push_back(input);
	}
	
	ll answer=0;
	for(int i=0;i<N-1;i++){
		if((X[i+1]-X[i])*A > B){
			answer += B;
		}else{
			answer += (X[i+1]-X[i])*A;
		}
	}
	cout << answer << endl;
	return 0;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User mashi6n
Language C++14 (GCC 5.4.1)
Score 500
Code Size 418 Byte
Status AC
Exec Time 42 ms
Memory 1400 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 41 ms 1400 KB
subtask_1_balancedmax_02.txt AC 41 ms 1400 KB
subtask_1_max_01.txt AC 41 ms 1400 KB
subtask_1_max_02.txt AC 41 ms 1400 KB
subtask_1_min_01.txt AC 1 ms 256 KB
subtask_1_onlya_01.txt AC 22 ms 892 KB
subtask_1_onlyamax_01.txt AC 42 ms 1400 KB
subtask_1_onlyb_01.txt AC 11 ms 640 KB
subtask_1_onlybmax_01.txt AC 41 ms 1400 KB
subtask_1_rand_01.txt AC 26 ms 892 KB
subtask_1_rand_02.txt AC 34 ms 1400 KB
subtask_1_rand_03.txt AC 16 ms 892 KB