oj.uz

Submission #91700

# Submission time Handle Problem Language Result Execution time Memory
91700 2018-12-29T09:33:33 Z Tieuphong Growing Trees (BOI11_grow) C++11
100 / 100
 470 ms 5624 KB 
/***************************************************************************/
/**********************  LANG TU HAO HOA  **********************************/
/***************************************************************************/
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define pii pair<int, int>
#define sz(x) ((int) x.size())
#define PB push_back
#define PF push_front
#define MP make_pair
#define ll long long
#define F first
#define S second
#define maxc 2000000007
#define MOD 1000000007
#define base 107
#define eps 1e-6
#define pi acos(-1)
#define N 100005
#define task "grow"
#define remain(x) ((x > MOD) ? (x - MOD) : x)

using namespace std;

int n, m, h[N];

vector <int> luu, v;

void Sub1()
{
    FOR(i, 1, m)
    {
        char c;
        int x, y;
        cin >> c >> x >> y;
        if (c == 'F')
        {
            int pos = lower_bound(h+1, h+n+1, y) - h;
            x = min(x, n-pos+1);
            int val = h[pos+x-1];
            int l = lower_bound(h+pos, h+n+1, val) - h;
            int r = upper_bound(h+pos, h+n+1, val) - h - 1;
            FOR(i, pos, l-1) h[i]++;
            x -= (l - pos);
            FORD(i, r, r-x+1) h[i]++;
        }
            else cout << upper_bound(h+1, h+n+1, y) - lower_bound(h+1, h+n+1, x) << '\n';
    }
}

struct IT
{
    pii t[N*4];
    int lazy[N*4];

    void Build (int l, int r, int id)
    {
        if (l == r)
        {
            t[id] = MP(h[l], h[l]);
            lazy[id] = 0;
            return;
        }
        int mid = (l + r) >> 1;
        Build(l, mid, id*2);
        Build(mid+1, r, id*2+1);
        t[id].F = max(t[id*2].F, t[id*2+1].F);
        t[id].S = min(t[id*2].S, t[id*2+1].S);
        lazy[id] = 0;
    }

    void Push(int l, int r, int id)
    {
        if (!lazy[id]) return;
        t[id].F += lazy[id];
        t[id].S += lazy[id];
        if (l != r)
        {
            lazy[id*2] += lazy[id];
            lazy[id*2+1] += lazy[id];
        }
        lazy[id] = 0;
    }

    void Upd(int l, int r, int id, int u, int v)
    {
        Push(l, r, id);
        if (l > v || r < u) return;
        if (l >= u && r <= v)
        {
            t[id].F++, t[id].S++;
            if (l != r)
            {
                lazy[id*2]++;
                lazy[id*2+1]++;
            }
            return;
        }
        int mid = (l + r) >> 1;
        Upd(l, mid, id*2, u, v);
        Upd(mid+1, r, id*2+1, u, v);
        t[id].F = max(t[id*2].F, t[id*2+1].F);
        t[id].S = min(t[id*2].S, t[id*2+1].S);
    }

    pii Get(int l, int r, int id, int u, int v)
    {
        if (l > v || r < u) return MP(-maxc, maxc);
        Push(l, r, id);
        if (l >= u && r <= v) return t[id];
        int mid = (l + r) >> 1;
        pii m1 = Get(l, mid, id*2, u, v);
        pii m2 = Get(mid+1, r, id*2+1, u, v);
        return MP(max(m1.F, m2.F), min(m1.S, m2.S));
    }

    int Find_max(int l, int r, int id, int val)
    {
        Push(l, r, id);
        if (l == r)
        {
            if (t[id].F <= val) return l;
            return -1;
        }
        int mid = (l + r) >> 1;
        int cur = Get(1, n, 1, mid+1, n).S;
        if (cur <= val) return Find_max(mid+1, r, id*2+1, val);
        return Find_max(l, mid, id*2, val);
    }

    int Find_min(int l, int r, int id, int val)
    {
        Push(l, r, id);
        if (l == r)
        {
            if (t[id].S >= val) return l;
            return -1;
        }
        int mid = (l + r) >> 1;
        int cur = Get(1, n, 1, 1, mid).F;
        if (cur >= val) return Find_min(l, mid, id*2, val);
        return Find_min(mid+1, r, id*2+1, val);
    }

} Tree;

void Full()
{
    Tree.Build(1, n, 1);
    FOR(i, 1, m)
    {
        char c;
        int x, y;
        cin >> c >> x >> y;
        if (c == 'F')
        {
            int pos = Tree.Find_min(1, n, 1, y);
            if (pos == -1) continue;
            x = min(x, n-pos+1);
            int val = Tree.Get(1, n, 1, pos, pos+x-1).F;
            int l = Tree.Find_min(1, n, 1, val);
            int r = Tree.Find_max(1, n, 1, val);
            if (pos <= l-1) Tree.Upd(1, n, 1, pos, l-1);
            x -= (l - pos);
            Tree.Upd(1, n, 1, r-x+1, r);
        }
            else
            {
                int l = Tree.Find_min(1, n, 1, x);
                int r = Tree.Find_max(1, n, 1, y);
                if (l == -1 || r == -1) cout << "0\n";
                    else cout << (r - l + 1) << '\n';
            }
    }
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    //freopen(task".inp", "r", stdin);
    //freopen(task".out", "w", stdout);
    cin >> n >> m;
    FOR(i, 1, n) cin >> h[i];
    sort(h+1, h+n+1);
    //Sub1();
    Full();
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 231 ms 5112 KB Output is correct
2 Correct 421 ms 5144 KB Output is correct
3 Correct 287 ms 5496 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3448 KB Output is correct
2 Correct 7 ms 3448 KB Output is correct
3 Correct 8 ms 3452 KB Output is correct
4 Correct 6 ms 3448 KB Output is correct
5 Correct 137 ms 3828 KB Output is correct
6 Correct 174 ms 3976 KB Output is correct
7 Correct 16 ms 3576 KB Output is correct
8 Correct 95 ms 3704 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 3952 KB Output is correct
2 Correct 175 ms 3968 KB Output is correct
3 Correct 6 ms 3576 KB Output is correct
4 Correct 113 ms 3832 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 4056 KB Output is correct
2 Correct 194 ms 4040 KB Output is correct
3 Correct 24 ms 3676 KB Output is correct
4 Correct 169 ms 3960 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 233 ms 4472 KB Output is correct
2 Correct 369 ms 5132 KB Output is correct
3 Correct 49 ms 3836 KB Output is correct
4 Correct 227 ms 5240 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 319 ms 4972 KB Output is correct
2 Correct 363 ms 4984 KB Output is correct
3 Correct 280 ms 5624 KB Output is correct
4 Correct 49 ms 4216 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 244 ms 5112 KB Output is correct
2 Correct 238 ms 5240 KB Output is correct
3 Correct 278 ms 5496 KB Output is correct
4 Correct 48 ms 4216 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 409 ms 5120 KB Output is correct
2 Correct 361 ms 4984 KB Output is correct
3 Correct 67 ms 4856 KB Output is correct
4 Correct 242 ms 5008 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 5112 KB Output is correct
2 Correct 396 ms 5004 KB Output is correct
3 Correct 470 ms 5240 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 351 ms 5500 KB Output is correct