#include<iostream>
#include<algorithm>
#define int int64_t
using namespace std;
const int N=7e3+7;
int a[N],n,q;
void order(int c,int h)
{
int d=c,s=0,x=-1,p=1e18;
for(int i=0;i<n&&d;i++)
{
if(a[i]>=h)
{
if(p==1e18) p=i;
if(i==0) s=1,x=a[i];
else if(a[i]!=a[i-1]) s=1,x=a[i];
else s++;
d--;
}
}
d=c;
for(int i=n-1;i>=0&&i>=p;i--)
{
if(a[i]==x&&s) a[i]++,s--,d--;
else if(a[i]!=x&&d<c) a[i]++,d--;
}
}
signed main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin>>n>>q;
for(int i=0;i<n;i++) cin>>a[i];
sort(a,a+n);
while(q--)
{
char ty; cin>>ty;
if(ty=='F')
{
int c,h; cin>>c>>h;
order(c,h);
}
else{
int mn,mx; cin>>mn>>mx;
int p1=lower_bound(a,a+n,mn)-a;
int p2=upper_bound(a,a+n,mx)-a;
cout<<p2-p1<<endl;
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
348 KB |
Output is correct |
2 |
Correct |
5 ms |
348 KB |
Output is correct |
3 |
Correct |
5 ms |
348 KB |
Output is correct |
4 |
Correct |
4 ms |
348 KB |
Output is correct |
5 |
Correct |
114 ms |
1396 KB |
Output is correct |
6 |
Correct |
158 ms |
1536 KB |
Output is correct |
7 |
Correct |
21 ms |
580 KB |
Output is correct |
8 |
Correct |
100 ms |
1104 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
166 ms |
724 KB |
Output is correct |
2 |
Correct |
221 ms |
1860 KB |
Output is correct |
3 |
Correct |
15 ms |
348 KB |
Output is correct |
4 |
Correct |
115 ms |
1616 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
237 ms |
836 KB |
Output is correct |
2 |
Correct |
197 ms |
1620 KB |
Output is correct |
3 |
Correct |
84 ms |
604 KB |
Output is correct |
4 |
Correct |
194 ms |
1672 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |