UVA Foreign Exchange

 

Foreign Exchange

Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

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

解题：直接模拟交换好了，如果最后还与交换之前一样，则YES

#include <bits/stdc++.h>
using namespace std;
const int maxn = 500010;
int d[maxn],n,u,v;
int main() {
    while(scanf("%d",&n),n) {
        for(int i = 1; i <= n; ++i) d[i] = i;
        for(int i = 0; i < n; ++i) {
            scanf("%d%d",&u,&v);
            swap(d[u],d[v]);
        }
        bool flag = true;
        for(int i = 1; i <= n; ++i)
            if(d[i] != i) {
                flag = false;
                break;
            }
        puts(flag?"YES":"NO");
    }
    return 0;
}