제출 #677353

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
677353		penguin133	Solar Storm (NOI20_solarstorm)	C++17	28 / 100	241 ms	262144 KiB

SolarStorm

#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];

void solve(){
	cin >> n >> s >> k;
	int dp[n+1][s+1] = {0};
	pi pre[n+1][s+1];
	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<=s;i++)dp[0][i] = 0;
	for(int i=1;i<=n;i++)dp[i][0] = 0;
	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;
		}
		for(int j=1;j<=s;j++){
			dp[i][j] = dp[i][j-1], pre[i][j] = {i, i};
			if(dp[ans2-1][j-1] + X[i] - X[ans2-1] > dp[i][j])dp[i][j] = dp[ans2-1][j-1] + X[i] - X[ans2-1], pre[i][j] = {ans2-1, ans};
			//cout << dp[i][j] << " ";
		}
		//cout << '\n';
	}
	int in = 0, mx = 0;
	for(int i=1;i<=n;i++)if(dp[i][s] > mx)mx = dp[i][s], in = i;
	//cout << mx << " " << in << '\n';
	pi bt = pre[in][s];
	int lol = s;
	cout << s << '\n';
	while(lol){
		cout << bt.se << ' ';
		bt = pre[bt.fi][--lol];
	}
}

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();
	}
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 10 / 10
• Subtask 2: 7 / 7
• Subtask 3: 11 / 11
• Subtask 4: 0 / 8
• Subtask 5: 0 / 18
• Subtask 6: 0 / 16
• Subtask 7: 0 / 30