Submission #961631

#	Time	Username	Problem	Language	Result	Execution time	Memory
961631		vjudge1	Safety (NOI18_safety)	C++17	0 / 100	6 ms	2648 KiB

safety

#include <bits/stdc++.h>
 
#pragma optimize("Ofast")
#pragma target("avx2")
 
using namespace std;
 
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
#define int ll
 
const int MAX=1e4+5;
const int B=90;
const int N=105;
const int block=400;
const int maxB=MAX/B+10;
const ll inf=2e18;  
const int mod=998244353;
const int mod1=1e9+9;
const ld eps=1e-9;
 
int dx[8]={1,0,-1,0,1,-1,-1,1};
int dy[8]={0,1,0,-1,1,-1,1,-1};
 
int binpow(int a,int n){
  if(!n)return 1;
  if(n%2==1)return a*binpow(a,n-1)%mod;
  int k=binpow(a,n/2);
  return k*k%mod;
}

int n,h;
int s[MAX];
multiset<int> x,y;
int dp[1010][2010];

void solve(){
  cin>>n>>h;
  int slope=0;
  int kx=0,ky=0;
  int cur=0;
  for(int i=1;i<=n;i++){
    cin>>s[i];
    slope--;
    {
      kx+=h;
      while(!x.empty()&&*x.begin()-kx<=0){
        slope++;
        x.erase(x.begin());
      }
    }
    {
      y.in(s[i]-kx);
      y.in(s[i]-kx);
      while(!x.empty()&&slope+sz(x)>0){
        int f=*x.rbegin();
        x.erase(--x.end());
        f-=kx;
        f-=kx;
        y.in(f);
      }
      while(!y.empty()&&slope+sz(x)<0){
        int f=*y.begin();
        y.erase(y.begin());
        f+=kx;
        f+=kx;
        x.in(f);
      }
    }
    // cout<<"!!!\n";
    // for(int f:x)cout<<f-kx<<" ";
    // cout<<"\n";
    // for(int f:y){
    //   cout<<f+kx<<" ";
    // }
    // cout<<"\n";
  }
  // cout<<slope<<" "<<sz(x)<<"\n";
  // cout<<*x.begin()<<"\n";
  vector<int> v;
  for(int f:x){
    v.pb(f-kx);
  }
  int last=0;
  for(int i=0;i<sz(v);i++){
    if(last==v[i]){
      slope++;
      continue;
    }
    // cout<<last<<" "<<v[i]<<" "<<slope<<"\n";
    cur+=(v[i]-last)*slope;
    slope++;
    last=v[i];
  }

  for(int i=1;i<=n;i++){
    for(int j=0;j<=2000;j++){
      dp[i][j]=inf;
    }
  }
  for(int i=1;i<=n;i++){
    for(int j=0;j<=100;j++){
      for(int p=max(0ll,j-h);p<=j+h;p++){
        dp[i][j]=min(dp[i-1][p]+abs(s[i]-j),dp[i][j]);
      }
    }
  }

  cout<<cur+dp[n][0]<<"\n";
}

//6 5 4 4 4 6 8 12 16 20 24 

signed main(){
  //  freopen("help.in","r",stdin);
  //  freopen("help.out","w",stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // prec();
  int t=1;
  // cin>>t;
  while(t--)solve();
}

Compilation message (stderr)

safety.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize("Ofast")
      | 
safety.cpp:4: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    4 | #pragma target("avx2")
      | 
safety.cpp: In function 'void solve()':
safety.cpp:54:12: warning: unused variable 'ky' [-Wunused-variable]
   54 |   int kx=0,ky=0;
      |            ^~

• Subtask 1: 0 / 3
• Subtask 2: 0 / 4
• Subtask 3: 0 / 9
• Subtask 4: 0 / 5
• Subtask 5: 0 / 6
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 22
• Subtask 9: 0 / 29