hdu 4022 map的一对多实现 map和set的结合应用

BombingTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)
Total Submission(s): 1471    Accepted Submission(s): 551


Problem DescriptionInputOutputSample InputSample Output//map的一对多#include<stdio.h>#include<map>#include<set>using namespace std;int main(){int i,j,n,m;while(scanf("%d %d",&n,&m)!=EOF){map<int,multiset<int> >xs,ys;for(i=0;i<n;i++){int x,y;scanf("%d %d",&x,&y);xs[x].insert(y);ys[y].insert(x);}for(i=0;i<m;i++){int flag,k;scanf("%d %d",&flag,&k);if(flag){printf("%d\n",ys[k].size());multiset<int>::iterator it;for(it=ys[k].begin();it!=ys[k].end();it++) xs[*it].erase(k);ys[k].clear();}else{printf("%d\n",xs[k].size());multiset<int>::iterator it;for(it=xs[k].begin();it!=xs[k].end();it++) ys[*it].erase(k);xs[k].clear();}}if(!n&&!m) break;else printf("\n");}return 0;}