oj.uz

답안 #961642

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
961642 2024-04-12T09:29:01 Z vjudge1 Safety (NOI18_safety) C++17
22 / 100
 142 ms 8992 KB 
#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);
      }
      while(!x.empty()&&!y.empty()&&*x.rbegin()-kx>*y.begin()+kx){
        int a=*x.rbegin()-kx-kx;
        int b=*y.begin()+kx+kx;
        x.erase(--x.end());
        y.erase(y.begin());
        x.in(b);
        y.in(a);
      }
    }
  }
  vector<int> v;
  for(int f:x){
    v.pb(f-kx);
  }
  int last=0;
  for(int i=0;i<sz(v);i++){
    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<=500;j++){
      for(int p=max(0ll,j-h);p<=min(500ll,j+h);p++){
        dp[i][j]=min(dp[i-1][p]+abs(s[i]-j),dp[i][j]);
      }
    }
  }
  // cout<<cur<<" "<<dp[n][0]<<"\n";
  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

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
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 2 ms 2512 KB Output is correct
4 Correct 1 ms 2648 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 2652 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2512 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 8 ms 8792 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 131 ms 8836 KB Output is correct
16 Correct 81 ms 8836 KB Output is correct
17 Correct 142 ms 8832 KB Output is correct
18 Correct 74 ms 6772 KB Output is correct
19 Correct 4 ms 8992 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2512 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 8 ms 8792 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 131 ms 8836 KB Output is correct
16 Correct 81 ms 8836 KB Output is correct
17 Correct 142 ms 8832 KB Output is correct
18 Correct 74 ms 6772 KB Output is correct
19 Correct 4 ms 8992 KB Output is correct
20 Incorrect 127 ms 8796 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2512 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 8 ms 8792 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 131 ms 8836 KB Output is correct
16 Correct 81 ms 8836 KB Output is correct
17 Correct 142 ms 8832 KB Output is correct
18 Correct 74 ms 6772 KB Output is correct
19 Correct 4 ms 8992 KB Output is correct
20 Incorrect 127 ms 8796 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #8
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2512 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 600 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 8 ms 8792 KB Output is correct
20 Correct 2 ms 8796 KB Output is correct
21 Correct 131 ms 8836 KB Output is correct
22 Correct 81 ms 8836 KB Output is correct
23 Correct 142 ms 8832 KB Output is correct
24 Correct 74 ms 6772 KB Output is correct
25 Correct 4 ms 8992 KB Output is correct
26 Incorrect 127 ms 8796 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2512 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 600 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Runtime error 6 ms 2652 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -