Submission #1284420

#	Time	Username	Problem	Language	Result	Execution time	Memory
1284420		cheska	Solar Storm (NOI20_solarstorm)	C++20	0 / 100	240 ms	327680 KiB

SolarStorm

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define ppii pair<int, pii> 
#define tiii tuple<int, int, int>
#define g0 get<0>
#define g1 get<1>
#define g2 get<2>
#define f first
#define s second
#define pb push_back
const int N = 5e3+5;
const int MOD = 1e9+7;
signed main() {
  //  freopen("in.in", "r", stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, s, k; cin >> n >> s >> k;
    vector<int> a(n);
    for (int i = 1; i < n; i++) {
        int j; cin >> j; a[i] = a[i-1]+j;
    }
    vector<int> v(n), psv(n);
    for (int i = 0; i < n; i++) cin >> v[i];
    psv[0] = v[0];
    for (int i = 1; i < n; i++) {
        psv[i] = psv[i-1]+v[i];
    }
    vector<vector<pii>> ans(n+1, vector<pii>(22));
    vector<int> l(n), r(n);
    for (int i = 0; i < n; i++) {
        r[i] = upper_bound(a.begin(), a.end(), a[i]+k)-a.begin();
        l[i] = lower_bound(a.begin(), a.end(), a[i]-k)-a.begin()-1;
        if (l[i] >= 0) ans[i][0].s = psv[i]-psv[l[i]];
        else ans[i][0].s = psv[i];
        ans[i][0].f = r[i];
    }
    ans[n][0].f = n;
    for (int i = 1; (1<<i) <= s; i++) {
        for (int j = 0; j < n; j++) {
            ans[j][i].f = ans[ans[j][i-1].f][i-1].f;
            int idk = ans[j][i].f; if (idk == n) idk--;
            if (l[j] >= 0) ans[j][i].s =  psv[idk]-psv[l[j]];
            else ans[j][i].s = psv[idk];
        }
    }
    vector<int> ans2(n);
    for (int i = 0; i < n; i++) {
        int temp = i;
        for (int j = 0; (1<<j) <= s; j++) {
            if (s&(1<<j)) {
                ans2[i] += ans[temp][j].s;
                temp = ans[temp][j].f;
            }
        }
    }
    int i = max_element(ans2.begin(), ans2.end())-ans2.begin();
    vector<int> v2;
    while (s-- && i != n) {
        v2.pb(i);
        i = r[i];
    }
    cout << v2.size() << '\n';
    for (int j : v2) cout << j+1 << " ";
}

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