# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1092574 | Sunbae | Growing Trees (BOI11_grow) | C++17 | 89 ms | 3664 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>
#define z exit(0)
typedef long long ll;
using namespace std;
const int N = 1e5 + 5;
ll bit[N], a[N];
int n;
void upd(int i, ll v){ for(; i<=n; i+=i&-i) bit[i] += v;}
int qry(int i){ ll r = 0; for(; i; i-=i&-i) r += bit[i]; return r;}
void UPD(int l, int r){ upd(l, +1); upd(r+1, -1);}
ll A(int i){ return a[i] + qry(i);}
bool V(int i){ return 1 <= i && i <= n;}
signed main(){
int q; scanf("%d %d", &n, &q);
for(int i = 1; i<=n; ++i) scanf("%lld", a+i);
sort(a+1, a+1+n);
for(int i = 0, c, h, l, r, L, R; i<q; ++i){
char op; scanf(" %c", &op);
if(op == 'F'){
scanf("%d %d", &c, &h);
int low = 1, high = n, st = n+1, ed = -1;
while(low <= high){
int mid = low + ((high-low)>>1);
if(A(mid) >= h) high = mid-1, st = mid;
else low = mid+1;
}
if(st > n) continue;
ed = min(n, st+c-1); c = ed-st+1;
ll val = A(ed);
low = 1; high = ed; l = n+1; r = -1;
while(low <= high){
int mid = low + ((high-low)>>1);
if(A(mid) < val) low = mid+1;
else if(A(mid) == val) high = mid-1, l = mid;
}
low = ed; high = n;
while(low <= high){
int mid = low + ((high-low)>>1);
if(A(mid) > val) high = mid-1;
else if(A(mid) == val) low = mid+1, r = mid;
}
if(l > r) continue;
L = st; R = l-1;
if(V(L) && V(R) && L <= R) UPD(L, R);
int rem = c-l+st;
L = r - rem + 1; R = r;
if(V(L) && V(R) && L <= R) UPD(L, R);
}else{
scanf("%d %d", &l, &r);
int low = 1, high = n; L = n+1; R = -1;
while(low <= high){
int mid = low + ((high-low)>>1);
if(A(mid) >= l) high = mid-1, L = mid;
else low = mid+1;
}
low = 1; high = n;
while(low <= high){
int mid = low + ((high-low)>>1);
if(A(mid) <= r) low = mid+1, R = mid;
else high = mid-1;
}
if(L <= R) printf("%d\n", R-L+1);
else puts("0");
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |