Submission #2922973


Source Code Expand

#include <stdio.h>

typedef long long ll;

ll X[100005];

int main(){

	int N;
	ll A,B;

	scanf("%d %lld %lld",&N,&A,&B);

	int i;

	for(i=0;i<N;i++){
	scanf(" %lld",&X[i]);
	}

	ll ans=0ll;
	for(i=1;i<N;i++){
	ll move_cost=A*(X[i]-X[i-1]);
	if(move_cost>B){ans+=B;}
	else{ans+=move_cost;}
	}
	printf("%lld\n",ans);


	return 0;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User tekitouk
Language C (GCC 5.4.1)
Score 500
Code Size 359 Byte
Status AC
Exec Time 13 ms
Memory 896 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:12:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %lld %lld",&N,&A,&B);
  ^
./Main.c:17:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf(" %lld",&X[i]);
  ^

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 128 KB
sample_02.txt AC 1 ms 128 KB
sample_03.txt AC 1 ms 128 KB
subtask_1_balancedmax_01.txt AC 13 ms 896 KB
subtask_1_balancedmax_02.txt AC 13 ms 896 KB
subtask_1_max_01.txt AC 13 ms 896 KB
subtask_1_max_02.txt AC 13 ms 896 KB
subtask_1_min_01.txt AC 1 ms 128 KB
subtask_1_onlya_01.txt AC 7 ms 512 KB
subtask_1_onlyamax_01.txt AC 13 ms 896 KB
subtask_1_onlyb_01.txt AC 3 ms 384 KB
subtask_1_onlybmax_01.txt AC 13 ms 896 KB
subtask_1_rand_01.txt AC 8 ms 640 KB
subtask_1_rand_02.txt AC 11 ms 768 KB
subtask_1_rand_03.txt AC 5 ms 384 KB