oj.uz

답안 #868569

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
868569 2023-10-31T21:44:52 Z TB_ Growing Trees (BOI11_grow) C++17
100 / 100
 87 ms 12236 KB 
#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << (x) << endl;
#define deb2(x, y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;

vi v;
int c;

struct Node{
    Node *lnode, *rnode;
    int l, r, vall, valr, toAdd = 0;
    Node(int l, int r) : l(l), r(r){
        if(r-l == 1) vall = valr = v[l];
        else{
            int mid = (l+r) / 2;
            lnode = new Node(l, mid);
            rnode = new Node(mid, r);
            vall = lnode->vall; valr = rnode->valr;
        }
    }

    pl add(int h){
        if(valr<h) return {-1, -1};
        if(vall>=h && r-l <=c){
            c-=(r-l);
            vall++;
            valr++;
            toAdd++;
            return {valr, r};
        }
        push();
        pl res = lnode->add(h);
        if(c) res = rnode->add(h);
        vall = lnode->vall; valr = rnode->valr;
        return res;
    }

    int cleanup(int val, int hi){
        if(hi<=l) return 0;
        if(r<=hi && valr<val) return 0;
        if(r<=hi && vall==val){
            vall--;
            valr--;
            toAdd--;
            return r-l;
        }
        push();
        int res = lnode->cleanup(val, hi) + rnode->cleanup(val, hi);
        vall = lnode->vall; valr = rnode->valr;
        return res;
    }
   
    void update(int h){
        if(vall>h) return;
        if(valr==h && r-l <=c){
            c-=(r-l);
            vall++;
            valr++;
            toAdd++;
            return;
        }
        push();
        rnode->update(h);
        if(c) lnode->update(h);
        vall = lnode->vall; valr = rnode->valr;
    }

    int query(int lo, int hi){
        if(valr < lo || hi < vall) return 0;
        if(valr <= hi && lo <= vall) return r-l;
        push();
        return lnode->query(lo, hi) + rnode->query(lo, hi);
    }

    void push(){
        if(toAdd && r-l > 1){
            lnode->toAdd+=toAdd;
            rnode->toAdd+=toAdd;
            lnode->vall+=toAdd;
            lnode->valr+=toAdd;
            rnode->vall+=toAdd;
            rnode->valr+=toAdd;
            toAdd = 0;
        }
    }
};

int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    char command;
    int n, m, val1, val2;
    cin >> n >> m;
    fo(i, n){
        cin >> val1;
        v.pb(val1);
    }
    sort(all(v));
    Node st(0, n);

    while(m--){
        cin >> command >> val1 >> val2;
        if(command == 'C'){
            cout << st.query(val1, val2) << "\n";
            continue;
        }
        c = val1;
        pl toRight = st.add(val2);
        c = st.cleanup(toRight.F, toRight.S);
        st.update(toRight.F-1);
    }

    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 10352 KB Output is correct
2 Correct 85 ms 10576 KB Output is correct
3 Correct 45 ms 9936 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 29 ms 1836 KB Output is correct
6 Correct 36 ms 2068 KB Output is correct
7 Correct 3 ms 856 KB Output is correct
8 Correct 14 ms 1740 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 2392 KB Output is correct
2 Correct 38 ms 2388 KB Output is correct
3 Correct 2 ms 1112 KB Output is correct
4 Correct 19 ms 2024 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 2640 KB Output is correct
2 Correct 40 ms 2280 KB Output is correct
3 Correct 6 ms 1116 KB Output is correct
4 Correct 41 ms 2496 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 7900 KB Output is correct
2 Correct 75 ms 8748 KB Output is correct
3 Correct 13 ms 2392 KB Output is correct
4 Correct 40 ms 8660 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 8656 KB Output is correct
2 Correct 74 ms 9540 KB Output is correct
3 Correct 41 ms 8916 KB Output is correct
4 Correct 13 ms 2396 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 9428 KB Output is correct
2 Correct 62 ms 10240 KB Output is correct
3 Correct 47 ms 9940 KB Output is correct
4 Correct 12 ms 2396 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 10572 KB Output is correct
2 Correct 76 ms 9044 KB Output is correct
3 Correct 27 ms 10704 KB Output is correct
4 Correct 41 ms 10196 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 10204 KB Output is correct
2 Correct 70 ms 10448 KB Output is correct
3 Correct 87 ms 11780 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 12236 KB Output is correct