oj.uz

답안 #888574

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
888574 2023-12-17T20:28:18 Z White 원숭이와 사과 나무 (IZhO12_apple) C++14
100 / 100
 145 ms 83864 KB 
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;

bitset<4000000000>onlyOne,hasOne;

void update_tree(int l,int r,int L,int R,int now){
    //cout<<now<<" "<<l<<" "<<r<<endl;
    if(l>R || r<L || onlyOne[now]==1)return ;
    if(l>=L && r<=R){
        onlyOne[now]=1;
        hasOne[now]=1;
        return;
    }
    int mid=(l+r)/2;
    update_tree(l,mid,L,R,now*2+1);
    update_tree(mid+1,r,L,R,now*2+2);
    if(onlyOne[now*2+1]==1 && onlyOne[now*2+2]==1)onlyOne[now]=1;
    if(hasOne[now*2+1]==1 || hasOne[now*2+2]==1 || onlyOne[now*2+2]==1 || onlyOne[now*2+1]==1)hasOne[now]=1;
}

int ans_tree(int l,int r,int L,int R,int now){
    if(l>R || r<L || hasOne[now]==0)return 0;
    if(onlyOne[now]==1){
        //cout<<l<<" )_( "<<r<<endl;
        return (min(r,R)-max(l,L)+1);
    }
    int mid=(l+r)/2;
    return ans_tree(l,mid,L,R,now*2+1)+ans_tree(mid+1,r,L,R,now*2+2);
}

int main(){

    //ios_base::sync_with_stdio(false);
    //cin.tie(NULL);

    int n,c=0;
    cin>>n;
    for(int t=0;t<n;t++){
        int l,r,type;
        cin>>type>>l>>r;
        l--;r--;
        l+=c;
        r+=c;
        //cout<<l<<"-"<<r<<endl;
        if(type==2)update_tree(0,999999999,l,r,0);
        else {
            c=ans_tree(0,999999999,l,r,0);
            cout<<c<<endl;
        }
    }

    return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14680 KB Output is correct
4 Correct 14 ms 15032 KB Output is correct
5 Correct 14 ms 14940 KB Output is correct
6 Correct 14 ms 15096 KB Output is correct
7 Correct 15 ms 14940 KB Output is correct
8 Correct 65 ms 19568 KB Output is correct
9 Correct 126 ms 19448 KB Output is correct
10 Correct 145 ms 21536 KB Output is correct
11 Correct 125 ms 21396 KB Output is correct
12 Correct 127 ms 21524 KB Output is correct
13 Correct 138 ms 40020 KB Output is correct
14 Correct 139 ms 25884 KB Output is correct
15 Correct 137 ms 56852 KB Output is correct
16 Correct 139 ms 83864 KB Output is correct
17 Correct 130 ms 17796 KB Output is correct
18 Correct 127 ms 17376 KB Output is correct
19 Correct 139 ms 75348 KB Output is correct
20 Correct 139 ms 81772 KB Output is correct