#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
using namespace std;
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
char t;
ll n, q, x, y;
ll const INF = 1e13;
struct node{
int s, e, m;
ll val, minn;
ll lazy;
node *l, *r;
node (int S, int E)
{
s = S, e = E, m = (s+e)/2;
val = 0;
lazy = 0;
l=r=nullptr;
}
void create()
{
if(s != e && l==nullptr)
{
l = new node(s, m);
r = new node(m+1, e);
}
}
void propogate()
{
if (lazy==0) return;
create();
val+=lazy;
minn+=lazy;
if (s != e){
l->lazy+=lazy;
r->lazy+=lazy;
}
lazy=0;
}
void update(int S, int E, ll V)
{
propogate();
if(s==S && e==E) lazy += V;
else{
create();
if(E <= m) l->update(S, E, V);
else if (m < S) r->update(S, E, V);
else l->update(S, m, V),r->update(m+1, E, V);
l->propogate(),r->propogate();
val = max(l->val, r->val);
minn = min(l->minn, r->minn);
}
}
ll query(int S)
{
propogate();
if(s == S) {return val; }
create();
l-> propogate(); r->propogate();
if(S <= m){ return l->query(S);}
else if(S >= m+1) {return r->query(S);}
}
ll bsmin(ll V) // find lowest ind with val>=V
{
propogate();
if (s==e) return (val>=V)?s:INF;
create();
l->propogate(); r->propogate();
if (l->val>=V) return l->bsmin(V);
else return r->bsmin(V);
}
ll bsmax(ll V)// find highest ind with val<=V
{
propogate();
if (s==e) return (val<=V)?s:-INF;
create();
l->propogate(); r->propogate();
if (r->minn<=V) return r->bsmax(V);
else return l->bsmax(V);
}
} *root;
int main()
{
input2(n, q);
ll arr[n];
for (ll i=0; i<n; ++i) input(arr[i]);
sort(arr, arr+n);
root = new node(0, n-1);
for (ll i=0; i<n; ++i) root->update(i, i, arr[i]);
while (q--)
{
cin >> t >> x >> y;
if (t=='F')//update
{
ll start = root->bsmin(y);
ll end = start+x-1;
if (start==INF) continue;
if (end>=n-1) {root->update(start, n-1, 1); continue;}
ll maxele = root->query(end);
ll l = root->bsmin(maxele);
ll r = root->bsmax(maxele);
if (start<=l-1) root->update(start, l-1, 1);
ll left = x-max(0LL, l-start);
if (left>0) root->update(r-left+1, r, 1);
}
else
{
ll ans = max(0LL, root->bsmax(y)-root->bsmin(x)+1);
print(ans, '\n');
}
}
return 0;
}
Compilation message
grow.cpp: In function 'int main()':
grow.cpp:12:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
12 | #define input2(x, y) scanf("%lld%lld", &x, &y);
| ~~~~~^~~~~~~~~~~~~~~~~~~~
grow.cpp:121:2: note: in expansion of macro 'input2'
121 | input2(n, q);
| ^~~~~~
grow.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
11 | #define input(x) scanf("%lld", &x);
| ~~~~~^~~~~~~~~~~~
grow.cpp:123:25: note: in expansion of macro 'input'
123 | for (ll i=0; i<n; ++i) input(arr[i]);
| ^~~~~
grow.cpp: In member function 'll node::query(int)':
grow.cpp:92:5: warning: control reaches end of non-void function [-Wreturn-type]
92 | }
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
142 ms |
12112 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
3 ms |
604 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
156 ms |
1400 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
161 ms |
1368 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
128 ms |
9092 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
161 ms |
10396 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
127 ms |
11116 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
187 ms |
11904 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
203 ms |
11920 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
239 ms |
13884 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
