oj.uz

Submission #677367

# Submission time Handle Problem Language Result Execution time Memory
677367 2023-01-03T06:03:59 Z penguin133 Solar Storm (NOI20_solarstorm) C++17
8 / 100
 271 ms 83768 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];
		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 = n, 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 = 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;
		}
		//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:96:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   96 | main(){
      | ^~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 60776 KB Output is correct
2 Incorrect 124 ms 38740 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

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

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 226 ms 65888 KB Output is correct
2 Correct 118 ms 40772 KB Output is correct
3 Correct 124 ms 43332 KB Output is correct
4 Correct 180 ms 60772 KB Output is correct
5 Correct 208 ms 59076 KB Output is correct
6 Correct 201 ms 62252 KB Output is correct
7 Correct 271 ms 83768 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 3 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 3 ms 852 KB Output is correct
7 Correct 2 ms 956 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Incorrect 2 ms 724 KB Output isn't correct
10 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 3 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 3 ms 852 KB Output is correct
7 Correct 2 ms 956 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Incorrect 2 ms 724 KB Output isn't correct
10 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 3 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 3 ms 852 KB Output is correct
7 Correct 2 ms 956 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Incorrect 2 ms 724 KB Output isn't correct
10 Halted 0 ms 0 KB -