HDU4022-map+multiset--The 36th ACM/ICPC Asia Regional Shanghai Site —— Online Contest

题目：题目链接

题意：给你n个敌人的坐标，再给你m个炸弹和爆炸方向，每个炸弹可以炸横排或竖排的敌人，问你每个炸弹能炸死多少个人。

分析：对于每个x坐标和y坐标分别1对多的保存这个坐标的敌人的数目，直接使用map和multiset好方便：

代码：

#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <functional>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <stack>
#include <ctime>
#include <list>
#define INF 0x7fffffff
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;

int main()
{
    int n, m;
    int x, y;
    int dir, XY;
    while(scanf("%d%d", &n, &m))
    {
        if(!n && !m)
            break;
        map<int, multiset<int> > h, l;
        for(int i = 0; i < n; ++i)
        {
            scanf("%d%d", &x, &y);
            h[x].insert(y);
            l[y].insert(x);
        }
        for(int i = 0; i < m; ++i)
        {
            scanf("%d%d", &dir, &XY);
            if(dir == 0)
            {
                printf("%d\n", h[XY].size());
                for(multiset<int>::iterator it = h[XY].begin(); it != h[XY].end(); ++it)
                    l[*it].erase(XY);
                h[XY].clear();
            }
            else
            {
                printf("%d\n", l[XY].size());
                for(multiset<int>::iterator it = l[XY].begin(); it != l[XY].end(); ++it)
                    h[*it].erase(XY);
                l[XY].clear();
            }
        }
        printf("\n");
    }
    return 0;
}