oj.uz

Submission #830824

# Submission time Handle Problem Language Result Execution time Memory
830824 2023-08-19T11:01:39 Z vjudge1 Safety (NOI18_safety) C++17
40 / 100
 326 ms 196384 KB 
#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
const int nmax = 200002;
ll S[nmax];
ll dp[5005][5005];
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll n,h;
    deque<pair<ll,ll>>dq;
    cin >> n >> h;
	for(int i=1;i<=n;i++)cin >> S[i];
    if(h==0) {
        sort(S+1, S+n+1);
        ll ans = 0;
        for(int i=1; i<=n; i++) {
            ans+=abs(S[i]-S[n/2+1]);
        }
        cout << ans << endl;
        return 0;
    }
	for(int i=0;i<=5000;i++)dp[1][i] = abs(S[1] - i);
	for(int i=2;i<=n;i++){
		dq.clear();
		for(int j=0;j<=min(5000ll, h);j++){
			while(!dq.empty() && dq.back().fi > dp[i-1][j])dq.pop_back();
			dq.push_back({dp[i-1][j], j});
		}
		for(int j=0;j<=5000;j++){
			if(!dq.empty() && dq.front().se < j - h)dq.pop_front();
			pair<ll,ll> tmp = dq.front();
			dp[i][j] = tmp.fi + abs(S[i] - j);
			if(j + h + 1 <= 5000){
				while(!dq.empty() && dq.back().fi > dp[i-1][j + h + 1])dq.pop_back();
				dq.push_back({dp[i-1][j+h+1], j+h+1});
			}
		}
	}
	ll ans = 1e18;
	for(int i=0;i<=5000;i++)ans = min(ans, dp[n][i]);
	cout << ans;
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 716 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 820 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 1 ms 852 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1384 KB Output is correct
2 Correct 28 ms 3544 KB Output is correct
3 Correct 28 ms 3732 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 820 KB Output is correct
10 Correct 1 ms 852 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 37 ms 19924 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 34 ms 19416 KB Output is correct
16 Correct 31 ms 19848 KB Output is correct
17 Correct 32 ms 17552 KB Output is correct
18 Correct 24 ms 14656 KB Output is correct
19 Correct 29 ms 18996 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 820 KB Output is correct
10 Correct 1 ms 852 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 37 ms 19924 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 34 ms 19416 KB Output is correct
16 Correct 31 ms 19848 KB Output is correct
17 Correct 32 ms 17552 KB Output is correct
18 Correct 24 ms 14656 KB Output is correct
19 Correct 29 ms 18996 KB Output is correct
20 Correct 33 ms 18600 KB Output is correct
21 Correct 35 ms 19936 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 29 ms 15360 KB Output is correct
24 Correct 35 ms 18608 KB Output is correct
25 Correct 26 ms 15700 KB Output is correct
26 Correct 33 ms 19812 KB Output is correct
27 Correct 34 ms 18484 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 820 KB Output is correct
10 Correct 1 ms 852 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 37 ms 19924 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 34 ms 19416 KB Output is correct
16 Correct 31 ms 19848 KB Output is correct
17 Correct 32 ms 17552 KB Output is correct
18 Correct 24 ms 14656 KB Output is correct
19 Correct 29 ms 18996 KB Output is correct
20 Correct 33 ms 18600 KB Output is correct
21 Correct 35 ms 19936 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 29 ms 15360 KB Output is correct
24 Correct 35 ms 18608 KB Output is correct
25 Correct 26 ms 15700 KB Output is correct
26 Correct 33 ms 19812 KB Output is correct
27 Correct 34 ms 18484 KB Output is correct
28 Correct 326 ms 196284 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 322 ms 193032 KB Output is correct
31 Correct 264 ms 159948 KB Output is correct
32 Correct 263 ms 161388 KB Output is correct
33 Correct 318 ms 196384 KB Output is correct
34 Correct 326 ms 192212 KB Output is correct

Subtask #8
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 820 KB Output is correct
10 Correct 1 ms 852 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Incorrect 1 ms 596 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 720 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 820 KB Output is correct
10 Correct 1 ms 852 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Incorrect 1 ms 596 KB Output isn't correct
14 Halted 0 ms 0 KB -