oj.uz

Submission #677369

# Submission time Handle Problem Language Result Execution time Memory
677369 2023-01-03T06:10:15 Z penguin133 Solar Storm (NOI20_solarstorm) C++17
36 / 100
 258 ms 78784 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 n, s, k, A[1000005], B[1000005], P[1000005], X[1000005], dp[1000005];
pi pre[1000005];
pi p[1000005];

void solve(){
	cin >> n >> s >> k;
	for(int i=2;i<=n;i++)cin >> A[i], P[i] = P[i-1] + A[i];
	for(int i=1;i<=n;i++)cin >> B[i], X[i] = X[i-1] + B[i];
	for(int i=1;i<=n;i++){
		int lo = 1, hi = i, ans = hi;
		while(lo <= hi){
			int mid = (lo + hi) >> 1;
			if(P[i] - P[mid] <= k)ans = mid, hi = mid - 1;
			else lo = mid + 1;
		}
		lo = 1, hi = ans;
		int ans2 = ans;
		while(lo <= hi){
			int mid = (lo + hi) >> 1;
			if(P[ans] - P[mid] <= k)ans2 = mid, hi = mid - 1;
			else lo = mid + 1;
		}
		pre[i] = {ans2 - 1, ans};
	}
	int bt = 1, rem = s - 1;
	while(rem && bt <= n){
		rem--;
		int lo = bt, hi = n, ans = lo;
		while(lo <= hi){
			int mid = (lo + hi) >> 1;
			if(P[mid] - P[bt] <= k)ans = mid, lo = mid + 1;
			else hi = mid - 1;
		}
		lo = ans, hi = n;
		int ans2 = ans;
		while(lo <= hi){
			int mid = (lo + hi) >> 1;
			if(P[mid] - P[ans] <= k)ans2 = mid, lo = mid + 1;
			else hi = mid - 1;
		}
		bt = ans2 + 1;
	}
	//cerr << bt << " ";
	vector<int> fin;
	int mx = 0, in = 0;
	for(int i=1;i<bt;i++){
		dp[i] = X[i];
		p[i] = {1, 0};
		if(dp[i] > mx)mx = dp[i], in = i;
	}
	p[0] = {1, 0};
	for(int i=bt;i<=n;i++){
		pi tmp = pre[i];
		//cout << pre[i].fi << " " << p[tmp.fi].fi << " " << p[tmp.fi].se << '\n';
		if(mx < dp[tmp.fi] - (X[p[tmp.fi].se] - X[p[tmp.fi].fi - 1]) + X[i] - X[tmp.fi])mx = dp[tmp.fi] - (X[p[tmp.fi].se] - X[p[tmp.fi].fi - 1]) + X[i] - X[tmp.fi], in = i;
		dp[i] = dp[tmp.fi] - (X[p[tmp.fi].se] - X[p[tmp.fi].fi - 1]) + X[i] - X[tmp.fi];
		int lo = p[tmp.fi].se + 1, hi = i, ans = lo;
		while(lo <= hi){
			int mid = (lo + hi) >> 1;
			if(P[mid] - P[p[tmp.fi].se + 1] <= k)ans = mid, lo = mid + 1;
			else hi = mid - 1;
		}
		lo = ans, hi = i;
		int ans2 = ans;
		while(lo <= hi){
			int mid = (lo + hi) >> 1;
			if(P[mid] - P[ans] <= k)ans2 = mid, lo = mid + 1;
			else hi = mid - 1;
		}
		//cout << dp[i] << " " << p[i].fi << " " << p[i].se << '\n';
		p[i] = {p[tmp.fi].se + 1, ans2};
	}
	bt = in, rem = s;
	vector<int> v;
	while(rem && bt){
		rem--;
		v.push_back(pre[bt].se);
		bt = pre[bt].fi;
	}
	//cout << mx << '\n';
	cout << (int)v.size() << '\n';
	for(auto i : v)cout << i << " ";
}

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

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 3 ms 980 KB Output is correct
11 Correct 3 ms 980 KB Output is correct
12 Correct 1 ms 596 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 60692 KB Output is correct
2 Correct 145 ms 38660 KB Output is correct
3 Correct 135 ms 41452 KB Output is correct
4 Correct 125 ms 45148 KB Output is correct
5 Correct 146 ms 52916 KB Output is correct
6 Correct 183 ms 70476 KB Output is correct
7 Correct 115 ms 46632 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 3 ms 980 KB Output is correct
11 Correct 3 ms 980 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 161 ms 60692 KB Output is correct
14 Correct 145 ms 38660 KB Output is correct
15 Correct 135 ms 41452 KB Output is correct
16 Correct 125 ms 45148 KB Output is correct
17 Correct 146 ms 52916 KB Output is correct
18 Correct 183 ms 70476 KB Output is correct
19 Correct 115 ms 46632 KB Output is correct
20 Correct 124 ms 38616 KB Output is correct
21 Correct 143 ms 47356 KB Output is correct
22 Correct 163 ms 56060 KB Output is correct
23 Correct 155 ms 57904 KB Output is correct
24 Correct 149 ms 52196 KB Output is correct
25 Correct 209 ms 52428 KB Output is correct
26 Correct 144 ms 38988 KB Output is correct
27 Correct 189 ms 50040 KB Output is correct
28 Correct 173 ms 49436 KB Output is correct
29 Correct 224 ms 64264 KB Output is correct
30 Correct 163 ms 52556 KB Output is correct
31 Correct 148 ms 46204 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 65824 KB Output is correct
2 Correct 107 ms 36244 KB Output is correct
3 Correct 108 ms 38604 KB Output is correct
4 Correct 155 ms 55756 KB Output is correct
5 Correct 139 ms 54072 KB Output is correct
6 Correct 144 ms 57280 KB Output is correct
7 Correct 258 ms 78784 KB Output is correct

Subtask #5
0 / 18.0

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

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 3 ms 980 KB Output is correct
11 Correct 3 ms 980 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 161 ms 60692 KB Output is correct
14 Correct 145 ms 38660 KB Output is correct
15 Correct 135 ms 41452 KB Output is correct
16 Correct 125 ms 45148 KB Output is correct
17 Correct 146 ms 52916 KB Output is correct
18 Correct 183 ms 70476 KB Output is correct
19 Correct 115 ms 46632 KB Output is correct
20 Correct 124 ms 38616 KB Output is correct
21 Correct 143 ms 47356 KB Output is correct
22 Correct 163 ms 56060 KB Output is correct
23 Correct 155 ms 57904 KB Output is correct
24 Correct 149 ms 52196 KB Output is correct
25 Correct 209 ms 52428 KB Output is correct
26 Correct 144 ms 38988 KB Output is correct
27 Correct 189 ms 50040 KB Output is correct
28 Correct 173 ms 49436 KB Output is correct
29 Correct 224 ms 64264 KB Output is correct
30 Correct 163 ms 52556 KB Output is correct
31 Correct 148 ms 46204 KB Output is correct
32 Correct 173 ms 61904 KB Output is correct
33 Correct 147 ms 47308 KB Output is correct
34 Incorrect 232 ms 64888 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 3 ms 980 KB Output is correct
11 Correct 3 ms 980 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 161 ms 60692 KB Output is correct
14 Correct 145 ms 38660 KB Output is correct
15 Correct 135 ms 41452 KB Output is correct
16 Correct 125 ms 45148 KB Output is correct
17 Correct 146 ms 52916 KB Output is correct
18 Correct 183 ms 70476 KB Output is correct
19 Correct 115 ms 46632 KB Output is correct
20 Correct 124 ms 38616 KB Output is correct
21 Correct 143 ms 47356 KB Output is correct
22 Correct 163 ms 56060 KB Output is correct
23 Correct 155 ms 57904 KB Output is correct
24 Correct 149 ms 52196 KB Output is correct
25 Correct 209 ms 52428 KB Output is correct
26 Correct 144 ms 38988 KB Output is correct
27 Correct 189 ms 50040 KB Output is correct
28 Correct 173 ms 49436 KB Output is correct
29 Correct 224 ms 64264 KB Output is correct
30 Correct 163 ms 52556 KB Output is correct
31 Correct 148 ms 46204 KB Output is correct
32 Correct 220 ms 65824 KB Output is correct
33 Correct 107 ms 36244 KB Output is correct
34 Correct 108 ms 38604 KB Output is correct
35 Correct 155 ms 55756 KB Output is correct
36 Correct 139 ms 54072 KB Output is correct
37 Correct 144 ms 57280 KB Output is correct
38 Correct 258 ms 78784 KB Output is correct
39 Correct 2 ms 980 KB Output is correct
40 Correct 3 ms 852 KB Output is correct
41 Incorrect 2 ms 828 KB Output isn't correct
42 Halted 0 ms 0 KB -