UVA - 10763 Foreign Exchange

Problem E
Foreign Exchange
Input: standard input
Output: standard output
Time Limit: 1 second

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                               Output for 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

YES NO

题意：

看是否swap存在；本来使用二维数组来做，看看a[u][v] ,a[v][u] 是否相等来做；

可是数据太大了，因此换一种思路；如果两者swap存在，进行排序之后应该要相等；

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#define N 500005
using namespace std;

int u[N];
int v[N];

int main() {
	int n;
	int flag;
	while (scanf("%d",&n) != EOF) {
		if (n == 0) break;
		flag =  1;

		for (int i = 0; i < n; i++)  {
			scanf("%d%d",&u[i],&v[i]);   
		}
		sort(u,u+n);
		sort(v,v+n);

		for (int i = 0; i < n; i++){
				if (u[i] != v[i]) 
					flag = 0;
		} 

		if (flag) printf("YES\n");
		else printf("NO\n");
	}

	return 0;
}