题目大意:给定一些形如ax+b>c的不等式,支持插入和修改,以及询问当x=k时有多少不等式成立
题解:树状数组+大力特判
Orz lych
我的收获:特判!
//orz lych
#include<iostream>
#include<cstdio>
#include<cmath>
#define n 2000001
using namespace std;
int c[2000005],x[100005],y[100005]; bool vis[100005];
int read(){
int x=0,f=1; char ch=getchar();
while ((ch<'0' || ch>'9') && ch!='-') ch=getchar();
if (ch=='-'){ f=-1; ch=getchar(); }
while (ch>='0' && ch<='9'){ x=x*10+ch-'0'; ch=getchar(); }
return x*f;
}
void add(int u,int t){
for (; u<=n; u+=u&(-u)) c[u]+=t;
}
void mdy(int u,int v,int t){
if (u>v) return; u=max(u,1); v=min(v,n);
add(u,t); add(v+1,-t);
}
int getsum(int u){
int sum=0; for (; u; u-=u&(-u)) sum+=c[u]; return sum;
}
int main(){
int cas,i=0; scanf("%d",&cas);
while (cas--){
char ch=getchar(); while (ch<'A' || ch>'Z') ch=getchar();
if (ch=='A'){
int u=read(),v=read(),w=read(); i++;
if (u<0){ x[i]=1; y[i]=ceil((double)(w-v)/u)+1000000; } else
if (u>0){ x[i]=floor((double)(w-v)/u)+1000002; y[i]=n; } else
if (v>w){ x[i]=1; y[i]=n; } else{ x[i]=2; y[i]=1; }
mdy(x[i],y[i],1);
} else if (ch=='D'){
int k=read(); if (vis[k]) continue;
vis[k]=1; mdy(x[k],y[k],-1);
} else printf("%d\n",getsum(read()+1000001));
}
return 0;
}