Submission #1096475

#	Time	Username	Problem	Language	Result	Execution time	Memory
1096475		Bahamin	Monkey and Apple-trees (IZhO12_apple)	C++17	100 / 100	443 ms	233100 KiB

apple

#include <bits/stdc++.h>

using namespace std;

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

#define ar array
#define ll long long
#define ld long double
#define sze(x) ((ll)x.size())
#define all(a) (a).begin(), (a).end()
#define sui cout.tie(NULL); cin.tie(NULL); ios_base::sync_with_stdio(false)
#define mset(a, x) memset(a, x, sizeof(a))
#define lid childs[id].first
#define rid childs[id].second
#define mid ((r + l) >> 1)
typedef priority_queue <ll, vector<ll>, greater<ll> > max_heap;
typedef priority_queue <ll> min_heap;
const ll MAX_N = 1e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;
const ll LOG = 30;

vector<pair<ll, ll>> childs;
vector<ll> seg;
vector<ll> ops;

void create(ll l, ll r, ll id)
{
    if (childs[id].first || l == r - 1) return;
    childs[id].first = childs.size();
    childs.push_back(make_pair(0, 0));
    seg.push_back(0);
    ops.push_back(-1);
    childs[id].second = childs.size();
    childs.push_back(make_pair(0, 0));
    seg.push_back(0);
    ops.push_back(-1);
}

void move(ll l, ll r, ll id)
{
    create(l, r, id);
    if (l == r - 1 || ops[id] == -1) return;
    seg[lid] = (mid - l) * ops[id];
    seg[rid] = (r - mid) * ops[id];
    ops[lid] = ops[id];
    ops[rid] = ops[id];
    ops[id] = -1;
}

void upd(ll s, ll t, ll x, ll l, ll r, ll id)
{
    move(l, r, id);
    //cout << l << " " << r << " " << x << endl;
    if (s <= l && t >= r)
    {
        ops[id] = x;
        seg[id] = (r - l) * x;
        return;
    }
    if (s < mid) upd(s, t, x, l, mid, lid);
    if (t > mid) upd(s, t, x, mid, r, rid);
    seg[id] = seg[lid] + seg[rid];
}

ll get(ll s, ll t, ll l, ll r, ll id)
{
    move(l, r, id);
    if (s <= l && t >= r) return seg[id];
    if (s >= r || t <= l) return 0;
    return get(s, t, l, mid, lid) + get(s, t, mid, r, rid);
}

void solve() {
    ll m;
    cin >> m;
    ll c = 0;
    childs.push_back({0, 0});
    seg.push_back(0);
    ops.push_back(-1);
    while (m--)
    {
        ll d, x, y;
        cin >> d >> x >> y;
        x += c;
        y += c;
        if (d == 1)
        {
            ll ans = get(x, y + 1, 0, 1e9 + 1, 0);
            cout << ans << "\n";
            c = ans;
            //upd(x, y + 1, 0, 0, 1e9 + 1, 0);
        } else 
        {
            upd(x, y + 1, 1, 0, 1e9 + 1, 0);
        }
    }
}

int main() {
    sui;
    ll tc = 1;
    //cin >> tc;
    for (ll t = 1; t <= tc; t++) {
        solve();
    }
}

• Subtask 1: 100 / 100