Submission #547119

#	Time	Username	Problem	Language	Result	Execution time	Memory
547119		Soul234	Monkey and Apple-trees (IZhO12_apple)	C++14	100 / 100	318 ms	140656 KiB

apple

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

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

const int SZ = 1<<30;
tcT> struct node {
    T val = 0, lzy = 0; node<T>* c[2];
    node() { c[0] = c[1] = NULL; }
    void push(int L, int R, int mid) {
        if(!lzy) return;
        if(!c[0]) c[0] = new node();
        c[0]->val = mid-L+1;
        c[0]->lzy = lzy;
        if(!c[1]) c[1] = new node();
        c[1]->val = R-mid;
        c[1]->lzy = lzy;
    }
    void upd(int l, int r, int L = 0, int R = SZ-1) {
        if(L > r || R < l) return;
        if(l <= L && R <= r) {
            val = (R-L+1);
            lzy = 1;
            return;
        }
        int M = (L+R)>>1;
        push(L,R,M);
        if(!c[0]) c[0] = new node();
        c[0]->upd(l, r, L, M);
        if(!c[1]) c[1] = new node();
        c[1]->upd(l ,r, M+1, R);
        val = 0;
        F0R(i,2) if(c[i]) val += c[i]->val;
    }
    T query(int l, int r, int L = 0, int R = SZ-1) {
        if(L > r || R < l) return 0;
        if(l <= L && R <= r) return val;
        int M = (L + R) >> 1; T ans = 0;
        push(L,R,M);
        if(c[0]) ans += c[0]->query(l, r, L, M);
        if(c[1]) ans += c[1]->query(l, r, M+1, R);
        return ans;
    }
};

void solve() {
    node<int>* st = new node<int>();
    int Q;
    cin>>Q;
    int C = 0;
    F0R(_,Q) {
        int t, l, r;
        cin>>t>>l>>r;
        if(t == 1) {
            C = st->query(l+C, r+C);
            cout << C << nl;
        }
        else st->upd(l+C, r+C);
    }
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message (stderr)

apple.cpp: In function 'void setIO(std::string)':
apple.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
apple.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 100 / 100