답안 #607231

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
607231	2022-07-26T13:42:21 Z	erto	원숭이와 사과 나무 (IZhO12_apple)	C++17	100 / 100	201 ms	114388 KB

apple

#include <bits/stdc++.h>
typedef long long int ll;
#define INF 1000000007
#define INF2 998244353
#define N (ll)(5e3+ 5)
using namespace std;
#define int ll
#define lsb(x) (x & (-x))
 
int m, g, h, t, cur=0;
 
struct Vertex {
    int left, right;
    int sum = 0;
    Vertex *left_child = nullptr, *right_child = nullptr;
 
    Vertex(int lb, int rb) {
        left = lb;
        right = rb;
    }
 
    void extend() {
        if (!left_child && left < right) {
            int t = (left + right) / 2;
            left_child = new Vertex(left, t);
            right_child = new Vertex(t + 1, right);
        }
        if(sum == right - left + 1 && left_child){
            left_child->sum = left_child->right - left_child->left + 1;
            right_child->sum = right_child->right - right_child->left + 1;
        }
    }
 
    void add(int lq, int rq) {
        if(left > rq || right < lq)return;
        if(left >= lq && right <= rq){
            if(sum == right - left + 1)return;
            sum = right - left + 1;
            return;
        }
        extend();
        left_child->add(lq, rq);
        right_child->add(lq, rq);
        sum = left_child->sum + right_child->sum;
    }
 
    int get_sum(int lq, int rq) {
        if(sum == 0 || left > rq || right < lq)return 0;
        if (lq <= left && right <= rq){
            return sum;
        }
        if(sum == right - left + 1){
            return min(rq, right) - max(lq, left) + 1;
        }
 
        extend();
        return left_child->get_sum(lq, rq) + right_child->get_sum(lq, rq);
    }
};
 
void solve(){
    cin >> m;
 
    Vertex s(1, 1e9);
 
    for(int i=1; i<=m; i++){
        cin >> t >> g >> h;
        if(t == 1){
            cur = s.get_sum(g + cur, h + cur);
            cout << cur << "\n";
        }
        else{
            s.add(g + cur, h + cur);
        }
    }
}
 
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
   // cin>>T;
    while (T--){
        solve();
    }
}

Subtask #1

100.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	8 ms	2900 KB	Output is correct
5	Correct	9 ms	3412 KB	Output is correct
6	Correct	9 ms	3412 KB	Output is correct
7	Correct	8 ms	3464 KB	Output is correct
8	Correct	62 ms	26340 KB	Output is correct
9	Correct	126 ms	46732 KB	Output is correct
10	Correct	142 ms	51124 KB	Output is correct
11	Correct	136 ms	54344 KB	Output is correct
12	Correct	141 ms	55792 KB	Output is correct
13	Correct	161 ms	58372 KB	Output is correct
14	Correct	124 ms	59812 KB	Output is correct
15	Correct	201 ms	111980 KB	Output is correct
16	Correct	199 ms	112240 KB	Output is correct
17	Correct	160 ms	63836 KB	Output is correct
18	Correct	131 ms	63780 KB	Output is correct
19	Correct	198 ms	114328 KB	Output is correct
20	Correct	191 ms	114388 KB	Output is correct