Submission #948716

#	Time	Username	Problem	Language	Result	Execution time	Memory
948716		MisterReaper	Sails (IOI07_sails)	C++17	0 / 100	603 ms	4948 KiB

sails

#include <bits/stdc++.h>
using i64 = long long;

constexpr int maxN = 1E5 + 5;

int tree[maxN * 4], lazy[maxN * 4];
void push(int node, int l, int r) {
    tree[node] += lazy[node] * (r - l + 1);
    if(l != r) {
        lazy[node * 2] += lazy[node];
        lazy[node * 2 + 1] += lazy[node];
    }
    lazy[node] = 0;
}

void update(int node, int l, int r, int ql, int qr, int v) {
    push(node, l, r);
    if(ql <= l && r <= qr) {
        lazy[node] += v;
        push(node, l, r);
        return;
    } else if(r < ql || qr < l) {
        return;
    }

    int mid = (l + r) / 2;
    update(node * 2, l, mid, ql, qr, v);
    update(node * 2 + 1, mid + 1, r, ql, qr, v);
    tree[node] = tree[node * 2] + tree[node * 2 + 1];
}
void update(int l, int r, int v = 1) { update(1, 1, maxN - 1, l, r, v); }

int query(int node, int l, int r, int ql, int qr) {
    push(node, l, r);
    if(ql <= l && r <= qr) {
        return tree[node];
    } else if(r < ql || qr < l) {
        return 0;
    }

    int mid = (l + r) / 2;
    int g1 = query(node * 2, l, mid, ql, qr);
    int g2 = query(node * 2 + 1, mid + 1, r, ql, qr);
    return g1 + g2;
}
int query(int l, int r) { return query(1, 1, maxN - 1, l, r); }

void solve() {
    int n;
    std::cin >> n;

    std::vector<std::pair<int, int>> v(n);
    for(int i = 0; i < n; i++) {
        std::cin >> v[i].first >> v[i].second;
    }

    std::sort(v.begin(), v.end());

    for(int i = 0; i < n; i++) {
        auto [h, c] = v[i];
        int g = query(h - c + 1, h - c + 1), f = 1;
        {
            int l = 1, r = h;
            while(l <= r) {
                int mid = (l + r) / 2;
                if(query(mid, mid) <= g) {
                    f = mid;
                    r = mid - 1;
                } else {
                    l = mid + 1;
                }
            }
        }

        int L = f;
        update(L, h);
        if(L == h - c + 1) {
            continue;
        }


        f = h + 1;
        {
            int l = 1, r = h;
            while(l <= r) {
                int mid = (l + r) / 2;
                if(query(mid, mid) < g) {
                    f = mid;
                    r = mid - 1;
                } else {
                    l = mid + 1;
                }
            }
        }

        int interval = h - L + 1;
        update(f - (interval - c), f - 1, -1);
        //std::cerr << L << " " << f - (interval - c) << " " << f - 1 << "\n";
        /*
        for(int i = 1; i <= 6; i++) {
            std::cerr << query(i, i) << " \n"[i == 6];
        }
        */
    }

    i64 ans = 0;
    for(int i = 1; i < maxN; i++) {
        int g = query(i, i);
        ans += 1LL * g * (g - 1) / 2;
    }

    std::cout << ans << "\n";
    
    return;
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t = 1; //std::cin >> t;
    for(int i = 1; i <= t; i++) {
        solve();
    }

    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10
• Subtask 11: 0 / 10