oj.uz

Submission #684704

# Submission time Handle Problem Language Result Execution time Memory
684704 2023-01-22T11:01:08 Z penguin133 Safety (NOI18_safety) C++17
100 / 100
 180 ms 22492 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
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif

int S[200005], n, h;
void solve(){
	cin >> n >> h;
	for(int i=1;i<=n;i++)cin >> S[i];
	
	multiset <int> lft, rgt;
	int lft_os = 0, rgt_os = 0, ans = 0;
	for(int i=1;i<=n;i++){
		if(i != 1)rgt_os += h;
		//if(i != 1)lft_os += (R[i] - L[i]);	
		int rmost = (lft.empty() ? -1e18 : *--lft.end() - lft_os);
		int lmost = (rgt.empty() ? 1e18 : *rgt.begin() + rgt_os);
		//cerr << rmost << " " << lmost << '\n';
		assert(rmost <= lmost);
		if(S[i] < rmost){
			lft.insert(S[i] + lft_os);
			lft.insert(S[i] + lft_os);
			int rmost2 = (lft.empty() ? -1e18 : *--lft.end() - lft_os);
			int lmost2 = (rgt.empty() ? 1e18 : *rgt.begin() + rgt_os);
			//cout << min(abs(R[i] - lmost2), abs(R[i] - rmost2)) << '\n';
			ans += min(abs(S[i] - lmost2), abs(S[i] - rmost2));
			lft.erase(--lft.end());
			assert(rmost2 - rgt_os <= *rgt.begin());
			rgt.insert(rmost2 - rgt_os);
		}
		else if(S[i] > lmost){
			rgt.insert(S[i] - rgt_os);
			rgt.insert(S[i] - rgt_os);
			int lmost2 = (rgt.empty() ? 1e18 : *rgt.begin() + rgt_os);
			int rmost2 = (lft.empty() ? -1e18 : *--lft.end() - lft_os);
			ans += min(abs(S[i] - lmost2), abs(S[i] - rmost2));
			//cout << min(abs(R[i] - lmost2), abs(R[i] - rmost2)) << '\n';
			rgt.erase(rgt.begin());
			assert(lmost2 + lft_os >= *--lft.end());
			lft.insert(lmost2 + lft_os);
		}
		else{
			lft.insert(S[i] + lft_os);
			rgt.insert(S[i] - rgt_os);
		}
		lft_os += h;	
		/*
		int rmost2 = (lft.empty() ? -1e18 : *--lft.end() - lft_os);
		int lmost2 = (rgt.empty() ? 1e18 : *rgt.begin() + rgt_os);
		ans += min(abs(R[i] - lmost2), abs(R[i] - rmost2));
		*/
	}
	cout << ans << '\n';
}

/*
 * so let dp(i, j) represent minimum cost to connect first i rows, with right end of rectangle i being at j
 * let range of rectangle i - 1 be x,  range of rect i be y
 * dp(i, j) = min(dp(i-1, k) such that j - y <= k <= j + x) + |j - R[i]|
 * 
 * we have some offset
 */
main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

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

Subtask #1
3.0 / 3.0

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

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 14916 KB Output is correct
2 Correct 180 ms 21088 KB Output is correct
3 Correct 167 ms 21976 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 3 ms 852 KB Output is correct
29 Correct 2 ms 744 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 2 ms 724 KB Output is correct
32 Correct 2 ms 724 KB Output is correct
33 Correct 3 ms 852 KB Output is correct
34 Correct 2 ms 748 KB Output is correct

Subtask #8
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 328 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 3 ms 852 KB Output is correct
35 Correct 2 ms 744 KB Output is correct
36 Correct 2 ms 852 KB Output is correct
37 Correct 2 ms 724 KB Output is correct
38 Correct 2 ms 724 KB Output is correct
39 Correct 3 ms 852 KB Output is correct
40 Correct 2 ms 748 KB Output is correct
41 Correct 4 ms 852 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 2 ms 852 KB Output is correct
44 Correct 2 ms 852 KB Output is correct
45 Correct 2 ms 724 KB Output is correct
46 Correct 2 ms 760 KB Output is correct

Subtask #9
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 328 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 112 ms 14916 KB Output is correct
20 Correct 180 ms 21088 KB Output is correct
21 Correct 167 ms 21976 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 3 ms 852 KB Output is correct
38 Correct 2 ms 744 KB Output is correct
39 Correct 2 ms 852 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 2 ms 724 KB Output is correct
42 Correct 3 ms 852 KB Output is correct
43 Correct 2 ms 748 KB Output is correct
44 Correct 4 ms 852 KB Output is correct
45 Correct 3 ms 724 KB Output is correct
46 Correct 2 ms 852 KB Output is correct
47 Correct 2 ms 852 KB Output is correct
48 Correct 2 ms 724 KB Output is correct
49 Correct 2 ms 760 KB Output is correct
50 Correct 178 ms 22492 KB Output is correct
51 Correct 146 ms 18672 KB Output is correct
52 Correct 85 ms 18092 KB Output is correct
53 Correct 100 ms 20876 KB Output is correct
54 Correct 113 ms 21500 KB Output is correct
55 Correct 88 ms 18248 KB Output is correct
56 Correct 100 ms 20140 KB Output is correct
57 Correct 89 ms 18504 KB Output is correct
58 Correct 88 ms 15568 KB Output is correct
59 Correct 104 ms 20508 KB Output is correct