Submission #687573

#	Time	Username	Problem	Language	Result	Execution time	Memory
687573		ksjsjsjsjsjsjs	Solar Storm (NOI20_solarstorm)	C++14	100 / 100	548 ms	122508 KiB

SolarStorm

#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define ers erase
#define bg begin
#define ed end
#define ft front
#define bk back
#define mtp make_tupl
#define sz(x) (int)(x).size()
#define all(x) (x).bg(), (x).ed()
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define str string
#define pi pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pi>
#define vpll vector<pll>
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { WHILE(b) { a %= b; swap(a, b); } return a; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
const int N = 1e6 + 5;
int n, s, nxt[N][20], s1[N];
ll k, d[N], v[N];
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//    freopen(file".inp", "r", stdin);
//    freopen(file".out", "w", stdout);
    cin >> n >> s >> k;
    FOR(i, 2, n) {
        cin >> d[i];
        d[i] += d[i - 1];
    }
    FOR(i, 1, n) {
        cin >> v[i];
        v[i] += v[i - 1];
    }
    FOR(i, 1, n) {
        int l = i, r = n, ans = -1;
        WHILE(l <= r) {
            int mid = l + (r - l) / 2;
            if (d[mid] - d[i] <= k) {
                ans = mid;
                l = mid + 1;
            }
            else r = mid - 1;
        }
        int pos = ans; l = ans; r = n; ans = -1;
        s1[i] = pos;
        WHILE(l <= r) {
            int mid = l + (r - l) / 2;
            if (d[mid] - d[pos] <= k) {
                ans = mid;
                l = mid + 1;
            }
            else r = mid - 1;
        }
        nxt[i][0] = ans + 1;
    }
    ll rs = 0;
    int ap = 0;
    FOR(j, 1, 19)
    FOR(i, 1, n)
        nxt[i][j] = (nxt[i][j - 1] > n? nxt[i][j - 1] : nxt[nxt[i][j - 1]][j - 1]);
    FOR(i, 1, n) {
        int pos = i;
        FRN(j, 20)
            if (s & (1 << j))
                pos = (pos > n? pos : nxt[pos][j]);
        if (rs < v[pos - 1] - v[i - 1]) {
            rs = v[pos - 1] - v[i - 1];
            ap = i;
        }
    }
    vi a;
    WHILE(s-- && ap <= n) {
        a.pb(s1[ap]);
        ap = nxt[ap][0];
    }
    cout << sz(a) << '\n';
    EACH(i, a) cout << i << (i == a.bk()? "\n" : " ");
//    cerr << "\nTime: " << setprecision(5) << fixed << (ldb)clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

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