Submission #719323

#	Time	Username	Problem	Language	Result	Execution time	Memory
719323		Muaath_5	Monkey and Apple-trees (IZhO12_apple)	C++17	0 / 100	443 ms	262144 KiB

apple

#include <bits/stdc++.h>
#define ll long long
using namespace std;

const ll N = 1e9+2;

int q;

struct segnode {
    ll sum = 0;
    int lazy = 0;
    ll s, e;
    segnode *segleft, *segright;
    segnode() : sum(0), lazy(0), s(1), e(N), segleft(nullptr), segright(nullptr) {}
    segnode(segnode* l, segnode* r, ll s, ll e) : segleft(l), segright(r), s(s), e(e) {
        if (l)
            this->sum += l->sum;
        if (r)
            this->sum += r->sum;
    }
};

segnode* root;

void pushdown(segnode* node)
{
    if (!node->lazy) return;
    const ll mid = (node->s + node->e) / 2;
    if (!node->segleft && node->s < node->e)
        node->segleft = new segnode(nullptr, nullptr, node->s, mid);
    if (node->s < node->e)
        node->segleft->lazy = node->lazy;
    if (!node->segright && node->s < node->e)
        node->segright = new segnode(nullptr, nullptr, mid + 1, node->e);
    if (node->s < node->e)
        node->segright->lazy = node->lazy;
    node->sum = (node->e - node->s + 1);
    node->lazy = 0;
}

void lazy_update(segnode* node, ll l, ll r) {
    pushdown(node);
    if (node->e < l || node->s > r) return;
    if (l <= node->s && node->e <= r) {
        node->lazy = 1;
        pushdown(node);
        return;
    }
    const ll mid = (node->s + node->e) / 2;
    int sum = 0;

    if (!node->segleft && node->s < node->e)
        node->segleft = new segnode(nullptr, nullptr, node->s, mid);
    if (!node->segright && node->s < node->e)
        node->segright = new segnode(nullptr, nullptr, mid+1, node->e);

    //if (node->segleft) {
        lazy_update(node->segleft, l, r);
        sum += node->segleft->sum;
    //}
    //if (node->segright) {
        lazy_update(node->segright, l, r);
        sum += node->segright->sum;
    //}
    node->sum = sum;
}

ll query(segnode* node, ll l, ll r) {
    pushdown(node);
    if (node->e < l || node->s > r) return 0;
    if (l <= node->s && node->e <= r) return node->sum;
    ll sum = 0;
    if (node->segleft)
        sum += query(node->segleft, l, r);
    if (node->segright)
        sum += query(node->segright, l, r);
    return sum;
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> q;
    root = new segnode();
    ll c = 0;
    while (q--) {
        ll cmd, x, y;
        cin >> cmd >> x >> y;
        if (cmd == 1) {
            c = query(root, x+c, y+c);
            cout << c << '\n';
        }
        else if (cmd == 2) {
            lazy_update(root, x+c, y+c);
        }
    }
}

Compilation message (stderr)

apple.cpp: In constructor 'segnode::segnode(segnode*, segnode*, long long int, long long int)':
apple.cpp:13:24: warning: 'segnode::segright' will be initialized after [-Wreorder]
   13 |     segnode *segleft, *segright;
      |                        ^~~~~~~~
apple.cpp:12:8: warning:   'long long int segnode::s' [-Wreorder]
   12 |     ll s, e;
      |        ^
apple.cpp:15:5: warning:   when initialized here [-Wreorder]
   15 |     segnode(segnode* l, segnode* r, ll s, ll e) : segleft(l), segright(r), s(s), e(e) {
      |     ^~~~~~~

• Subtask 1: 0 / 100