#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename num_t>
using ordered_set = tree<num_t, null_type, less<num_t>, rb_tree_tag, tree_order_statistics_node_update>;
#ifdef pikachu
#include "welcome_to_python_is_slower_than_c++_club.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define debug(...) 69
#endif
template<typename T1, typename T2>istream& operator>>(istream& in, pair<T1, T2>& a) { return in >> a.first >> a.second; }
template<typename T1, typename T2>ostream& operator<<(ostream& out, pair<T1, T2> a) { return out << a.first << " " << a.second;}
template<typename T> void print(T t) { cout << t <<' '; }
template<typename T, typename... Args> void print(T t, Args... args) { print(t);print(args...); }
string operator*=(string& s, int cnt) { string t = s;for (size_t i = 1; i < cnt; i++)s += t;return s; }
string operator*(string s, int cnt) { return s *= cnt; }
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).rend()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define len(x) (int)((x).size())
#define bk back()
#define elif else if
#define add insert
#define append push_back
#define pop pop_back
#define str string
#define in :
#define fr first
#define sc second
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>b;i--)
#define el '\n'
#define printl(arg) cout << arg << endl
// #define print(arg) cout << arg
#define inputa(arg) for (auto& e : arg) cin >> e
#define printa(arg) for (auto& e : arg) print(e);
#define printr(arg) { printl(arg);return; }
#define printd(arg) printf("%0.3lf\n", arg)
const int mod=1e9+7;
const int INF=1e18;
const int MAX_N= 2e5+10;
int n,m,k,x,y,z,t,q,counter;
int s_tree[MAX_N*4],lazy[MAX_N*4];
int lazy_def=0;
vi a;
int ans;
void build_seg(int i_tree,int left,int right){
if(left==right){
s_tree[i_tree]=a[left];
}else{
int mid=(left+right)/2;
build_seg(i_tree*2,left,mid);
build_seg(i_tree*2+1,mid+1,right);
s_tree[i_tree]=max(s_tree[i_tree*2],s_tree[i_tree*2+1]);
}
}
void solve_lazy(int i_tree,int left ,int right,int vl){
s_tree[i_tree]+=vl;
if(left!=right){
lazy[i_tree*2]+=vl;
lazy[i_tree*2+1]+=vl;
}
lazy[i_tree]=lazy_def;
}
void update(int i_tree,int left,int right,int l,int r,int vl){
if(lazy[i_tree]!=lazy_def){
solve_lazy(i_tree,left,right,lazy[i_tree]);
}
if(right<l or left>r) return;
if(l<=left and right<=r){
solve_lazy(i_tree,left,right,vl);
return;
}
int mid=(left+right)/2;
update(i_tree*2,left,mid,l,r,vl);
update(i_tree*2+1,mid+1,right,l,r,vl);
s_tree[i_tree]=max(s_tree[i_tree*2],s_tree[i_tree*2+1]);
}
void query(int i_tree,int left,int right,int vl){
if(lazy[i_tree]!=lazy_def){
solve_lazy(i_tree,left,right,lazy[i_tree]);
}
if (s_tree[i_tree]<vl) return;
if(left==right){
ans=left;
return;
}
int mid=(left+right)/2;
if(lazy[i_tree*2]!=lazy_def){
solve_lazy(i_tree*2,left,mid,lazy[i_tree*2]);
}
if(s_tree[i_tree*2]>=vl){
query(i_tree*2,left,mid,vl);
return;
}
if(lazy[i_tree*2 +1]!=lazy_def){
solve_lazy(i_tree*2 + 1,mid+1,right,lazy[i_tree*2 + 1]);
}
query(i_tree*2+1,mid+1,right,vl);
}
void get(int i_tree,int left,int right,int i){
if(i<left or i>right) return;
if(lazy[i_tree]!=lazy_def){
solve_lazy(i_tree,left,right,lazy[i_tree]);
}
if(left==right){
ans=s_tree[i_tree];
return;
}
int mid=(left+right)/2;
get(i_tree*2,left,mid,i);
get(i_tree*2+1,mid+1,right,i);
}
void code(){
cin>>n>>m;
a.resize(n);
inputa(a);
sort(all(a));
build_seg(1,0,n-1);
while(m--){
char c;
cin>>c>>x>>y;
if(c=='F'){
int f,m,mv,l;
ans=n;
query(1,0,n-1,y);
if (ans==n) continue;
f=ans;
if(f+x>=n){
update(1,0,n-1,f,n-1,1);
continue;
}
get(1,0,n-1,f+x-1);
mv=ans;
query(1,0,n-1,mv);
m=ans;
ans=n;
query(1,0,n-1,mv+1);
l=ans-1;
int z=l-(x-(m-f))+1;
debug(f,m,mv,z,l,f+x-1);
update(1,0,n-1,f,m-1,1);
update(1,0,n-1,z,l,1);
}else{
ans=n;
query(1,0,n-1,x);
if(ans==n){
cout<<0<<el;
continue;
}
int f=ans;
ans=n;
query(1,0,n-1,y+1);
ans-=1;
debug(f,ans);
cout<<ans-f+1<<el;
}
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
// freopen("cardgame.in", "r", stdin);
// freopen("cardgame.out", "w", stdout);
int t = 1;
// cin>>t;
while(t--) code();
return 0;
}
Compilation message
grow.cpp: In function 'std::string operator*=(std::string&, int)':
grow.cpp:24:75: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
24 | string operator*=(string& s, int cnt) { string t = s;for (size_t i = 1; i < cnt; i++)s += t;return s; }
| ~~^~~~~
grow.cpp: In function 'void code()':
grow.cpp:16:24: warning: statement has no effect [-Wunused-value]
16 | #define debug(...) 69
| ^~
grow.cpp:193:21: note: in expansion of macro 'debug'
193 | debug(f,m,mv,z,l,f+x-1);
| ^~~~~
grow.cpp:16:24: warning: statement has no effect [-Wunused-value]
16 | #define debug(...) 69
| ^~
grow.cpp:210:21: note: in expansion of macro 'debug'
210 | debug(f,ans);
| ^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
84 ms |
6380 KB |
Output is correct |
| 2 |
Correct |
139 ms |
6748 KB |
Output is correct |
| 3 |
Correct |
53 ms |
6720 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
Output is correct |
| 2 |
Correct |
2 ms |
332 KB |
Output is correct |
| 3 |
Correct |
2 ms |
460 KB |
Output is correct |
| 4 |
Correct |
2 ms |
332 KB |
Output is correct |
| 5 |
Correct |
46 ms |
1612 KB |
Output is correct |
| 6 |
Correct |
56 ms |
1900 KB |
Output is correct |
| 7 |
Correct |
6 ms |
716 KB |
Output is correct |
| 8 |
Correct |
28 ms |
1384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
50 ms |
1856 KB |
Output is correct |
| 2 |
Correct |
57 ms |
2168 KB |
Output is correct |
| 3 |
Correct |
2 ms |
460 KB |
Output is correct |
| 4 |
Correct |
35 ms |
1488 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
46 ms |
2060 KB |
Output is correct |
| 2 |
Correct |
60 ms |
1956 KB |
Output is correct |
| 3 |
Correct |
10 ms |
748 KB |
Output is correct |
| 4 |
Correct |
55 ms |
1984 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
83 ms |
3988 KB |
Output is correct |
| 2 |
Correct |
124 ms |
6296 KB |
Output is correct |
| 3 |
Correct |
16 ms |
1868 KB |
Output is correct |
| 4 |
Correct |
44 ms |
6312 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
122 ms |
6328 KB |
Output is correct |
| 2 |
Correct |
125 ms |
6468 KB |
Output is correct |
| 3 |
Correct |
51 ms |
6500 KB |
Output is correct |
| 4 |
Correct |
16 ms |
1832 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
85 ms |
6212 KB |
Output is correct |
| 2 |
Correct |
85 ms |
6388 KB |
Output is correct |
| 3 |
Correct |
52 ms |
6704 KB |
Output is correct |
| 4 |
Correct |
19 ms |
1868 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
132 ms |
6852 KB |
Output is correct |
| 2 |
Correct |
125 ms |
6372 KB |
Output is correct |
| 3 |
Correct |
37 ms |
5912 KB |
Output is correct |
| 4 |
Correct |
71 ms |
6212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
124 ms |
6580 KB |
Output is correct |
| 2 |
Correct |
118 ms |
6808 KB |
Output is correct |
| 3 |
Correct |
186 ms |
6988 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
103 ms |
7512 KB |
Output is correct |
