oj.uz

Submission #676303

# Submission time Handle Problem Language Result Execution time Memory
676303 2022-12-30T08:34:25 Z penguin133 Safety (NOI18_safety) C++17
35 / 100
 605 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#define getchar_unlocked _getchar_nolock

int n, h, S[300005];

int dp[5005][5005];
deque<pi>dq;
void solve(){
	cin >> n >> h;
	for(int i=1;i<=n;i++)cin >> S[i];
	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();
			pi 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});
			}
		}
	}
	int ans = 1e18;
	for(int i=0;i<=5000;i++)ans = min(ans, dp[n][i]);
	cout << ans;
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	while(tc--){
		solve();
	}
}

Compilation message

safety.cpp:40:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   40 | main(){
      | ^~~~

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 1 ms 596 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 708 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 724 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 852 KB Output is correct
2 Correct 1 ms 852 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 1 ms 848 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
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 605 ms 262144 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

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 1 ms 596 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 708 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 1 ms 848 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 34 ms 19904 KB Output is correct
14 Correct 35 ms 19236 KB Output is correct
15 Correct 40 ms 19336 KB Output is correct
16 Correct 34 ms 19820 KB Output is correct
17 Correct 32 ms 17536 KB Output is correct
18 Correct 26 ms 14644 KB Output is correct
19 Correct 33 ms 19024 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 1 ms 596 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 708 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 1 ms 848 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 34 ms 19904 KB Output is correct
14 Correct 35 ms 19236 KB Output is correct
15 Correct 40 ms 19336 KB Output is correct
16 Correct 34 ms 19820 KB Output is correct
17 Correct 32 ms 17536 KB Output is correct
18 Correct 26 ms 14644 KB Output is correct
19 Correct 33 ms 19024 KB Output is correct
20 Correct 36 ms 18604 KB Output is correct
21 Correct 38 ms 19904 KB Output is correct
22 Correct 31 ms 16584 KB Output is correct
23 Correct 30 ms 15308 KB Output is correct
24 Correct 35 ms 18496 KB Output is correct
25 Correct 30 ms 15680 KB Output is correct
26 Correct 37 ms 19924 KB Output is correct
27 Correct 36 ms 18616 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 1 ms 596 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 708 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 1 ms 848 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 34 ms 19904 KB Output is correct
14 Correct 35 ms 19236 KB Output is correct
15 Correct 40 ms 19336 KB Output is correct
16 Correct 34 ms 19820 KB Output is correct
17 Correct 32 ms 17536 KB Output is correct
18 Correct 26 ms 14644 KB Output is correct
19 Correct 33 ms 19024 KB Output is correct
20 Correct 36 ms 18604 KB Output is correct
21 Correct 38 ms 19904 KB Output is correct
22 Correct 31 ms 16584 KB Output is correct
23 Correct 30 ms 15308 KB Output is correct
24 Correct 35 ms 18496 KB Output is correct
25 Correct 30 ms 15680 KB Output is correct
26 Correct 37 ms 19924 KB Output is correct
27 Correct 36 ms 18616 KB Output is correct
28 Correct 353 ms 196284 KB Output is correct
29 Correct 295 ms 165440 KB Output is correct
30 Correct 362 ms 193140 KB Output is correct
31 Correct 308 ms 159996 KB Output is correct
32 Correct 288 ms 161400 KB Output is correct
33 Correct 361 ms 196396 KB Output is correct
34 Correct 372 ms 192208 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 1 ms 596 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 708 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 1 ms 848 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 1 ms 596 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 708 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 1 ms 848 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 -