# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
526254 | tmn2005 | 원숭이와 사과 나무 (IZhO12_apple) | C++17 | 1 ms | 332 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ar array
#define fr first
#define sc second
#define vec vector
#define ret return
#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define int long long
#define pii pair<int,int>
#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()
#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
const int N = 2e6+12,INF = 1e9,mod = 1e9+7;
const int dx[4] = {1, 0,-1, 0}, dy[4] = {0, 1, 0,-1};
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n, m, k, x, y, l, r, o, ans, res, ok, mx, mn = INF;
int a, b, c;
int t[N<<1], lz[N<<1];
void push(int v, int d){
if(!lz[v])ret;
t[v] = d;
if(d > 1){
lz[v*2] = 1;
lz[v*2+1] = 1;
}
lz[v] = 0;
}
int get(int v, int l, int r, int ql, int qr){
if(r < ql || qr < l)
ret 0;
if(ql <= l && r <= qr)
ret t[v];
int m = l + r >> 1;
ret(get(v*2, l, m, ql, qr) + get(v*2+1, m+1, r, ql, qr));
}
void update(int v, int l, int r, int ql, int qr){
push(v, r - l + 1);
if(r < ql || qr < l)
ret;
if(ql <= l && r <= qr){
lz[v] = 1;
push(v, r - l + 1);
ret;
}
int m = l + r >> 1;
update(v*2, l, m, ql, qr);
update(v*2+1, m+1, r, ql, qr);
t[v] = t[v*2] + t[v*2+1];
}
main(){
NeedForSpeed
cin>>n;
for(int i=1; i<=n; i++){
cin>>o>>l>>r;
if(o == 1){
int tmp = get(1, 1, 1e6, l+c, r+c);
cout<<tmp<<"\n";
c = tmp;
}
else{
update(1, 1, 1e6, l+c, r+c);
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |