oj.uz

답안 #479318

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
479318 2021-10-11T08:50:24 Z jhhope1 원숭이와 사과 나무 (IZhO12_apple) C++14
0 / 100
 0 ms 204 KB 
#include<bits/stdc++.h>
using namespace std;
int C, M;
const int MAXN = 1e9;
struct Node{
    int val, lazy_set, l, r;
    Node(int val, int lazy_set):val(val),lazy_set(lazy_set),l(-1),r(-1){};
};
struct Seg{
    vector<Node> V;
    Seg(){
        V.emplace_back(0, 0);
    }
    void push_down(int s, int e, int v){
        int m = (s+e)>>1;
        if(V[v].lazy_set){
            if(V[v].l == -1){
                V[v].l = V.size();
                V.emplace_back(V[v].lazy_set*(m-s+1), V[v].lazy_set);
            }
            else{
                V[V[v].l].val = V[v].lazy_set * (m-s+1);
                V[V[v].l].lazy_set = V[v].lazy_set;
            }
            if(V[v].r == -1){
                V[v].r = V.size();
                V.emplace_back(V[v].lazy_set * (e-m), V[v].lazy_set);
            }else{
                V[V[v].r].val = V[v].lazy_set * (e-m);
                V[V[v].r].lazy_set = V[v].lazy_set;
            }
            V[v].lazy_set = 0;
        }
        else{
            if(V[v].l == -1){
                V[v].l = V.size();
                V.emplace_back(0, 0);
            }
            if(V[v].r == -1){
                V[v].r = V.size();
                V.emplace_back(0, 0);
            }
        }
    }
    void update(int s, int e, int l, int r, int v, int val){
        if(e<l || r<s){
            return;
        }
        if(l<=s && e<=r){
            V[v].val = val * (e-s+1);
            V[v].lazy_set = val;
            return;
        }
        push_down(s, e, v);
        int m = (s+e)>>1;
        update(s, m, l, r, V[v].l, val);
        update(m+1, e, l, r, V[v].r, val);
        V[v].val = V[V[v].l].val + V[V[v].r].val;
    }
    int sum(int s, int e, int l, int r, int v){
        if(e<l || r<s){
            return 0;
        }
        if(l<=s && e<=r){
            return V[v].val;
        }
        push_down(s, e, v);
        int m = (s+e)>>1;
        return sum(s, m, l, r, V[v].l) + sum(m+1, e, l, r, V[v].r);
    }
}S;
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>M;
    for(int i=0,t,x,y ; i<M ; i++){
        cin>>t;
        if(t==1){
            cin>>x>>y;
            C = S.sum(1, MAXN, x+C, y+C, 0);
            cout<<C;
        }
        else if(t==2){
            cin>>x>>y;
            S.update(1, MAXN, x+C, y+C, 0, 1);
        }
    }
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -