Submission #874406

#	Time	Username	Problem	Language	Result	Execution time	Memory
874406		BBart888	Growing Trees (BOI11_grow)	C++14	100 / 100	91 ms	3804 KiB

grow

#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <array>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <stack>
#include <stdio.h>      
#include <stdlib.h>     
#include <time.h> 
#include <string>
#include <fstream>
#include <unordered_map>



using namespace std;
using ll = long long;
using ld = long double;



using Mat = array<array<ll, 2>, 2>;
const ll mod1 = 1e9 + 7;
const ll mod2 = 1e9 + 123;
const int MAXN = 2e5 + 11;
const int B = 100;
const ll P = 207971;


int n, m;
vector<int> h;


int bit[MAXN];

void add(int l, int r, int x) {  // add x to [l, r]
    if (r < l) return;
    for (; l < n; l |= l + 1) bit[l] += x;
    for (++r; r < n; r |= r + 1) bit[r] -= x;
}
int query(int i) {  // point query at i
    int sum = 0;
    for (; i >= 0; i &= i + 1, --i) sum += bit[i];
    return sum;
}

template <class T, class U> T firstTrue(T lo, T hi, U f) {
    //assert(lo <= hi);
    ++hi;              // assuming f is increasing
    while (lo < hi) {  // find first index such that f is true
        T mid = lo + (hi - lo) / 2;
        f(mid) ? hi = mid : lo = mid + 1;
    }
    return lo;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);


    cin >> n >> m;

    for (int i = 0; i < n; i++)
    {
        int x;
        cin >> x;
        h.push_back(x);
    }


    sort(h.begin(), h.end());


    for (int i = 0; i < n; i++)
        add(i, i, h[i]);
    
    
    for (int i = 0; i < m; i++)
    {
        char type;
        int a, b;
        
        cin >> type >> a >> b;
        if (type == 'C')
        {
            int l = firstTrue(0, n - 1, [&](int i) {return query(i) >= a; });
            int r = firstTrue(0, n - 1, [&](int i) { return query(i) > b; });
            cout << r - l << '\n';
        }
        else
        {
            int l = firstTrue(0, n - 1, [&](int i) {return query(i) >= b; });
            if (l + a - 1 > n - 1)
            {
                add(l, n - 1, 1);
                continue;
            }

            int r = l + a - 1;

            int x = query(r);

            int _l = firstTrue(0, n - 1, [&](int i) {return query(i) >= x; });
            int _r = firstTrue(0, n - 1, [&](int i) {return query(i) > x; }) - 1;

            add(l, _l-1, 1);
            add(_r - (a-(_l - l)) + 1, _r, 1);
        }
    }












    return 0;
}

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