Submission #2210779


Source Code Expand

#include <bits/stdc++.h>

#define INF 1 << 29
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);i++)

using namespace std;

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

void gen_sosuu(int sosuu[]){
  REP(i,100010){
    sosuu[i] = true;
  }
  sosuu[0] = false;
  sosuu[1] = false;
  sosuu[2] = true;
  FOR(i,2,sqrt(100000)+1){
    if(sosuu[i] == false) continue;
    for(int j = 2; i*j<=100000;j++){
      //printf("%d %d %d\n",i*j,i,j);
      sosuu[i*j] =false;
    }
  }
}
ll n,a,b;
ll now,ne;
ll sum = 0;
int main(){
  cin >> n>>a>>b>>now;
  REP(i,n-1){
    cin >> ne;
    sum += min(b,(ne-now)*a);
    //printf("%d,%d\n",b,(ne-now)*a);
    now = ne;
  }
  cout << sum<<endl;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User kumegon
Language C++14 (GCC 5.4.1)
Score 500
Code Size 769 Byte
Status AC
Exec Time 40 ms
Memory 256 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 256 KB
subtask_1_balancedmax_02.txt AC 40 ms 256 KB
subtask_1_max_01.txt AC 40 ms 256 KB
subtask_1_max_02.txt AC 40 ms 256 KB
subtask_1_min_01.txt AC 1 ms 256 KB
subtask_1_onlya_01.txt AC 21 ms 256 KB
subtask_1_onlyamax_01.txt AC 40 ms 256 KB
subtask_1_onlyb_01.txt AC 11 ms 256 KB
subtask_1_onlybmax_01.txt AC 40 ms 256 KB
subtask_1_rand_01.txt AC 26 ms 256 KB
subtask_1_rand_02.txt AC 33 ms 256 KB
subtask_1_rand_03.txt AC 15 ms 256 KB