UVa10763 Foreign Exchange (有点水，map+pair)

题目链接

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’.

1.本来想写结构体+map来着，后来来发现报一些奇怪的错，应该是自定义的结构和类在map中没有重构一些函数，导致实现map的红黑树时出了问题，换了pair一发过

2.思路：先用map存下所有pair的数量，再将pair的逐个遍历看pair和它的反例在map中是否相等，不相等则退出

代码：

#include <iostream>
#include <map>
using namespace std;
const int maxn=5e5+10;
pair<int,int> s[maxn];
map<pair<int,int>,int> mp;
int main() //360ms
{
    int n;
    while(scanf("%d",&n)==1&&n){
        mp.clear();
        for(int i=1;i<=n;i++){
            cin>>s[i].first>>s[i].second;
            mp[s[i]]++;
        }
        int flag=1;
        for(int i=1;i<=n;i++){
            pair<int,int> s1;
            s1.first=s[i].second;
            s1.second=s[i].first;
            if(mp[s1]!=mp[s[i]]){
                flag=0;
                break;
            }
        }
        if(flag) cout<<"YES\n";
        else cout<<"NO\n";
    }
    return 0;
}