#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
int a,b;
int operator()(const int x)const{
return a*x+b;
}
};
bool check(line l1,line l2,line l3){
return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
struct node{
int l,r,sum;
bool tag;
node():l(-1),r(-1),sum(0),tag(0){}
};
const int mxn=1e5+5;
node seg[mxn<<6];
int cnt=0;
void push(int x,int l,int r){
if(seg[x].l==-1){
seg[x].l=++cnt;
}
if(seg[x].r==-1){
seg[x].r=++cnt;
}
if(l==r or seg[x].tag==0)return;
int mm=l+r>>1;
seg[x].tag=0;
seg[seg[x].l].tag=seg[seg[x].r].tag=1;
seg[seg[x].l].sum=mm-l+1;
seg[seg[x].r].sum=r-mm;
}
void modify(int id,int l,int r,int ql,int qr){
if(qr<l or r<ql){
return;
}
if(ql<=l and r<=qr){
seg[id].tag=1;
seg[id].sum=r-l+1;
return;
}
push(id,l,r);
int mm=l+r>>1;
modify(seg[id].l,l,mm,ql,qr);
modify(seg[id].r,mm+1,r,ql,qr);
seg[id].sum=seg[seg[id].l].sum+seg[seg[id].r].sum;
}
int query(int id,int l,int r,int ql,int qr){
if(qr<l or r<ql){
return 0;
}
if(ql<=l and r<=qr){
return seg[id].sum;
}
push(id,l,r);
int mm=l+r>>1;
return query(seg[id].l,l,mm,ql,qr)+query(seg[id].r,mm+1,r,ql,qr);
}
signed main(){
setio();
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n;
cin>>n;
int prev=0;
for(int i=0;i<n;i++){
int ty,x,y;
cin>>ty>>x>>y;
x+=prev;
y+=prev;
if(ty==1){
prev=query(0,1,1e9,x,y);
cout<<prev<<'\n';
}
else{
modify(0,1,1e9,x,y);
}
}
}
/*
input:
*/
Compilation message
apple.cpp: In function 'void push(long long int, long long int, long long int)':
apple.cpp:70:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
70 | int mm=l+r>>1;
| ~^~
apple.cpp: In function 'void modify(long long int, long long int, long long int, long long int, long long int)':
apple.cpp:86:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
86 | int mm=l+r>>1;
| ~^~
apple.cpp: In function 'long long int query(long long int, long long int, long long int, long long int, long long int)':
apple.cpp:99:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
99 | int mm=l+r>>1;
| ~^~
apple.cpp: In function 'void setIO(std::string)':
apple.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
42 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
apple.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
43 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
66 ms |
200664 KB |
Output is correct |
| 2 |
Correct |
33 ms |
200792 KB |
Output is correct |
| 3 |
Correct |
32 ms |
200620 KB |
Output is correct |
| 4 |
Correct |
37 ms |
200740 KB |
Output is correct |
| 5 |
Correct |
39 ms |
200872 KB |
Output is correct |
| 6 |
Correct |
42 ms |
201040 KB |
Output is correct |
| 7 |
Correct |
38 ms |
200784 KB |
Output is correct |
| 8 |
Correct |
85 ms |
200824 KB |
Output is correct |
| 9 |
Correct |
151 ms |
201180 KB |
Output is correct |
| 10 |
Correct |
165 ms |
201360 KB |
Output is correct |
| 11 |
Correct |
151 ms |
201036 KB |
Output is correct |
| 12 |
Correct |
156 ms |
201128 KB |
Output is correct |
| 13 |
Correct |
135 ms |
201300 KB |
Output is correct |
| 14 |
Correct |
135 ms |
201300 KB |
Output is correct |
| 15 |
Correct |
185 ms |
201560 KB |
Output is correct |
| 16 |
Correct |
201 ms |
202728 KB |
Output is correct |
| 17 |
Correct |
138 ms |
202836 KB |
Output is correct |
| 18 |
Correct |
141 ms |
202832 KB |
Output is correct |
| 19 |
Correct |
191 ms |
202660 KB |
Output is correct |
| 20 |
Correct |
184 ms |
202828 KB |
Output is correct |
