UVA-10763 multimap的使用

Your non-profit organization (iCORE - international Confederation of Revolver Enthusiasts) coordinates a very successful foreign student exchange program. Over the last few years, demand has
sky-rocketed and now you need assistance with your task.
The program your organization runs works as follows: All candidates are asked for their original
location and the location they would like to go to. The program works out only if every student has a
suitable exchange partner. In other words, if a student wants to go from A to B, there must be another
student who wants to go from B to A. This was an easy task when there were only about 50 candidates,
however now there are up to 500000 candidates!
Input
The input file contains multiple cases. Each test case will consist of a line containing n – the number
of candidates (1 ≤ n ≤ 500000), followed by n lines representing the exchange information for each
candidate. Each of these lines will contain 2 integers, separated by a single space, representing the candidate’s original location and the candidate’s target location respectively. Locations will be represented
by nonnegative integer numbers. You may assume that no candidate will have his or her original location being the same as his or her target location as this would fall into the domestic exchange program.
The input is terminated by a case where n = 0; this case should not be processed.
Output
For each test case, print ‘YES’ on a single line if there is a way for the exchange program to work out,
otherwise print ‘NO’.
Sample Input
10
1 2
2 1
3 4
4 3
100 200
200 100
57 2
2 57
1 2
2 1
10
1 2
3 4
5 6
7 8
9 10
11 12
13 14
15 16
17 18
19 20
0
Sample Output
YES
NO

AC代码
#include<bits/stdc++.h>
typedef long long ll;
typedef double db;
const ll mod = 1e9+7;
const int N = 1e5+20;
#define dep(i,a,b) for(int i=(a);i>=(b);i–)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define mes§ memset(p,0,sizeof§)
using namespace std;
multimap <int,int> a;
int main()
{
int n;
while(cin>>n,n!=0){
a.erase(a.begin(),a.end());
int flag=0;
rep(i,1,n){
int x,y;
cin>>x>>y;
a.insert(make_pair(x,y));
multimap<int,int>::iterator beg,end,m;
if(a.count(y)){// //返回键值等于 key 的元素个数 a.count(key)
//所有的搜索函数，参数是key，而不是value。这样你就不能以 find() 搜寻拥有某特定 value 的元素。
beg=a.equal_range(y).first;
end=a.equal_range(y).second;
//使用equat_range(key) 返回一个迭代器的pair对象，first成员等价于lower_bound(key)，second成员等价于upper_bound(key)
//multimap 会自动按key值排序
for(m=beg;m!=end;m++)
if(m->secondx) {
flag+=2;a.erase(m);
beg=a.equal_range(x).first;
end=a.equal_range(x).second;
for(m=beg;m!=end;m++){
if(m->secondy){
a.erase(m);break;
}
}
break;
}
}
}
if(flag==n) cout<<“YES”<<endl;
else cout<<“NO”<<endl;
}
return 0;
}