1 条题解
-
0
luogu
#include<cstdio> #include<iostream> #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; using namespace std; struct node{ int v,id; node(int a,int b){v=a;id=b;} bool operator >(node b) const {return v==b.v?id>b.id:v>b.v;} }; tree<node,null_type,greater<node>,rb_tree_tag,tree_order_statistics_node_update> T,TE; int main(){ int n,m,k,s=0,q,ans=0; char c[10]; scanf("%d%d",&n,&m); while(n--){ cin>>c[0];scanf("%d",&k); if(*c=='I') {k+=s;if(k>=m) T.insert(node(k,n));} else if(*c=='A') m-=k,s-=k; else if(*c=='S'){ m+=k,s+=k; T.split(node(m,-1),TE); ans+=TE.size(); } else if(*c=='F') printf(k>T.size()?"-1\n":"%d\n",T.find_by_order(k-1)->v-s); } printf("%d\n",ans); return 0; } ///test
- 1
信息
- ID
- 485
- 时间
- 1000ms
- 内存
- 125MiB
- 难度
- 5
- 标签
- 递交数
- 12
- 已通过
- 6
- 上传者