/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
const int N = 105;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int s, n, m, k, ans;
vpii tree;
vii ff;
void push(int x, int lx, int rx){
if(lx == rx || !ff[x])return;
int len = (rx - lx+1)/2;
tree[(x<<1)+1].ff = tree[x].ff;
tree[(x<<1)].ff = tree[x].ff;
tree[x<<1].ss = tree[x<<1].ff * len;
tree[(x<<1)+1].ss = tree[(x<<1)+1].ff * len;
ff[x<<1] = ff[(x<<1)+1] = ff[x];
ff[x] = 0;
tree[x].ff = 0;
tree[x].ss = tree[x<<1].ss + tree[(x<<1)+1].ss;
}
void update(int l, int r, int v, int lx, int rx, int x){
//cout<<lx<<" "<<rx<<endl;
push(x, lx, rx);
if(lx > r || rx < l) return;
if(lx >= l && rx <= r){
tree[x].ff = v;
ff[x] = 1;
tree[x].ss = (rx - lx + 1)*v;
//cout<<lx<<" "<<rx<<" "<<tree[x].ss<<endl;
return;
}
int m =(lx + rx)>>1;
update(l, r, v, lx, m, x*2);
update(l, r, v, m+1, rx, x*2+1);
tree[x].ss = tree[x*2].ss + tree[x*2+1].ss;
}
int find(int l, int r, int lx, int rx, int x){
push(x, lx, rx);
if(lx > r || rx < l) return 0;
if(lx >= l && rx <= r) return tree[x].ss;
int m = (lx + rx)/2;
int res = find(l, r, lx, m, x*2);
res += find(l, r, m+1, rx, x*2+1);
return res;
}
void solve(){
fastios
s = 2, n = (1e7+5);
while(s < n) s<<=1;
tree.assign(s*2, {0, 0});
ff.assign(s*2, 0);
cin>>m;
int c = 0;
for(int i=0;i<m;i++){
int t;
cin>>t;
if(t == 1){
int l, r;
cin>>l>>r;
c = find(l+c, r+c, 1, s, 1);
cout<<c<<endl;
}else{
int l, r;
cin>>l>>r;
update(l+c, r+c, 1, 1, s, 1);
}
/*cout<<tree[1].ss<<endl;
for(int i=s;i<=s+11;i++) cout<<tree[i].ss<<" ";
cout<<endl;*/
}
return;
}
int main(){
fastios
int t = 1;
if(t) solve();
else {
cin>>t;
while (t--) solve();
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
150 ms |
262148 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
