Submission #224721

#	Time	Username	Problem	Language	Result	Execution time	Memory
224721		Haunted_Cpp	Solar Storm (NOI20_solarstorm)	C++17	62 / 100	2090 ms	48376 KiB

SolarStorm

#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
#include <cassert>
 
typedef long long i64;
using namespace std;

const int N = 1e6 + 5;

i64 dist [N], valor [N], jump [N];

vector<i64> sum;
vector<i64> dp;

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, s;
  i64 k;
  cin >> n >> s >> k;
  sum.resize(n);
  dp.resize(n);
  for (int i = 0; i < n - 1; i++) {
    cin >> dist[i];
    if (i) {
      sum[i] = sum[i - 1] + dist[i - 1];
    }
  }
  for (int i = 1; i < n; i++) {
    sum[i] = sum[i - 1] + dist[i - 1];
  }
  for (int i = 0; i < n; i++) {
    cin >> valor[i];
    dp[i] += valor[i];
    if (i) dp[i] += dp[i - 1];
  }
  i64 mx = -1;
  int best_start = -1;
  for (int i = 0; i < n; i++) {
    jump[i] = upper_bound (sum.begin(), sum.end(), sum[i] + k) - sum.begin();
  }
  for (int i = 0; i < n; i++) {
    i64 cur = 0;
    int shield_left = s;
    for (int hi = i; hi < n && shield_left > 0; ) {
      int nxt = jump[hi] - 1;
      i64 esq = dp[nxt] - (hi - 1 >= 0 ? dp[hi - 1] : 0);
      cur += esq;
      int nxtnxt = jump[nxt] - 1;
      i64 dir = dp[nxtnxt] - dp[nxt];
      cur += dir;
      hi = nxtnxt + 1;
      --shield_left;
    }
    if (cur > mx) {
      mx = cur;
      best_start = i;
    }
  }
  vector<int> ans;
  int shield_left = s;
  for (int hi = best_start; hi < n && shield_left > 0; ) {
    int nxt = jump[hi] - 1;
    ans.emplace_back(nxt);
    int nxtnxt = jump[nxt] - 1;
    hi = nxtnxt + 1;
    --shield_left;
  }
  cout << (int) ans.size() << '\n';
  
  for (auto to : ans) cout << to + 1 << ' ';
  return 0;
}

• 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