Submission #1263528

#	Time	Username	Problem	Language	Result	Execution time	Memory
1263528		InvMOD	Growing Trees (BOI11_grow)	C++17	100 / 100	120 ms	5960 KiB

grow

#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define pb push_back
#define eb emplace_back

#define vi vector<int>
#define pi pair<int,int>
#define sz(v) (int)(v).size()
#define all(v) (v).begin(), (v).end()
#define compact(v) (v).erase(unique(all(v)), (v).end())

template<class T> using upq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int lwrbound(const vector<T>& a, const T& b, const int s = 0){return int(lower_bound(s + all(a), b) - a.begin());}
template<class T> int uprbound(const vector<T>& a, const T& b, const int s = 0){return int(upper_bound(s + all(a), b) - a.begin());}

#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define ROF(i, a, b) for(int i = (a); i >= (b); i--)
#define sumof(x) accumulate(all(x), 0ll)
#define dbg(x) "[" << #x " = " << (x) << "]"
#define el "\n"

using ll = long long;
using ld = long double;

template<class T> bool ckmx(T& a, const T b){return (a < b ? a = b, true : false);}
template<class T> bool ckmn(T& a, const T b){return (a > b ? a = b, true : false);}

const int INF = 1e9;

struct Node{
    int Mn, Mx;

    Node(): Mn(INF), Mx(-INF) {}
    Node(int val): Mn(val), Mx(val) {}

    Node operator + (Node q){
        Node ans;

        ans.Mx = max(Mx, q.Mx);
        ans.Mn = min(Mn, q.Mn);
        return ans;
    }
};

struct SMT{
    vector<Node> st; vi laz; int trsz;

    SMT(int n = 0): st((n << 2) | 1), laz((n << 2) | 1), trsz(n) {}

    void apply(int id, int val){
        laz[id] += val;
        st[id].Mn += val, st[id].Mx += val;
    }

    void down(int id){
        int val = laz[id]; laz[id] = 0;
        if(val){
            apply(id << 1, val);
            apply(id << 1|1, val);
        }
    }

    void updateR(int id, int l, int r, int u, int v){
        if(l > v || r < u) return;
        if(l >= u && r <= v){
            apply(id, 1);
            return;
        }

        int m = l+r>>1; down(id);
        updateR(id << 1, l, m, u, v);
        updateR(id << 1|1, m+1, r, u, v);

        st[id] = st[id << 1] + st[id << 1|1];
    }

    void updateP(int id, int l, int r, int x, int val){
        if(l == r){
            st[id] = Node(val);
        }
        else{
            int m = l+r>>1; down(id);
            if(x <= m)
                updateP(id << 1, l, m, x, val);
            else updateP(id << 1|1, m+1, r, x, val);

            st[id] = st[id << 1] + st[id << 1|1];
        }
    }

    void updateP(int x, int val){
        updateP(1, 1, trsz, x, val);
    }

    void updateR(int l, int r){
        updateR(1, 1, trsz, l, r);
    }

    int getP(int id, int l, int r, int x){
        if(l == r){
            return st[id].Mx;
        }
        else{
            int m = l+r>>1; down(id);
            if(x <= m)
                return getP(id << 1, l, m, x);
            else return getP(id << 1|1, m+1, r, x);
        }
    }

    // count all x < k
    int findP(int id, int l, int r, int k){
        if(st[id].Mx < k) return r - l + 1;
        if(st[id].Mn >= k) return 0;

        int m = l+r>>1; down(id);
        return findP(id << 1, l, m, k) + findP(id << 1|1, m+1, r, k);
    }

    int getP(int p){
        return getP(1, 1, trsz, p);
    }

    int findP(int k){
        return findP(1, 1, trsz, k);
    }
};


void Main()
{
    int n, q; cin >> n >> q;

    vi a(n + 1); FOR(i, 1, n) cin >> a[i];

    sort(1 + all(a)); SMT st(n);
    FOR(i, 1, n){
        st.updateP(i, a[i]);
    }

    auto update = [&](int MnH, int cnt) -> void{
        int pMnH = st.findP(MnH) + 1;

        if(pMnH + cnt - 1 >= n){
            st.updateR(pMnH, n);
            return;
        }

        int MxV = st.getP(pMnH + cnt - 1);
        int l = st.findP(MxV), r = st.findP(MxV + 1);

        st.updateR(pMnH, l);
        cnt -= (l - pMnH + 1);

        st.updateR(r - cnt + 1, r);
    };

    auto query = [&](int l, int r) -> int{
        return st.findP(r + 1) - st.findP(l);
    };

    while(q--){
        char op; cin >> op;
        if(op == 'F'){
            int cnt, MnH; cin >> cnt >> MnH;
            update(MnH, cnt);
        }
        else{
            int l,r; cin >> l >> r;
            cout << query(l, r) << el;
        }
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    #define name "InvMOD"
    if(fopen(name".INP", "r")){
        freopen(name".INP", "r", stdin);
        freopen(name".OUT", "w", stdout);
    }

    int t = 1; while(t--) Main();
    return 0;
}

Compilation message (stderr)

grow.cpp: In function 'int32_t main()':
grow.cpp:186:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  186 |         freopen(name".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
grow.cpp:187:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  187 |         freopen(name".OUT", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• 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