結果
| 問題 |
No.595 登山
|
| ユーザー |
 smiken_61
|
| 提出日時 | 2017-11-11 00:18:34 |
| 言語 | C++11（廃止可能性あり） (gcc 13.3.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,475 bytes |
| コンパイル時間 | 1,524 ms |
| コンパイル使用メモリ | 167,056 KB |
| 実行使用メモリ | 26,584 KB |
| 最終ジャッジ日時 | 2024-11-24 16:08:21 |
| 合計ジャッジ時間 | 3,772 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 4 WA * 21 |
ソースコード
#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<cstring>
#include<string>
#include <math.h>
#include<algorithm>
// #include <boost/multiprecision/cpp_int.hpp>
#include<functional>
#define int long long
#define inf 1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,pa>
#define ppa pair<pa,int>
#define ppap pair<int,pa>
#define ssa pair<string,int>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
#define equals(a,b) (fabs((a)-(b))<EPS)
using namespace std;
class Point{
public:
double x,y;
Point(double x=0,double y=0):x(x),y(y) {}
Point operator + (Point p) {return Point(x+p.x,y+p.y);}
Point operator - (Point p) {return Point(x-p.x,y-p.y);}
Point operator * (double a) {return Point(x*a,y*a);}
Point operator / (double a) {return Point(x/a,y/a);}
double absv() {return sqrt(norm());}
double norm() {return x*x+y*y;}
bool operator < (const Point &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const Point &p) const{
return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
}
};
typedef Point Vector;
struct Segment{
Point p1,p2;
};
double dot(Vector a,Vector b){
return a.x*b.x+a.y*b.y;
}
double cross(Vector a,Vector b){
return a.x*b.y-a.y*b.x;
}
bool parareru(Point a,Point b,Point c,Point d){
// if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
return abs(cross(a-b,d-c))<EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
return abs(cross(b-a, c-a)) / (b-a).absv();
}
bool is_intersected_ls(Segment a,Segment b) {
if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){
// cout<<"sss"<<endl;
if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
return false;
}
else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
}
double segment_dis(Segment a,Segment b){
if(is_intersected_ls(a,b))return 0;
double r=distance_ls_p(a.p1, a.p2, b.p1);
r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
return r;
}
Point intersection_ls(Segment a, Segment b) {
Point ba = b.p2-b.p1;
double d1 = abs(cross(ba, a.p1-b.p1));
double d2 = abs(cross(ba, a.p2-b.p1));
double t = d1 / (d1 + d2);
return a.p1 + (a.p2-a.p1) * t;
}
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}
int gcd(int v,int b){
if(v>b) return gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return gcd(v,b%v);
}
double distans(double x1,double y1,double x2,double y2){
double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
return sqrt(rr);
}
/*
int pr[100010];
//int inv[100010];
*/
int beki(int wa,int rr,int warukazu){
if(rr==0) return 1ll;
if(rr==1) return wa%warukazu;
if(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;
int zx=beki(wa,rr/2,warukazu);
return (zx*zx)%warukazu;
}
/*
void gya(){
pr[0]=1;
for(int i=1;i<100010;i++){
pr[i]=(pr[i-1]*i)%inf;
}
for(int i=0;i<100010;i++) inv[i]=beki(pr[i],inf-2);
}
*/
//sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
//vector<double> ans(100000000),ans2(100000000);
/*
int par[200100],ranks[200100],kosuu[200100];
void shoki(int n){
for(int i=0;i<n;i++){
par[i]=i;
ranks[i]=0;
kosuu[i]=1;
}
}
int root(int x){
return par[x]==x ? x : par[x]=root(par[x]);
}
bool same(int x,int y){
return root(x)==root(y);
}
void unite(int x,int y){
x=root(x);
y=root(y);
int xx=kosuu[x],yy=kosuu[y];
if(x==y) return;
if(ranks[x]<ranks[y]){
par[x]=y;
kosuu[y]=yy+xx;
}
else {
par[y]=x;
if(ranks[x]==ranks[y]) ranks[x]=ranks[x]+1;
kosuu[x]=yy+xx;
}
return;
}
*/
int n,m,k;
int a[200030],b[200030]={0},rui[200030]={0};
int me[200040];
int dp[200040][10]={0};
vector<int> yama,tani;
int sab(int j,int i){
return abs(b[i]-b[j]);
}
signed main(){
int p;
cin>>n>>p;
int cnt=1;
a[0]=inf;
me[1]=inf;
int sa=0;
bool bo=false;
for(int i=1;i<=n;i++){
cin>>a[i];
a[i]+=sa;
if(i>1){
int d=a[i]-a[i-1];
if(d>p){
a[i ] -= d-p;
sa-= d-p;
}
if(d<-p){
a[i] += -d-p;
sa += -d-p;
}
}
}
b[1]=a[1];
for(int i=2;i<=n;i++){
if(a[i]==a[i-1]) continue;
cnt++;
b[cnt]=a[i];
// cout<<b[cnt]<<endl;
}
for(int i=1;i<=cnt;i++) rui[i]=rui[i-1]+b[i];
int num=cnt;
cnt=1;
while(cnt<num){
if(b[cnt]>b[cnt+1]) cnt++;
else break;
}
b[cnt-1]=inf;
for(int i=cnt;i<=num-1;i++){
if(b[i]>b[i-1]&& b[i]>b[i+1]) yama.pb(i);
if(b[i]<b[i-1]&& b[i]<b[i+1]) {
tani.pb(i);
// cout<<i<<endl;
}
}
if(b[num]>b[num-1]) yama.pb(num);
else tani.pb(num);
// for(int i=0;i<yama.size();i++) cout<<yama[i]<<endl;
// for(int i=0;i<tani.size();i++) cout<<tani[i]<<endl;
int ta=tani.size();
for(int i=1;i<2*ta;i++){
if(ta>yama.size() && i==2*ta-1) break;
if(i%2==1){
dp[i][0]=min({dp[i-1][0],dp[i-1][1],dp[i-1][2]});
dp[i][1]=sab(tani[i/2],yama[i/2]-1)+min({dp[i-1][0],dp[i-1][1],dp[i-1][2]});
dp[i][2]=sab(tani[i/2],yama[i/2])+min({dp[i-1][0],dp[i-1][1],dp[i-1][2]});
}
else{
dp[i][0]=min({dp[i-1][0]+2*p,dp[i-1][1]+p,dp[i-1][2]});
dp[i][1]=sab(tani[i/2],yama[i/2-1]+1)+min({dp[i-1][0]+p,dp[i-1][1]+p,dp[i-1][2]});
dp[i][2]=sab(tani[i/2],yama[i/2-1])+min({dp[i-1][0],dp[i-1][1],dp[i-1][2]});
}
// for(int j=0;j<3;j++) cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;
}
if(ta>yama.size()){
cout<<min({dp[2*ta-2][0],dp[2*ta-2][1],dp[2*ta-2][2]})<<endl;
}
else{
cout<<min({dp[2*ta-1][0]+p,dp[2*ta-1][1]+p,dp[2*ta-1][2]})<<endl;
}
//cout<<ue<<endl;
}