oj.uz

Submission #693060

# Submission time Handle Problem Language Result Execution time Memory
693060 2023-02-02T10:25:01 Z zeroesandones Solar Storm (NOI20_solarstorm) C++17
8 / 100
 185 ms 31680 KB 
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;

#define FOR(i, j, k) for (ll i = j; i < (ll) k; ++i)
#define FORD(i, j, k) for (ll i = j; i >= (ll) k; --i)
#define nl "\n"
#define sp " "

#define all(x) (x).begin(), (x).end()
#define sc second
#define fr first
#define pb emplace_back

void solve()
{
    ll n, s, k;
    cin >> n >> s >> k;

    ll d[n - 1];
    FOR(i, 0, n - 1)
        cin >> d[i];

    ll a[n];
    FOR(i, 0, n)
        cin >> a[i];

    ll psum[n] = {};
    psum[0] = a[0];
    FOR(i, 1, n)
        psum[i] = psum[i - 1] + a[i];

    pi ans = {0, 0};
    for(int i = 0; i < n; ++i) {
        // modules [i - s, i] will be protected
        ll right = i + s - 1;
        if(right >= n) break;
        ll curr = psum[right] - (i == 0 ? 0 : psum[i - 1]);
        if(curr > ans.fr) {
            ans = {curr, i};
        }
    }

    vi pro;
    for(int i = 0; i < s; ++i) {
        pro.pb(ans.sc + i + 1);
    }
    cout << pro.size() << nl;
    for(auto i : pro)
        cout << i << sp;
    cout << nl;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    ll t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 2 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 20332 KB Output is correct
2 Incorrect 73 ms 13024 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 2 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 28392 KB Output is correct
2 Correct 71 ms 12544 KB Output is correct
3 Correct 67 ms 13024 KB Output is correct
4 Correct 96 ms 18756 KB Output is correct
5 Correct 101 ms 18132 KB Output is correct
6 Correct 107 ms 19232 KB Output is correct
7 Correct 185 ms 31680 KB Output is correct

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 2 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 2 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 2 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -