oj.uz

Submission #299801

# Submission time Handle Problem Language Result Execution time Memory
299801 2020-09-15T16:48:30 Z HynDuf Sails (IOI07_sails) C++11
100 / 100
 202 ms 7032 KB 
#include <bits/stdc++.h>

#define task "S"
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define Rep(i, r, l) for (int i = (r); i >= (l); --i)
#define DB(X) { cerr << #X << " = " << (X) << '\n'; }
#define DB1(A, _) { cerr << #A << "[" << _ << "] = " << (A[_]) << '\n'; }
#define DB2(A, _, __) { cerr << #A << "[" << _ << "][" << __ << "] = " << (A[_][__]) << '\n'; }
#define DB3(A, _, __, ___) { cerr << #A << "[" << _ << "][" << __ << "][" << ___ << "] = " << (A[_][__][___]) << '\n'; }
#define PR(A, l, r) { cerr << '\n'; rep(_, l, r) DB1(A, _); cerr << '\n';}
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
#define pf push_front
#define F first
#define S second
#define by(x) [](const auto& a, const auto& b) { return a.x < b.x; } // sort(arr, arr + N, by(a));
#define next ___next
#define prev ___prev
#define y1 ___y1
#define left ___left
#define right ___right
#define y0 ___y0
#define div ___div
#define j0 ___j0
#define jn ___jn

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vl;
const int N = 1e5 + 2;
int n, nn, cnt[N];
ii h[N];
ll ans = 0;
struct IT
{
    vii it;
    vi lz;
    IT(int n) {it.assign(4 * n, {0, 0}); lz.assign(4 * n, 0);}
    void dolazy(int id, int l, int r)
    {
        if (!lz[id]) return;
        it[id].F += lz[id];
        it[id].S += lz[id];
        if (l != r)
        {
            lz[id << 1] += lz[id];
            lz[(id << 1) | 1] += lz[id];
        }
        lz[id] = 0;
    }
    void update(int id, int l, int r, int L, int R)
    {
        dolazy(id, l, r);
        if (l > R || r < L || L > R) return;
        if (L <= l && r <= R)
        {
            lz[id]++;
            dolazy(id, l, r);
            return;
        }
        int m = (l + r) >> 1;
        update(id << 1, l, m, L, R);
        update((id << 1) | 1, m + 1, r, L, R);
        it[id] = {min(it[id << 1].F, it[(id << 1) | 1].F), max(it[id << 1].S, it[(id << 1) | 1].S)};
    }
    int query(int id, int l, int r, int p)
    {
        dolazy(id, l, r);
        if (l == r) return it[id].F;
        int m = (l + r) >> 1;
        if (p <= m) return query(id << 1, l, m, p);
        return query((id << 1) | 1, m + 1, r, p);
    }
    int firstOccur(int id, int l, int r, int x)
    {
        dolazy(id, l, r);
        if (l == r) return l;
        int m = (l + r) >> 1;
        dolazy(id << 1, l, m);
        if (it[id << 1].F <= x) return firstOccur(id << 1, l, m, x);
        return firstOccur((id << 1) | 1, m + 1, r, x);
    }
    int lastOccur(int id, int l, int r, int x)
    {
        dolazy(id, l, r);
        if (l == r) return l;
        int m = (l + r) >> 1;
        dolazy((id << 1) | 1, m + 1, r);
        if (it[(id << 1) | 1].S >= x) return lastOccur((id << 1) | 1, m + 1, r, x);
        return lastOccur(id << 1, l, m, x);

    }
};
int main()
{
#ifdef HynDuf
    freopen(task".in", "r", stdin);
    freopen(task".out", "w", stdout);
#else
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
#endif
    cin >> n;
    rep(i, 1, n) cin >> h[i].F >> h[i].S, nn = max(nn, h[i].F);
    sort(h + 1, h + 1 + n);
    IT seg(nn);
    rep(i, 1, n)
    {
        int x = seg.query(1, 1, nn, h[i].F - h[i].S + 1);
        int fO = seg.firstOccur(1, 1, nn, x);
        int lO = min(h[i].F, seg.lastOccur(1, 1, nn, x));
        seg.update(1, 1, nn, lO + 1, h[i].F);
        cnt[lO + 1]++;
        cnt[h[i].F + 1]--;
        seg.update(1, 1, nn, fO, fO + lO - (h[i].F - h[i].S + 1));
        cnt[fO]++;
        cnt[fO + lO - (h[i].F - h[i].S)]--;
    }
    rep(i, 2, nn) cnt[i] += cnt[i - 1];
    rep(i, 1, nn) ans += cnt[i] * 1LL * (cnt[i] - 1) / 2;
    cout << ans;
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 6 ms 5376 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1920 KB Output is correct
2 Correct 39 ms 1152 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 2168 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 3320 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 6136 KB Output is correct
2 Correct 134 ms 7032 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 6136 KB Output is correct
2 Correct 70 ms 6264 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 6264 KB Output is correct
2 Correct 118 ms 3704 KB Output is correct