제출 #677363

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
677363		penguin133	Solar Storm (NOI20_solarstorm)	C++17	62 / 100	2073 ms	51736 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];
pi pre[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};
	}
	vector<int> fin;
	int mx =0 ;
	for(int i=1;i<=n;i++){
		int bt = i, rem = s;
		vector<int> v;
		while(rem && bt){
			rem--;
			v.push_back(pre[bt].se);
			bt = pre[bt].fi;
			if(!bt || !rem){
				if(X[i] - X[bt] > mx)mx = X[i] - X[bt], fin = v;
			}
		}
	}
	//cout << mx << '\n';
	cout << (int)fin.size() << '\n';
	for(auto i : fin)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();
	}
}

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

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

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