oj.uz

Submission #897138

# Submission time Handle Problem Language Result Execution time Memory
897138 2024-01-02T15:21:44 Z trMatherz Growing Trees (BOI11_grow) C++17
100 / 100
 241 ms 2896 KB 
#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 tre;
int n;
void add(int x, int 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];
    }
    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;
            if(sp >= 0 && sp < n) add(sp, 1);
            if(ssp >= 0 && ssp < n) add(ssp, -1);
            if(ep >= 0 && ep < n) add(ep, -1);
            if(ep - z >= 0 && ep - z < n) 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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 1940 KB Output is correct
2 Correct 170 ms 2792 KB Output is correct
3 Correct 82 ms 2788 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 9 ms 348 KB Output is correct
3 Correct 7 ms 460 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 149 ms 744 KB Output is correct
6 Correct 209 ms 928 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 127 ms 504 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 592 KB Output is correct
2 Correct 168 ms 852 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 149 ms 560 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 848 KB Output is correct
2 Correct 182 ms 1140 KB Output is correct
3 Correct 8 ms 348 KB Output is correct
4 Correct 163 ms 596 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 1364 KB Output is correct
2 Correct 166 ms 2412 KB Output is correct
3 Correct 44 ms 856 KB Output is correct
4 Correct 67 ms 2388 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 1616 KB Output is correct
2 Correct 170 ms 2540 KB Output is correct
3 Correct 83 ms 2644 KB Output is correct
4 Correct 43 ms 1112 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 1816 KB Output is correct
2 Correct 145 ms 2372 KB Output is correct
3 Correct 74 ms 2704 KB Output is correct
4 Correct 41 ms 1112 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 2240 KB Output is correct
2 Correct 161 ms 2204 KB Output is correct
3 Correct 49 ms 1712 KB Output is correct
4 Correct 157 ms 2324 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 2292 KB Output is correct
2 Correct 174 ms 2668 KB Output is correct
3 Correct 136 ms 2896 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 241 ms 2748 KB Output is correct