제출 #1039598

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1039598		trucmai	Growing Trees (BOI11_grow)	C++17	0 / 100	1060 ms	5212 KiB

grow

#include <bits/stdc++.h>
#ifdef LOCAL
    #include "/home/trcmai/code/tools.h"
    #define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
    #define debug(x...)
#endif
using namespace std;
#define all(a) a.begin(), a.end()
#define ll long long
#define endl '\n'
const int N = 1e6 + 6, LOG = 27, MOD = 1e9 + 7;
const ll INF = 1e18;
int n,q;
ll a[N];
namespace fenwick{
    ll tr[N];
    void add(int i,ll val){
        for(;i < N;i += i&(-i)) tr[i] += val;
    }   
    void upd(int l,int r,ll val){
        if(l > r) return;
        r = min(r,n);
        add(l,val);
        add(r+1,-val);
    }
    ll get(int i){
        ll res = 0;
        for(;i > 0;i -= i&(-i)) res += tr[i];
        return res;
    }
    int walk(ll val){
        int l = 1,r = n + 1;
        while(l < r){
            int m = (r+l) >> 1; 
            if(get(m) >= val) r = m;
            else l = m + 1;
        }
        return l;
    }
}
signed main() {
    cin.tie(0)->sync_with_stdio(0);
    auto solver=[&](){
        cin>>n>>q;
        for(int i = 1;i <= n;++i) cin>>a[i];
        sort(a + 1,a + n + 1);
        for(int i = 1;i <= n;++i)
            fenwick::add(i,a[i] - a[i - 1]);
        while(q--){
            char t; cin>>t;
            if(t == 'F'){
                int tot; ll val; cin>>tot>>val;
                int l = fenwick::walk(val);
                int r = min(n,l + tot - 1);
                if(l > n) return; 
                tot = r - l + 1;
                ll last_val = fenwick::get(r);
                int s = fenwick::walk(last_val);
                int t = fenwick::walk(last_val + 1) - 1;
                //update first range
                fenwick::upd(l,s,1);
                //update second range 
                int ptr = t - (tot - (s - l + 1)) + 1; 
                fenwick::upd(ptr,t,1);
            }else{
                ll low,high; cin>>low>>high;
                cout<<fenwick::walk(high + 1) - fenwick::walk(low) << endl;
            }
        }
    };
    int t = 1; // cin>>t;
    while (t--) solver();
}

• 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