Submission #1267888

#	Time	Username	Problem	Language	Result	Execution time	Memory
1267888		hoa208	Monkey and Apple-trees (IZhO12_apple)	C++20	100 / 100	286 ms	137388 KiB

apple

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define pa pair<ll, ll>
#define fi first
#define se second
#define bit(mask, j) ((mask >> j) & 1)
const   ll mod = 1e9 + 7;
const   ll INF = 1e18;
//--------------------------------------------------------------------
struct Node {
    ll l = -1;
    ll r = -1;
    ll cur = 0;
    ll lazy = 0;
};
vector<Node> tree;
ll ID = 0;
void add(ll id, ll len, ll val) {
    tree[id].cur = len;
    tree[id].lazy = 1;
}
void down(ll id, ll l, ll r) {
    if(tree[id].l == -1) {
        tree[id].l = ++ID;
        tree.push_back(Node());
    }
    if(tree[id].r == -1) {
        tree[id].r = ++ID;
        tree.push_back(Node());
    }
    ll mid = l + r >> 1;
    if(tree[id].lazy == 0) return;
    add(tree[id].l, mid - l + 1, 1);
    add(tree[id].r, r - mid, 1);
    tree[id].lazy = 0;
}
void merge(Node &mid, Node &L, Node &R) {
    mid.cur = L.cur + R.cur;
}
void update(ll u, ll v,ll id, ll l, ll r) {
    if(u > r || v < l) return;
    if(u <= l && v >= r) {
        add(id, r - l + 1, 1);
        return;
    }
    down(id, l, r);
    ll mid = l + r >> 1;
    ll idl = tree[id].l, idr = tree[id].r;
    update(u, v, idl, l, mid);
    update(u, v, idr, mid + 1, r);
    merge(tree[id], tree[idl], tree[idr]);
}
ll get(ll u, ll v, ll id, ll l, ll r) {
    if(u > r || v < l) return 0;
    if(u <= l && v >= r) return tree[id].cur;
    down(id, l, r);
    ll mid = l + r >> 1;
    ll idl = tree[id].l, idr = tree[id].r;
    return get(u, v, idl, l, mid) + get(u, v, idr, mid + 1, r);
}
// struct Node {
//     ll l = -1;
//     ll r = -1;
//     ll cur = 0;
//     ll lazy = 0;
// };
// vector<Node> tree;
// ll ID = 0;
// void down(ll id, ll l, ll r) {
//     ll mid = l + r >> 1;
//     ll &x = tree[id].lazy;
//     if(tree[id].l == -1) {
//         ID++;
//         tree[id].l = ID;
//         tree.push_back(Node());
//     }
//     if(x != 0) {
//         tree[ID].cur = (mid - l + 1); 
//         tree[ID].lazy = 1;
//     }
//     if(tree[id].r == -1) {
//         ID++;
//         tree[id].r = ID;
//         tree.push_back(Node());
//     }
//     if(x != 0) {
//         tree[ID].cur = (r - mid); 
//         tree[ID].lazy = 1;
//     }
//     x = 0;
// }
// void update(ll u, ll v, ll id, ll l, ll r) {
//     if(u > r || v < l) return;
//     if(u <= l && v >= r) {
//         tree[id].cur = r - l + 1;
//         tree[id].lazy = 1;
//         return;
//     }
//     ll mid = l + r >> 1;
//     down(id, l, r);
//     update(u, v, tree[id].l, l, mid);
//     update(u, v, tree[id].r, mid + 1, r);
//     tree[id].cur = tree[tree[id].l].cur + tree[tree[id].r].cur;
// }
// ll get(ll u, ll v, ll id, ll l, ll r) {
//     if(u > r || v < l) return 0;
//     if(u <= l && v >= r) {
//         return tree[id].cur;
//     }
//     ll mid = l + r >> 1;
//     down(id, l, r);
//     return get(u, v, tree[id].l, l, mid) + get(u, v, tree[id].r, mid + 1, r);
// }
void hbmt() {
    ll m;
    cin >> m;
    tree.reserve(m * 60);
    tree.push_back(Node());
    ll C = 0;
    FOR(i, 1, m) {
        ll d, x, y;
        cin >> d >> x >> y;
        if(d == 1) {
            C = get(x + C, y + C, 0, 1, 1e9);
            cout << C << '\n';
        }
        else {
            update(x + C, y + C, 0, 1, 1e9);
        }
    }
}

int main() {
    
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);

    #define NAME "hbmt"
    if(fopen(NAME".inp", "r")) {
        freopen(NAME".inp", "r", stdin);
        freopen(NAME".out", "w", stdout);
    }
    
    //int t;cin>>t;while(t--)
    hbmt();
    return 0;
}

Compilation message (stderr)

apple.cpp: In function 'int main()':
apple.cpp:143:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  143 |         freopen(NAME".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
apple.cpp:144:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  144 |         freopen(NAME".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 100 / 100