HDU 4022 Bombing (STL)

题意：
给出包含N个点的点集和M次操作

对于每个操作 w z

w=1时 删除 坐标y=z的点，并输出个数

w=0时 删除 坐标x=z的点，并输出个数

思路：

AVL树问题，STL实现即可

代码：

#include <bits/stdc++.h>

using namespace std;
const int INF=0x3f3f3f3f;
typedef struct Node{
    int k1;
    int k2;
    Node(int kk1=0,int kk2=0){k1=kk1;k2=kk2;}
    bool operator <(const Node &a)const{
        if(a.k1==k1)
            return a.k2>k2;
        return a.k1>k1;
    }
}Node;
int n,m;
multiset <Node> x;
multiset <Node> y;
multiset <Node>::iterator it,itlow,itup;
void debug(){
    cout<<"x :"<<endl;
    for(it=x.begin();it!=x.end();it++)
        cout<<it->k1<<' '<<it->k2<<endl;
    cout<<"y :"<<endl;
    for(it=y.begin();it!=y.end();it++)
        cout<<it->k1<<' '<<it->k2<<endl;
    cout<<"xsize: "<<x.size()<<' '<<"yszie: "<<y.size()<<endl;
}
int main()
{

    while(~scanf("%d%d",&n,&m)){
        if(n==0&&m==0) break;
        int w,z;
        x.clear();
        y.clear();
        for(int i=0;i<n;i++){
            scanf("%d%d",&w,&z);
            x.insert(Node(w,z));
            y.insert(Node(z,w));
        }
        for(int i=0;i<m;i++){
            scanf("%d%d",&w,&z);
            int ans=0;
            //Node temp(z,INF);
            if(w){
                if(y.empty()||y.begin()->k1>z){
                    cout<<0<<endl;
                    continue;
                }
                itlow=y.upper_bound(Node(z-1,INF));
                itup=y.upper_bound(Node(z,INF));
                for(it=itlow;it!=itup;it++){
                    x.erase(x.find(Node(it->k2,z)));
                    ans++;
                }
                y.erase(itlow,itup);
                cout<<ans<<endl;
            }else{
                if(x.empty()||x.begin()->k1>z){
                    cout<<0<<endl;
                    continue;
                }
                itlow=x.upper_bound(Node(z-1,INF));
                itup=x.upper_bound(Node(z,INF));
                for(it=itlow;it!=itup;it++){
                    y.erase(y.find(Node(it->k2,z)));
                    ans++;
                }
                x.erase(itlow,itup);
                cout<<ans<<endl;
            }
            //debug();
        }
        cout<<endl;
    }
}

It’s a cruel war which killed millions of people and ruined series of cities. In order to stop it, let’s bomb the opponent’s base. 
It seems not to be a hard work in circumstances of street battles, however, you’ll be encountered a much more difficult instance: recounting exploits of the military. In the bombing action, the commander will dispatch a group of bombers with weapons having the huge destructive power to destroy all the targets in a line. Thanks to the outstanding work of our spy, the positions of all opponents’ bases had been detected and marked on the map, consequently, the bombing plan will be sent to you. 
Specifically, the map is expressed as a 2D-plane with some positions of enemy’s bases marked on. The bombers are dispatched orderly and each of them will bomb a vertical or horizontal line on the map. Then your commanded wants you to report that how many bases will be destroyed by each bomber. Notice that a ruined base will not be taken into account when calculating the exploits of later bombers. 

Input

Multiple test cases and each test cases starts with two non-negative integer N (N<=100,000) and M (M<=100,000) denoting the number of target bases and the number of scheduled bombers respectively. In the following N line, there is a pair of integers x and y separated by single space indicating the coordinate of position of each opponent’s base. The following M lines describe the bombers, each of them contains two integers c and d where c is 0 or 1 and d is an integer with absolute value no more than 10  ⁹, if c = 0, then this bomber will bomb the line x = d, otherwise y = d. The input will end when N = M = 0 and the number of test cases is no more than 50. 

Output

For each test case, output M lines, the ith line contains a single integer denoting the number of bases that were destroyed by the corresponding bomber in the input. Output a blank line after each test case.

Sample Input

3 2
1 2
1 3
2 3
0 1
1 3
0 0

Sample Output

2
1