Submission #1230828
Source Code Expand
#define SORT(v) sort(begin(v), end(v))
#define FIND(v,x) find(begin(v), end(v), (x))
#define MEMNEXT(from, to) do{ memmove((to), (from), sizeof(from)); \
memset((from), 0, sizeof(from)); } while(0)
#define DUMP(x) std::cerr << "(DUMP) " << (#x) << ": " << x << std::endl
#include <iostream>
#include <sstream>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cstdarg>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <numeric>
#include <utility>
// #include "ane.cpp"
#define INF (int)1e9
#define INFLL (long long)1e18
#define NMAX 100005
#define MMAX 100005
#define MOD 100000
using namespace std;
// コメントアウトするとdebug()を実行しない
#define DEBUG
//
// ライブラリ
//
// frequent used aliases
typedef long long ll;
typedef pair<int, int> p;
typedef pair<ll, int> lp;
typedef pair<ll, ll> llp;
typedef vector<int> vec;
typedef vector<vec> mat;
// frequent used constants
static const int di[] = {-1, 0, 1, -1, 1, -1, 0, 1};
static const int dj[] = {-1, -1, -1, 0, 0, 1, 1, 1};
// デバッグ用printf
void debug(const char* format, ...){
#ifndef DEBUG
return;
#endif
va_list arg;
va_start(arg, format);
vprintf(format, arg); // コンソールに出力
va_end(arg);
}
// n次元配列の初期化。第2引数の型のサイズごとに初期化していく。
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
// Union-Find Tree
class UnionFindTree{
struct node{
int par;
};
std::vector<node> T;
public:
void init(int num){
T.resize(num+1); // ignore T[0]
for (int i = 1; i <= num; ++i)
{
T[i].par = i;
}
}
void unite(int x, int y){
T[find(y)].par = find(x);
}
int find(int x){
if (T[x].par == x) return x;
else return T[x].par = find(T[x].par);
}
bool same(int x, int y){
return find(x) == find(y);
}
};
// Segment Tree for Range Minimum Query
// **********************************************************
// *** important: all functions' variable, ***
// *** such as "index", "l", "r", etc., must be 0-origin. ***
// **********************************************************
// ********************************************
// *** important: NMAX must be power of 2. ***
// ********************************************
template<typename T>
class SegmentTree{
private:
ll N;
T INF_VAL;
T dat[NMAX * 2]; // 0 origin, A[i] = dat[i + N]
T _query(ll l, ll r, ll l_resp, ll r_resp, ll i_dat){
debug("query(%lld, %lld, %lld, %lld, %lld) called\n",
l, r, l_resp, r_resp, i_dat);
if (r < l_resp || r_resp < l) return INF_VAL;
else if(l <= l_resp && r_resp <= r) return dat[i_dat];
else return min(_query(l ,r, l_resp, (l_resp + r_resp) / 2, i_dat * 2),
_query(l, r, (l_resp + r_resp) / 2 + 1, r_resp, i_dat * 2 + 1));
}
public:
void init(ll _N, T _inf_val){
N = 1; while(N < _N) N *= 2;
INF_VAL = _inf_val;
Fill(dat, _inf_val);
}
T get(ll index){
return dat[index + N];
}
void set(int index, T val){
int i_dat = index + N;
dat[i_dat] = val;
for (i_dat /= 2; i_dat > 0; i_dat /= 2)
{
dat[i_dat] = min(dat[i_dat * 2], dat[i_dat * 2 + 1]);
}
}
T query(ll l, ll r){
return _query(l, r, 0, N - 1, 1);
}
void dump(){
cout << "*** SegTree dump begin ***\n";
cout << "N = " << N << ", INF_VAL = " << INF_VAL << endl;
for (int i = 1; i < N * 2; i *= 2)
{
for (int j = i; j < i * 2; ++j)
{
if(dat[j] == INF_VAL) cout << "INF ";
else cout << dat[j] << " ";
}
cout << endl;
}
cout << "*** SegTree dump end ***\n";
}
};
// Binary Indexed Tree for Range Sum Query
// *******************************************
// *** important: all functions' variable, ***
// *** such as "i", must be 1-origin. ***
// *******************************************
template<typename T>
class BinaryIndexedTree{
private:
ll N;
T dat[NMAX + 1]; // 1 origin, A[i] = sum(i) - sum(i-1)
public:
void init(ll _N){
N = _N;
Fill(dat, 0);
}
void add(int i, T val){
while(i <= N) {
dat[i] += val;
i += i & -i;
}
}
T sum(ll i){
T ret = 0;
while(i > 0) {
ret += dat[i];
i -= i & -i; // set last HIGH bit to LOW
}
return ret;
}
T sum(ll left, ll right){
return sum(right) - sum(left - 1);
}
void dump(){
cout << "*** BITree dump begin ***\n";
cout << "N = " << N << endl;
for (int i = 1; i <= N; i *= 2)
{
cout << dat[i] << " ";
}
cout << "*** BITree dump end ***\n";
}
};
//
// ライブラリ終了
//
ll N,M,K,A,B,C,D,E;
int X[NMAX] = {};
ll ans = 0;
void solve(){
// 解答アルゴリズムb
for (int i = 1; i < N; ++i)
{
if (A * (X[i] - X[i-1]) > B)
{
ans += B;
}else{
ans += A * (X[i] - X[i-1]);
}
}
}
void debug(){
// デバッグ用出力
}
void answer(){
// 解答出力
printf("%lld\n", ans);
}
int main(int argc, char const *argv[])
{
// 入力の読み込み,番兵法
// Fill(dp, -1);
scanf("%lld%lld%lld", &N,&A, &B);
for (int i = 0; i < N; ++i)
{
scanf("%d", &X[i]);
}
solve();
#ifdef DEBUG
debug();
#endif
answer();
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Walk and Teleport |
User |
anekawa |
Language |
C++14 (Clang 3.8.0) |
Score |
500 |
Code Size |
6202 Byte |
Status |
AC |
Exec Time |
13 ms |
Memory |
888 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
500 / 500 |
Status |
|
|
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 |
7 ms |
888 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
sample_03.txt |
AC |
1 ms |
256 KB |
subtask_1_balancedmax_01.txt |
AC |
13 ms |
640 KB |
subtask_1_balancedmax_02.txt |
AC |
13 ms |
640 KB |
subtask_1_max_01.txt |
AC |
13 ms |
640 KB |
subtask_1_max_02.txt |
AC |
13 ms |
640 KB |
subtask_1_min_01.txt |
AC |
1 ms |
256 KB |
subtask_1_onlya_01.txt |
AC |
7 ms |
512 KB |
subtask_1_onlyamax_01.txt |
AC |
13 ms |
640 KB |
subtask_1_onlyb_01.txt |
AC |
4 ms |
384 KB |
subtask_1_onlybmax_01.txt |
AC |
13 ms |
640 KB |
subtask_1_rand_01.txt |
AC |
9 ms |
512 KB |
subtask_1_rand_02.txt |
AC |
11 ms |
640 KB |
subtask_1_rand_03.txt |
AC |
5 ms |
384 KB |