oj.uz

Submission #485634

# Submission time Handle Problem Language Result Execution time Memory
485634 2021-11-08T17:31:33 Z 5enpa1 Safety (NOI18_safety) C++17
71 / 100
 262 ms 26716 KB 
#include <bits/stdc++.h>

#define int long long 
#define vec vector 
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define sq(x) (x)*(x)
#define fast_io ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using namespace std;
typedef pair<int,int> PII;
int f(int k, int b, int x){
	return k*x+b;
}
int k, x, b, y, sum;
// const int M = 1000;
// const int C = 200;
signed main(){
	//ifstream cin("input.txt");
	//ofstream cout("output.txt");
	fast_io;
	int n, h;
	cin >> n >> h;
	vec < int > q(n);
	vec < int > w;
	for(auto &i: q) cin >> i, sum += i;
	// vec < vec < int > > dp(n, vec < int > (M, 1e18));
	// for(int i = 0; i < M; ++i)
	// 	dp[0][i] = abs(i-q[0]);
	// for(int i = 1; i < n; ++i){
	// 	for(int j = 0; j < M; ++j){
	// 		for(int k = max(0LL, j-h); k <= min(M-1, j+h); ++k)
	// 			dp[i][j] = min(dp[i-1][k]+abs(j-q[i]), dp[i][j]);
	// 	}
	// }
	// for(int k = 0; k < n; ++k){
	// 	auto i = dp[k];
	// 	int r = i[1]-i[0];
	// 	for(int j = 2; j < M; ++j){
	// 		while(i[j]-i[j-1] != r){
	// 			cout << j-1 << " ";
	// 			r++;
	// 		}
	// 	}
	// 	cout << "\n";
	// }
	// cout << "\n";
	multiset < int > one;
	multiset < int > two;
	int left = 0;
	int right = 0;
	for(int i = 0; i < n; ++i){
		one.insert(q[i]-left);
		one.insert(q[i]-left);
		while(sz(one) > sz(two)){
			auto it = one.end();
			it--;
			int adder = *it;
			adder -= right;
			adder += left;
			two.insert(adder);
			one.erase(one.find(*it));
		}
		while(sz(one) < sz(two)){
			int adder = *two.begin();
			adder += right;
			adder -= left;
			one.insert(adder);
			two.erase(two.find(adder));
		}
		auto it = one.end();
		it--;
		while((*it)+left > (*two.begin())+right){
			two.insert(*it+left-right);
			one.erase(it);
			one.insert(*two.begin()+right-left);
			two.erase(two.begin());
		}		
		// cout << q[i] << " :: ";
		// for(auto &j: one) cout << j+left << " ";
		// for(auto &j: two) cout << j+right << " ";
		// cout << "\n";
		left -= h;
		right += h;
	}
	left += h;
	right -= h;
	vec < int > fin;
	for(auto &i: one) fin.pb(i+left);
	for(auto &i: two) fin.pb(i+right);
	// for(auto &i: fin) cout << i << " ";
	// cout << "\n";
	b = -sum;
	for(int i = 0; i < n; ++i)
		b -= i*h;
	k = n;
	int ans = 1e18;
	for(int i = sz(fin)-1; i >= 0; --i){
		x = fin[i];
		y = k*x+b;
		ans = min(ans, y);
		k--;
		b = y-k*x;
	}
	cout << ans;
	return 0;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
4.0 / 4.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 19128 KB Output is correct
2 Correct 223 ms 25436 KB Output is correct
3 Correct 262 ms 26260 KB Output is correct

Subtask #5
6.0 / 6.0

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

Subtask #6
11.0 / 11.0

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

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 5 ms 972 KB Output is correct
29 Correct 3 ms 844 KB Output is correct
30 Correct 3 ms 972 KB Output is correct
31 Correct 3 ms 844 KB Output is correct
32 Correct 4 ms 844 KB Output is correct
33 Correct 3 ms 972 KB Output is correct
34 Correct 3 ms 964 KB Output is correct

Subtask #8
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 5 ms 972 KB Output is correct
35 Correct 3 ms 844 KB Output is correct
36 Correct 3 ms 972 KB Output is correct
37 Correct 3 ms 844 KB Output is correct
38 Correct 4 ms 844 KB Output is correct
39 Correct 3 ms 972 KB Output is correct
40 Correct 3 ms 964 KB Output is correct
41 Correct 6 ms 972 KB Output is correct
42 Correct 4 ms 844 KB Output is correct
43 Correct 5 ms 972 KB Output is correct
44 Correct 5 ms 972 KB Output is correct
45 Correct 4 ms 1032 KB Output is correct
46 Correct 3 ms 904 KB Output is correct

Subtask #9
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 157 ms 19128 KB Output is correct
20 Correct 223 ms 25436 KB Output is correct
21 Correct 262 ms 26260 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 308 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 5 ms 972 KB Output is correct
38 Correct 3 ms 844 KB Output is correct
39 Correct 3 ms 972 KB Output is correct
40 Correct 3 ms 844 KB Output is correct
41 Correct 4 ms 844 KB Output is correct
42 Correct 3 ms 972 KB Output is correct
43 Correct 3 ms 964 KB Output is correct
44 Correct 6 ms 972 KB Output is correct
45 Correct 4 ms 844 KB Output is correct
46 Correct 5 ms 972 KB Output is correct
47 Correct 5 ms 972 KB Output is correct
48 Correct 4 ms 1032 KB Output is correct
49 Correct 3 ms 904 KB Output is correct
50 Correct 251 ms 26716 KB Output is correct
51 Correct 250 ms 22888 KB Output is correct
52 Incorrect 155 ms 22152 KB Output isn't correct
53 Halted 0 ms 0 KB -