제출 #887044

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
887044		vjudge1	Solar Storm (NOI20_solarstorm)	C++14	36 / 100	2051 ms	45648 KiB

SolarStorm

#include<bits/stdc++.h>

using namespace std;

#define int long long

const int N=1e6+1;
int n, s, k, d[N], pos[N], v[N], nxt[N], pf[N];

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n >> s >> k;
   for (int i=1; i<n; ++i) cin >> d[i], pos[i+1]=pos[i]+d[i];
   for (int i=1; i<=n; ++i) cin >> v[i];
   partial_sum(v, v+n+1, pf);
   if (k==1 && *max_element(d+1, d+n)==2 && *min_element(d+1, d+n)==2){
      pair<int, int> ans={-1, -1};
      for (int i=1; i<=n; ++i){
         int j=min(n, i+s-1);
         ans=max(ans, {pf[j]-pf[i-1], i});
      }
      int i=ans.second, j=min(n, i+s-1);
      cout << (j-i+1) << '\n';
      for (int t=i; t<=j; ++t) cout << t << ' ';
      return 0;
   }
   pair<int, int> ans={-1, -1};
   for (int i=1; i<=n; ++i){
      int cur=i, cnt=s;
      while (cur!=n+1 && cnt--){
         int it=upper_bound(pos+1, pos+n+1, pos[cur]+k)-pos-1;
         int it2=upper_bound(pos+1, pos+n+1, pos[it]+k)-pos-1;
         cur=it2+1;
      }
      ans=max(ans, {pf[cur-1]-pf[i-1], i});
   }
   vector<int> res;
   int cur=ans.second, cnt=s;
   while (cur!=n+1 && cnt--){
      int it=upper_bound(pos+1, pos+n+1, pos[cur]+k)-pos-1;
      res.push_back(it);
      int it2=upper_bound(pos+1, pos+n+1, pos[it]+k)-pos-1;
      cur=it2+1;
   }
   cout << res.size() << '\n';
   for (int i:res) cout << i << ' ';
   return 0;
}

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