Submission #1136799

#	Time	Username	Problem	Language	Result	Execution time	Memory
1136799		Roumak77	Solar Storm (NOI20_solarstorm)	C++20	8 / 100	111 ms	27584 KiB

SolarStorm

#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <limits>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
using namespace std;


/*
 * Subtask Marks Additional Constraints
    1) S = 1, N ≤ 10^4, K ≤ 10^9, di ≤ 10^5 for all 1 ≤ i ≤ N − 1, vi ≤ 10^5, for all 1 ≤ i ≤ N -> 10 points
    2) S = 1, di = 1 for all 1 ≤ i ≤ N − 1 -> 7 points
    3) S = 1 -> 11 points
    4) K = 1, di = 2 for all 1 ≤ i ≤ N − 1 -> 8 points
    5) N ≤ 104 -> 18 points
    6) S ≤ 50 -> 16 points
    7) No constraints -> 30 points


    Total = 0

 */


using ll = long long;

void solve(){


    ll n, s, k;
    cin >> n >> s >> k;
    vector<ll> list_n(n - 1, 0);
    for(ll i = 0; i < n - 1; i++){
        cin >> list_n[i];
    }

    vector<ll> list_k(n);
    vector<ll> pref(n + 1, 0);
    for(ll i = 0; i < n; i++){
        cin >> list_k[i];
        pref[i + 1] = pref[i] + list_k[i];
    }

    ll curr_max = pref[s];
    ll max_idx = 1;

    for(ll i = 0; i < n; i++){
        if(pref[min(n, i + s)] - pref[i] > curr_max){
            max_idx = i + 1;
            curr_max = pref[min(n, i + s)] - pref[i];
        }
    }

    cout << s << endl;
    for(ll i = 0; i < s; i++){
        cout << min(n, max_idx) << " ";
        max_idx++;
    }





}

bool single = true;

signed main(){

    ios_base::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);

    ll t = 1;
    if(!single) cin >> t;

    while(t--){
        solve();
    }
}

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