제출 #693053

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
693053		saayan007	Solar Storm (NOI20_solarstorm)	C++17	28 / 100	225 ms	40940 KiB

SolarStorm

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

using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pi>;
using vpl = vector<pl>;

#define fur(i, a, b) for(ll i = a; i <= (ll) b; ++i)
#define ruf(i, a, b) for(ll i = a; i >= (ll) b; --i)
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define nl "\n"

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll n, s, k;
    cin >> n >> s >> k;
    ll d[n];
    fur(i, 1, n - 1) {
        cin >> d[i];
    }

    ll v[n + 1];
    fur(i, 1, n) {
        cin >> v[i];
    }

    ll x[n + 1];
    x[1] = 0;
    fur(i, 2, n) {
        x[i] = x[i - 1] + d[i - 1];
    }
    // fur(i, 1, n) {
        // cout << x[i] << ' ';
    // }
    // cout << nl;
    // fur(i, 1, n) {
        // cout << v[i] << ' ';
    // }
    // cout << nl;

    ll res = 0;
    ll best = 0;
    ll sum[n + 1];
    sum[0] = 0;
    fur(i, 1, n) {
        sum[i] = v[i] + sum[i - 1];
    }
    fur(i, 1, n) {
        ll r = upper_bound(x + 1, x + n + 1, x[i] + k) - x - 1;
        ll l = lower_bound(x + 1, x + n + 1, x[i] - k) - x - 1;
        if(sum[r] - sum[l] > res) {
            res = sum[r] - sum[l];
            best = i;
        }
    }
    cout << 1 << nl << best << nl;
}

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