oj.uz

Submission #524141

# Submission time Handle Problem Language Result Execution time Memory
524141 2022-02-08T17:12:09 Z AA_Surely Growing Trees (BOI11_grow) C++17
0 / 100
 189 ms 7748 KB 
#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(int i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(int i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define WTF 		cout << "WTF" << endl

#define IOS 		ios::sync_with_stdio(false); cin.tie(0)
#define F 			first
#define S	 		second
#define pb 			push_back

#define ALL(x) 		x.begin(), x.end()
#define RALL(x) 	x.rbegin(), x.rend()

using namespace std;
typedef long long 		LL;

typedef pair<LL, LL> 	PLL;

typedef vector<int> 	VI;
typedef vector<LL> 		VLL;
typedef vector<PLL> 	VPLL;

const int MAXN = 1e5 + 7;
const int ALPHA = 27;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int LOG = 22;

LL n, q;
LL ns[MAXN], lazy[MAXN << 2];
PLL tree[MAXN << 2];

inline PLL operator + (const PLL a, const PLL b) {
    return PLL(min(a.F, b.F), max(a.S, b.S));
}

inline PLL operator + (const PLL a, const LL b) {
    return PLL(a.F + b, a.S + b);
}

inline void shift(int now_on) {
    tree[now_on << 1] = tree[now_on << 1] + lazy[now_on];
    lazy[now_on << 1] += lazy[now_on];

    tree[now_on << 1 | 1] = tree[now_on << 1 | 1] + lazy[now_on];
    lazy[now_on << 1 | 1] += lazy[now_on];
    
    lazy[now_on] = 0;
    return;
}

PLL build(int now_on = 1, int ls = 0, int rs = n - 1) {
    if (ls == rs) return tree[now_on] = PLL(ns[ls], ns[ls]);
    int mid = (ls + rs) >> 1;
    return tree[now_on] = build(now_on << 1, ls, mid) + build(now_on << 1 | 1, mid + 1, rs);
}

LL lb(int lq, int now_on = 1, int ls = 0, int rs = n - 1) {
    if (ls == rs) return ls;
    int mid = (ls + rs) >> 1;
    shift(now_on);
    if (tree[now_on << 1].S >= lq) return lb(lq, now_on << 1, ls, mid);
    return lb(lq, now_on << 1 | 1, mid + 1, rs);
}

LL ub(int rq, int now_on = 1, int ls = 0, int rs = n - 1) {
    if (ls == rs) return ls;
    int mid = (ls + rs) >> 1;
    shift(now_on);
    if (tree[now_on << 1 | 1].F <= rq) return ub(rq, now_on << 1 | 1, mid + 1, rs);
    return ub(rq, now_on << 1, ls, mid);
}

LL get(int id, int now_on = 1, int ls = 0, int rs = n - 1) {
    if (ls == rs) return tree[now_on].F;
    int mid = (ls + rs) >> 1;
    shift(now_on);
    if (id <= mid) return get(id, now_on << 1, ls, mid);
    return get(id, now_on << 1 | 1, mid + 1, rs);
}

void add(int lq, int rq, LL val, int now_on = 1, int ls = 0, int rs = n - 1) {
    if (rq < lq || rq < ls || rs < lq) 
        return;
    if (lq <= ls && rs <= rq) {
        tree[now_on] = tree[now_on] + val;
        lazy[now_on] += val;
        return;
    }

    int mid = (ls + rs) >> 1;
    shift(now_on);
    add(lq, rq, val, now_on << 1, ls, mid);
    add(lq, rq, val, now_on << 1 | 1, mid + 1, rs);

    tree[now_on] = tree[now_on << 1] + tree[now_on << 1 | 1];
    return;
}

int main() {
    IOS;
    
    cin >> n >> q;
    F0R(i, n) cin >> ns[i];
    sort(ns, ns + n);
    build();

    while(q--) {
        char tp; cin >> tp;

        if (tp == 'F') {
            LL td, mnm; cin >> td >> mnm;
            if (get(n - 1) < mnm) continue;

            LL st = lb(mnm);
            LL fn = min(n - 1, st + td - 1);

            LL md = get(fn);
            LL smd = lb(md), fmd = ub(md);
            add(st, smd - 1, 1);
            add(fmd - (td - ((smd - 1) - st + 1)) + 1, fmd, 1);
        }

        else {
            LL mn, mx; cin >> mn >> mx;
            cout << (mx < get(0) || mn > get(n - 1) ? 0 : ub(mx) - lb(mn) + 1) << endl;
        }
    }
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 110 ms 7188 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 332 KB Output is correct
2 Correct 6 ms 332 KB Output is correct
3 Incorrect 6 ms 332 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 139 ms 968 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 143 ms 916 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 112 ms 3948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 115 ms 7108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 113 ms 7184 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 189 ms 7404 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 145 ms 7276 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 189 ms 7748 KB Output isn't correct
2 Halted 0 ms 0 KB -