#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt,avx2")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(1e6)+100;
const int M = ll(2e5) + 100;
const long long inf = 2e18;
//const long double eps = 1e-15L;
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
#define int ll
int m;
int t[N * 4];
bool u[N * 4];
void push(int v, int tl, int tr) {
if(u[v]) {
t[v] = tr - tl + 1;
if(tl != tr) {
u[v + v] |= u[v];
u[v + v + 1] |= u[v];
}
u[v] = 0;
}
}
void update(int v, int tl, int tr, int l, int r) {
push(v, tl, tr);
if(l > tr || tl > r) return;
if(l <= tl && tr <= r) {
u[v] = 1;
push(v, tl, tr);
return;
}
int tm = (tl + tr) / 2;
update(v + v, tl, tm, l, r);
update(v + v + 1, tm + 1, tr, l, r);
t[v] = t[v + v] + t[v + v + 1];
}
int get(int v, int tl, int tr, int l, int r) {
push(v, tl, tr);
if(tl > r || l > tr) return 0;
if(l <= tl && tr <= r) return t[v];
int tm = (tl + tr) / 2;
return get(v + v, tl, tm, l, r) + get(v + v + 1, tm + 1, tr, l, r);
}
void Baizho() {
cin>>m;
int c = 0;
while(m --) {
int d, x, y; cin>>d>>x>>y;
x += c, y += c;
if(y >= N) assert(0);
if(d == 1) {
c = get(1, 1, N, x, y);
cout<<c<<"\n";
} else {
update(1, 1, N, x, y);
}
}
}
signed main() {
// Freopen("nondec");
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// precalc();
int ttt = 1;
// cin>>ttt;
for(int i=1; i<=ttt; i++) {Baizho(); }
}
Compilation message
apple.cpp: In function 'void Freopen(std::string)':
apple.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
apple.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
8536 KB |
Output is correct |
| 2 |
Correct |
1 ms |
8540 KB |
Output is correct |
| 3 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 4 |
Correct |
12 ms |
16572 KB |
Output is correct |
| 5 |
Correct |
11 ms |
21080 KB |
Output is correct |
| 6 |
Correct |
11 ms |
20568 KB |
Output is correct |
| 7 |
Correct |
12 ms |
20316 KB |
Output is correct |
| 8 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 6 |
| 9 |
Halted |
0 ms |
0 KB |
- |
