#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll int, ll int>
#define ff first
#define ss second
#define pb push_back
#pragma GCC optimize("O2")
using namespace std;
// debug template
#ifdef POTATO
#include "debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
#define debug(...)
#endif
// convenient functions
inline void yes() { cout << "YES" << endl; return; }
inline void no() { cout << "NO" << endl; return; }
template <class T>
inline void out(T temp) { cout << temp << endl; return; }
// globals
#define int long long
struct node {
int ans, l, r;
bool all;
node *left, *right;
node(int l_, int r_): ans(0), l(l_), r(r_), all(false), left(nullptr), right(nullptr) {};
};
const int MAX = 1e9;
node *seg = new node(1, MAX);
void pushdown(node *cur) {
int mid = (cur->l + cur->r) >> 1;
if (cur->left == nullptr) cur->left = new node(cur->l, mid);
if (cur->right == nullptr) cur->right = new node(mid + 1, cur->r);
if (cur->all) {
cur->left->ans = mid - cur->l + 1;
cur->right->ans = cur->r - mid;
}
}
void update(int tl, int tr, node *cur = seg) {
if (tl <= cur->l && cur->r <= tr) {
cur->ans = (cur->r - cur->l + 1);
cur->all = true;
return;
}
pushdown(cur);
int mid = (cur->l + cur->r) >> 1;
if (tl <= mid) update(tl, tr, cur->left);
if (tr > mid) update(tl, tr, cur->right);
cur->ans = cur->left->ans + cur->right->ans;
}
int query(int tl, int tr, node *cur = seg) {
if (tl <= cur->l && cur->r <= tr) {
return cur->ans;
}
pushdown(cur);
int mid = (cur->l + cur->r) >> 1;
int res = 0;
if (tl <= mid) res += query(tl, tr, cur->left);
if (tr > mid) res += query(tl, tr, cur->right);
return res;
}
void init() {
// initialize
}
void solve(int &case_no) {
// solve
int q;
cin >> q;
int C = 0;
while (q--) {
int cmd, l, r;
cin >> cmd >> l >> r;
if (cmd == 1) {
C = query(l + C, r + C);
cout << C << endl;
} else if (cmd == 2) {
update(l + C, r + C);
}
}
}
int32_t main() {
#ifdef POTATO
assert(freopen("input.txt", "r", stdin));
// assert(freopen("output.txt", "w", stdout));
#endif
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
srand(time(NULL));
#ifdef POTATO
auto start = chrono::high_resolution_clock::now();
#endif
init();
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) solve(i);
#ifdef POTATO
auto end = chrono::high_resolution_clock::now();
cerr << "Execution time: "
<< chrono::duration_cast<chrono::milliseconds>(end - start).count()
<< " ms" << endl;
#endif
}
/*
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
