# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#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 rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
vi e; void init(int N) { e = vi(N,-1); }
int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
bool sameSet(int a, int b) { return get(a) == get(b); }
int size(int x) { return -e[get(x)]; }
bool unite(int x, int y) { // union by size
x = get(x), y = get(y); if (x == y) return 0;
if (e[x] > e[y]) swap(x,y);
e[x] += e[y]; e[y] = x; return 1;
}
};
/*
inline namespace Helpers {
//////////// is_iterable
// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
// this gets used only when we can call begin() and end() on that type
tcT, class = void> struct is_iterable : false_type {};
tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
decltype(end(declval<T>()))
>
> : true_type {};
tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
//////////// is_readable
tcT, class = void> struct is_readable : false_type {};
tcT> struct is_readable<T,
typename std::enable_if_t<
is_same_v<decltype(cin >> declval<T&>()), istream&>
>
> : true_type {};
tcT> constexpr bool is_readable_v = is_readable<T>::value;
//////////// is_printable
// // https://nafe.es/posts/2020-02-29-is-printable/
tcT, class = void> struct is_printable : false_type {};
tcT> struct is_printable<T,
typename std::enable_if_t<
is_same_v<decltype(cout << declval<T>()), ostream&>
>
> : true_type {};
tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#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 rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
/*
inline namespace Helpers {
//////////// is_iterable
// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
// this gets used only when we can call begin() and end() on that type
tcT, class = void> struct is_iterable : false_type {};
tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
decltype(end(declval<T>()))
>
> : true_type {};
tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
//////////// is_readable
tcT, class = void> struct is_readable : false_type {};
tcT> struct is_readable<T,
typename std::enable_if_t<
is_same_v<decltype(cin >> declval<T&>()), istream&>
>
> : true_type {};
tcT> constexpr bool is_readable_v = is_readable<T>::value;
//////////// is_printable
// // https://nafe.es/posts/2020-02-29-is-printable/
tcT, class = void> struct is_printable : false_type {};
tcT> struct is_printable<T,
typename std::enable_if_t<
is_same_v<decltype(cout << declval<T>()), ostream&>
>
> : true_type {};
tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
const int N = 3e5 + 5, mx = 1e9;
int t,n,a[N],lazy[40*N],cnt;
struct nod {
int l, r, sum, lazy;
};
nod tree[40 * N];
void push(int node, int le, int ri) {
if (lazy[node]) {
tree[node].sum = lazy[node] * (ri - le + 1);
if (le == ri) return ;
int mid = (le + ri) / 2;
if (!tree[node].l) {
tree[node].l = ++cnt;
}
if (!tree[node].r) {
tree[node].r = ++cnt;
}
lazy[tree[node].l] = lazy[node];
lazy[tree[node].r] = lazy[node];
lazy[node] = 0;
}
}
void update(int node, int le, int ri, int start, int end, int val) {
push(node,le,ri);
if (le > end || ri < start) return ;
if (le >= start && ri <= end) {
lazy[node] = val;
push(node,le,ri);
return ;
} else {
int mid = (le + ri) / 2;
if (!tree[node].l) {
tree[node].l = ++cnt;
}
if (!tree[node].r) {
tree[node].r = ++cnt;
}
update(tree[node].l, le, mid,start,end,val);
update(tree[node].r, mid + 1, ri, start,end,val);
tree[node].sum = tree[tree[node].l].sum + tree[tree[node].r].sum;
}
}
int getans(int node, int le, int ri, int start, int end) {
push(node, le,ri);
if (le > end || ri < start) return 0;
if (le >= start && ri <= end) return tree[node].sum;
int mid = (le + ri) / 2;
if (!tree[node].l) {
tree[node].l = ++cnt;
}
if (!tree[node].r) {
tree[node].r = ++cnt;
}
return getans(tree[node].l,le,mid,start,end) + getans(tree[node].r,mid + 1, ri, start,end);
}
main() {
// std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
int q;
cin>>q;
cnt = 1;
int c = 0;
while (q--) {
int ty;
cin>>ty;
if (ty == 1) {
int le, ri;
cin>>le>>ri;
le += c; ri += c;
c = getans(1,1,mx,le,ri);
cout<<c<<"\n";
} else {
int le, ri;
cin>>le>>ri;
le += c; ri += c;
update(1,1,mx,le,ri,1);
}
}
}
Compilation message
apple.cpp: In function 'void push(int, int, int)':
apple.cpp:191:7: warning: unused variable 'mid' [-Wunused-variable]
191 | int mid = (le + ri) / 2;
| ^~~
apple.cpp: At global scope:
apple.cpp:236:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
236 | main() {
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
21 ms |
3728 KB |
Output is correct |
| 5 |
Correct |
25 ms |
4484 KB |
Output is correct |
| 6 |
Correct |
30 ms |
4396 KB |
Output is correct |
| 7 |
Correct |
25 ms |
4476 KB |
Output is correct |
| 8 |
Correct |
174 ms |
32372 KB |
Output is correct |
| 9 |
Correct |
347 ms |
56564 KB |
Output is correct |
| 10 |
Correct |
384 ms |
63312 KB |
Output is correct |
| 11 |
Correct |
375 ms |
68520 KB |
Output is correct |
| 12 |
Correct |
382 ms |
70872 KB |
Output is correct |
| 13 |
Correct |
359 ms |
87904 KB |
Output is correct |
| 14 |
Correct |
351 ms |
88688 KB |
Output is correct |
| 15 |
Correct |
461 ms |
160140 KB |
Output is correct |
| 16 |
Correct |
498 ms |
161412 KB |
Output is correct |
| 17 |
Correct |
390 ms |
91884 KB |
Output is correct |
| 18 |
Correct |
353 ms |
91876 KB |
Output is correct |
| 19 |
Correct |
507 ms |
165192 KB |
Output is correct |
| 20 |
Correct |
475 ms |
165128 KB |
Output is correct |
