제출 #1279580

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1279580		aryan	Solar Storm (NOI20_solarstorm)	C++20	62 / 100	2095 ms	31396 KiB

SolarStorm

#include<bits/stdc++.h>
using namespace std;

using i64 = long long;


int main(){

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n,s;
    i64 k;
    cin >> n >> s >> k;
    vector<i64> d(n);
    for(int i = 1;i < n;i++){
        cin >> d[i];
        d[i] += d[i - 1];
    }
    vector<int> v(n);
    vector<i64> pref(n);
    for(int i = 0;i < n;i++){
        cin >> v[i];
        pref[i] = v[i];
        if(i) pref[i] += pref[i - 1];
    }

    vector<int> best(n); // what is the best node top put sheild if we want to take node i
    vector<int> nx(n); // next empty node if we take index i
    for(int i = 0;i < n;i++){
        int ind = upper_bound(d.begin(),d.end(),d[i] + k) - d.begin();
        nx[i] = ind;
        ind --;
        best[i] = ind;
    }

    auto S = [&](int l,int r){
        if(l > r) return 0LL;
        return pref[r] - (l ? pref[l - 1] : 0);
    };

    i64 ans = -1;
    vector<int> fn;
    for(int i = 0;i < n;i++){
        int cur = i;
        i64 tot = 0;
        int left = s;
        vector<int> res;
        while(cur < n && left > 0){
           int sh = best[cur];
           int af = nx[sh];
           res.push_back(sh);
           tot += S(cur,af - 1);
           cur = af;    
           left --;
        }
        if(tot > ans){
            ans = tot;
            fn = res;
        }
    }
    cout << (int) fn.size() << '\n';
    for(int &e : fn) cout << e + 1 << " ";
    cout << '\n';
}

• 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