Submission #897130

#	Time	Username	Problem	Language	Result	Execution time	Memory
897130		trMatherz	Growing Trees (BOI11_grow)	C++17	0 / 100	163 ms	2900 KiB

grow

#include <iostream> //cin, cout

/*
#include <fstream>
std::ifstream cin ("ex.in");
std::ofstream cout ("ex.out");
*/




// includes
#include <cmath> 
#include <set>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <chrono>



//usings 
using namespace std;
using namespace __gnu_pbds;


// misc
#define ll long long
#define pb push_back
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
template<typename T, typename U> bool emin(T &a, const U &b){ return b < a ? a = b, true : false; }
template<typename T, typename U> bool emax(T &a, const U &b){ return b > a ? a = b, true : false; }
typedef uint64_t hash_t;

// vectors
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vppipi vector<pair<int, pair<int, int>>>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vpll vector<pair<ll, ll>>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define sz(x) (int)x.size()
#define rz(x,y) x.resize(y)
#define all(x) x.begin(), x.end()


// pairs
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define f first
#define s second

// sets
#define si set<int>
#define sl set<ll>
#define ss set<string>
#define in insert
template <class T> using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// maps
#define mii map<int, int>
#define mll map<ll, ll>

// loops
#define FR(x, z, y) for (int x = z; x < y; x++)
#define FRe(x, z, y) FR(x, z, y + 1)
#define F(x, y) FR(x, 0, y)
#define Fe(x, y) F(x, y + 1)
#define A(x, y) for(auto &x : y)

vi a;
vi arr(5, 0);
vi tre;
int n;
void add(int x, int v){
    arr[x] += v;
    for(x++; x <= n; x += x & -x) tre[x] += v;
}

int sum(int x){
    int ret = 0;
    for(x++; x > 0; x -= x & -x) ret += tre[x];
    return ret;
}

int find(int x){
    if(sum(n - 1) < x) return -1;
    int l = 0, r = n - 1; 
    while(l < r){
        int m = l + (r - l - 1) / 2;
        if(sum(m) >= x) r = m;
        else l = m + 1;
    }
    return l;
}

int rfind(int x){
    if(sum(n - 1) <= x) return n;
    int l = 0, r = n - 1; 
    while(l < r){
        int m = l + (r - l - 1) / 2;
        if(sum(m) > x) r = m;
        else l = m + 1;
    }
    return l;
}

int main(){
    int m; cin >> n >> m;
    a = vi(n); A(u, a) cin >> u;
    tre = vi(n + 1, 0);
    sort(all(a));
    int cur = 0;
    F(i, n){
        add(i, a[i] - cur);
        cur = a[i];
    }
    A(u, arr) cout << u << " ";
    cout << endl;
    while(m--){
        char c; cin >> c;
        int x, y; cin >> x >> y;
        if(c == 'F'){
            int sp = find(y);
            if(sp == -1) continue;
            if(sp + x >= n) {add(sp, 1); continue;}
            int ssp = find(sum(sp + x - 1));
            int ep = rfind(sum(sp + x - 1));
            int z = x - ssp + sp;
            add(sp, 1);
            add(ssp, -1);
            if(ep != n) add(ep, -1);
            add(ep - z, 1);
        } else {
            int z = rfind(y);
            if(z < 0) {cout << 0 << endl; continue;}
            int w = max(0, rfind(x - 1));
            cout << z - w << endl;
        }
       
    }
   
    return 0;
}

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