Submission #206730

#	Time	Username	Problem	Language	Result	Execution time	Memory
206730		edsa	Bigger segments (IZhO19_segments)	C++14	13 / 100	6 ms	380 KiB

segments

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vii = vector<ii>;
const ll MOD = 998244353;
const int INF = 1e9+9;
const int MAXN = 1000006;

// This is a treap for searching max val of nodes with key < threshold
struct item {
    ll key;
    int prior;
    ii val, max;
    item * l, * r;
    item() { }
    item (ll key, int prior, ii val) : key(key),
      prior(prior), val(val), max(val), l(NULL), r(NULL) {}
};

void upd(item* t) {
    if (!t) return;
    t->max = t->val;
    if (t->l && t->l->val > t->val)
        t->max = t->l->val;
    if (t->r && t->r->val > t->val)
        t->max = t->r->val;
}

void split (item* t, ll key, item* & l, item* & r) {
    if (!t)
        l = r = NULL;
    else if (key < t->key)
        split (t->l, key, l, t->l),  r = t;
    else
        split (t->r, key, t->r, r),  l = t;
    upd(t);
}

void insert (item* & t, item* it) {
    if (!t)
        t = it;
    else if (it->prior > t->prior)
        split (t, it->key, it->l, it->r),  t = it;
    else
        insert (it->key < t->key ? t->l : t->r, it);
    upd(t);
}



int n, m, k, a[MAXN];
ll s[MAXN];
using il = pair<int, ll>;
il dp[MAXN];
item* root;

ii query(ll threshold) {
    // O(n) but simple implementation:
    // il ans = il(-1, 0);
    // for (int i = 0; i < MAXN; i++) {
    //     if (dp[i].second+s[i] <= threshold)
    //         ans = max(ans, il(dp[i].first, i));
    // }
    // return ans;

    ii ans(0, 0);
    item* it = root;
    while (it) {
        if (it->key > threshold) {
            it = it->l;
        } else {
            ans = max(ans, it->val);
            if (it->l)
                ans = max(ans, it->l->max);
            it = it->r;
        }
    }
    return ans;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        s[i+1] = s[i]+a[i];
    }

    dp[0] = il(0, 0);
    root = new item(0, rng(), il(0, 0));
    for (int i = 1; i <= n; i++) {
        ii maxi = query(s[i]);
        // cerr << i << ": " << maxi.first << " " << maxi.second << endl;
        // if (maxi.first != -1) {
            dp[i].first = maxi.first+1;
            dp[i].second = s[i] - s[maxi.second];
        // } else {
        //     maxi.first = dp[i-1].first;
        //     maxi.second = dp[i-1].second + a[i-1];
        // }
        insert(root, new item(dp[i].second+s[i], rng(), ii(dp[i].first, i)));
        // cerr << dp[i].first << " " << dp[i].second << endl;
    }
    cout << dp[n].first << endl;
}

• Subtask 1: 13 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27