Submission #384627

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
384627	2021-04-01T23:10:22 Z	eyangch	Monkey and Apple-trees (IZhO12_apple)	C++17	0 / 100	538 ms	262148 KB

apple

#include <bits/stdc++.h>
#define endl "\n"
#define eat cin
#define moo cout

using namespace std;

struct segt{
    int l, r;
    segt *a, *b;
    int val, lazy;
    segt(int vl, int vr){
        l = vl, r = vr;
        a = b = NULL;
        if(l < r){
            val = 0;
            lazy = 0;
        }
    }
    void c_child(){
        a = new segt(l, (l+r)/2), b = new segt((l+r)/2+1, r);
    }
    void push(){
        if(!a && l < r) c_child();
        if(lazy == 0) return;
        val = (r - l + 1) * lazy;
        if(l < r){
            a->lazy = lazy;
            b->lazy = lazy;
        }
        lazy = 0;
    }
    void upd(int vl, int vr){
        push();
        if(l > r || l > vr || r < vl) return;
        if(l >= vl && r <= vr){
            lazy = 1;
            push();
        }else{
            a->upd(vl, vr);
            b->upd(vl, vr);
            val = a->val + b->val;
        }
    }
    int qry(int vl, int vr){
        push();
        if(l > r || l > vr || r < vl) return 0;
        if(l >= vl && r <= vr) return val;
        return a->qry(vl, vr) + b->qry(vl, vr);
    }
};

segt *s;
int M;

int32_t main(){
    eat.tie(0) -> sync_with_stdio(0);
    s = new segt(1, 1e9);
    eat >> M;
    int c = 0;
    for(int i = 0; i < M; i++){
        int d, x, y; eat >> d >> x >> y;
        if(d == 1){
            c = s->qry(x+c, y+c);
            moo << c << endl;
        }else{
            s->upd(x+c, y+c);
        }
    }
}

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	22 ms	8684 KB	Output is correct
5	Correct	26 ms	10476 KB	Output is correct
6	Correct	25 ms	10092 KB	Output is correct
7	Correct	26 ms	10348 KB	Output is correct
8	Correct	231 ms	77164 KB	Output is correct
9	Correct	419 ms	131052 KB	Output is correct
10	Correct	444 ms	146924 KB	Output is correct
11	Correct	468 ms	159468 KB	Output is correct
12	Correct	464 ms	165100 KB	Output is correct
13	Correct	461 ms	205324 KB	Output is correct
14	Correct	444 ms	207084 KB	Output is correct
15	Runtime error	538 ms	262148 KB	Execution killed with signal 9
16	Halted	0 ms	0 KB	-