一直TL啊, 好不容易不TL了, 结果PE了……原来每一组测试后都要空一行……话说这题二分也行, 但是我用vector+sort+二分照样超时, 不知怎样二分?
#include<iostream>
#include<set>
#include<map>
#include<cstdio>
using namespace std;
typedef map<int, multiset<int> > line;
line row, col;//行列;行y固定, 列x固定
int num(line &a, line &b, int pos)
{
int number=a[pos].size();
multiset<int>::iterator iter;
for(iter=a[pos].begin(); iter!=a[pos].end(); iter++)//删除b中
b[*iter].erase(pos);
a[pos].clear();//清除a
return number;
}
int main()
{
int m, n;
int x, y;
int flag, pos;
while( scanf("%d %d", &n, &m) &&(n+m))
{
while( n-- )
{
scanf("%d %d", &x, &y);
row[y].insert(x);
col[x].insert(y);
}
while( m-- )
{
scanf("%d %d", &flag, &pos);
if( !flag )
printf("%d\n", num(col, row, pos));//删除y
else
printf("%d\n", num(row, col, pos));//删除x
}
printf("\n");
}
}