#include <bits/stdc++.h>using namespace std;typedef struct Node Node;typedef struct Range Range;struct Node//线段树{int z,b;//节点紫花白花};struct Range//存数据{int p,x,a,b,c,d;//p-1或2 1:[a,b] [c,d] 2:x};map <int,int> hs;//重标号哈希int pt[1200012];//重标号Node tr[4800048];//线段树Range rg[300003];//预存数据离散处理int tp;//重标号结点数void SetTree(int site,int l,int r)//建空树{if(l == r){tr[site].z = tr[site].b = 0;return;}int mid = (l+r)>>1;SetTree(site<<1,l,mid);SetTree(site<<1|1,mid+1,r);tr[site].b = tr[site].z = 0;}void Add(int site,int l,int r,int ll,int rr,int z,int b)//更新树{if(l == ll && r == rr){tr[site].z += z;tr[site].b += b;//printf("%d %d z%d b%d\n",l,r,tr[site].z,tr[site].b);return;}int mid = (l+r)>>1;if(mid >= rr) Add(site<<1,l,mid,ll,rr,z,b);else if(mid < ll) Add(site<<1|1,mid+1,r,ll,rr,z,b);else{Add(site<<1,l,mid,ll,mid,z,b);Add(site<<1|1,mid+1,r,mid+1,rr,z,b);}}void Search(int site,int l,int r,int x)//查值{if(l == r){printf("%d %d\n",tr[site].z,tr[site].b);return;}int mid = (l+r)>>1;tr[site<<1].z += tr[site].z;tr[site<<1].b += tr[site].b;tr[site<<1|1].z += tr[site].z;tr[site<<1|1].b += tr[site].b;tr[site].z = tr[site].b = 0;if(pt[mid] >= x) Search(site<<1,l,mid,x);else Search(site<<1|1,mid+1,r,x);}int main(){int n,a,b,x,i,j;while(~scanf("%d",&n)){hs.clear();tp = 0;for(i = 0; i < n; ++i){scanf("%d",&rg[i].p);if(rg[i].p == 2){scanf("%d",&rg[i].x);}else{scanf("%d %d %d",&rg[i].a,&a,&b);rg[i].b = rg[i].a+a-1;rg[i].c = rg[i].b+1;rg[i].d = rg[i].b+b;//[a,b] = [d,d+a-1] 紫花 [c,d] [d+a,d+a+b-1] 白花pt[tp++] = rg[i].a;pt[tp++] = rg[i].b;pt[tp++] = rg[i].c;pt[tp++] = rg[i].d;}}sort(pt,pt+tp);for(i = -1, j = 0; j < tp; ++j)//去重{if(i != -1 && pt[j] == pt[i]) continue;pt[++i] = pt[j];hs[pt[i]] = i;}tp = i;//for(i = 0; i <= tp; ++i) printf("%d %d\n",pt[i],hs[pt[i]]);SetTree(1,0,tp);for(i = 0; i < n; ++i){if(rg[i].p == 1){//printf("%d:%d %d:%d %d:%d %d:%d\n",rg[i].a,hs[rg[i].a],rg[i].b,hs[rg[i].b],rg[i].c,hs[rg[i].c],rg[i].d,hs[rg[i].d]);Add(1,0,tp,hs[rg[i].a],hs[rg[i].b],1,0);//[a,b] 紫花++Add(1,0,tp,hs[rg[i].c],hs[rg[i].d],0,1);//[c,d] 白花++}else{if(rg[i].x > pt[tp] || rg[i].x < pt[0]) puts("0 0");//由于x查到左右端点 可能查出范围 特判一下else Search(1,0,tp,rg[i].x);}}}return 0;}
，不要害怕错过什么，因为在路上你就已经收获了自由自在的好心情。
