oj.uz

Submission #164933

# Submission time Handle Problem Language Result Execution time Memory
164933 2019-11-24T06:34:34 Z gs18103 Safety (NOI18_safety) C++14
35 / 100
 398 ms 700 KB 
#include <iostream>
#include <deque>
using namespace std;
const int MAXN = 5e3+5;
const int MAXK = 5e3+5;
deque<pair<int,int>> d1;
int dp[3][MAXK];
int arr[MAXN];
int main(){
    int n,h;
    cin>>n>>h;
    for(int i=1;i<=n;i++){
        cin>>arr[i];
    }
    for(int i=1;i<=n;i++){
        for(int j=0;j<=min(MAXK-1,h);j++){
            int hold = dp[(i-1)%2][j];
            while(d1.size() && d1.back().first>hold){
                d1.pop_back();
            }
            d1.push_back(make_pair(hold,j));
 
        }
        for(int j=0;j<MAXK;j++){
 
            dp[i%2][j] = d1.front().first+abs(j-arr[i]);
            if(j<=10){
              //  cout<<i<<" "<<j<<" "<<dp[i%2][j]<<" "<<d1.front().first<<" "<<d1.front().second<<endl;
            }
            if(d1.front().second == j-h){
                d1.pop_front();
            }
            if(j+1+h<MAXK){
                int hold = dp[(i-1)%2][j+1+h];
                while(d1.size() && d1.back().first>hold){
                    d1.pop_back();
                }
                d1.push_back(make_pair(hold,j+h+1));
            }
 
        }
        while(d1.size()){
            d1.pop_back();
        }
    }
    int ans = 1e9;
    for(int i=0;i<MAXK;i++){
        ans = min(ans,dp[n%2][i]);
    }
    cout<<ans<<endl;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 380 KB Output is correct
5 Correct 3 ms 376 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 17 ms 700 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 380 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 37 ms 476 KB Output is correct
14 Correct 39 ms 412 KB Output is correct
15 Correct 41 ms 376 KB Output is correct
16 Correct 38 ms 408 KB Output is correct
17 Correct 34 ms 376 KB Output is correct
18 Correct 28 ms 376 KB Output is correct
19 Correct 35 ms 376 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 380 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 37 ms 476 KB Output is correct
14 Correct 39 ms 412 KB Output is correct
15 Correct 41 ms 376 KB Output is correct
16 Correct 38 ms 408 KB Output is correct
17 Correct 34 ms 376 KB Output is correct
18 Correct 28 ms 376 KB Output is correct
19 Correct 35 ms 376 KB Output is correct
20 Correct 41 ms 380 KB Output is correct
21 Correct 41 ms 456 KB Output is correct
22 Correct 34 ms 376 KB Output is correct
23 Correct 32 ms 376 KB Output is correct
24 Correct 39 ms 504 KB Output is correct
25 Correct 32 ms 376 KB Output is correct
26 Correct 39 ms 376 KB Output is correct
27 Correct 37 ms 376 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 380 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 37 ms 476 KB Output is correct
14 Correct 39 ms 412 KB Output is correct
15 Correct 41 ms 376 KB Output is correct
16 Correct 38 ms 408 KB Output is correct
17 Correct 34 ms 376 KB Output is correct
18 Correct 28 ms 376 KB Output is correct
19 Correct 35 ms 376 KB Output is correct
20 Correct 41 ms 380 KB Output is correct
21 Correct 41 ms 456 KB Output is correct
22 Correct 34 ms 376 KB Output is correct
23 Correct 32 ms 376 KB Output is correct
24 Correct 39 ms 504 KB Output is correct
25 Correct 32 ms 376 KB Output is correct
26 Correct 39 ms 376 KB Output is correct
27 Correct 37 ms 376 KB Output is correct
28 Correct 374 ms 412 KB Output is correct
29 Correct 320 ms 504 KB Output is correct
30 Correct 386 ms 504 KB Output is correct
31 Correct 326 ms 492 KB Output is correct
32 Correct 315 ms 504 KB Output is correct
33 Correct 386 ms 504 KB Output is correct
34 Correct 398 ms 376 KB Output is correct

Subtask #8
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 380 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Incorrect 3 ms 376 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 380 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Incorrect 3 ms 376 KB Output isn't correct
14 Halted 0 ms 0 KB -