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

题目大意：有一个交换生计划，计划组织交换生去两地进行交流，
但是学生1 想从a地到b地，学生2 想从b地到a地才能满足交换条件，
现在给你至多50万的交换申请，问是否所有的学生，都能成为交换生。
是就yes，不是就no。


解析：有两种方法能AC这题，但是第一种方法有bug

方法1，用两个数组分别保存，数组1保存申请地点，数组2保存结束地点。
然后对数组1和数组2进行排序，对排序后的两个数组进行比较，如果不同就输出no，相同就输出yes。
这个方法虽然能AC，但是有bug，这组数据过不了，可能是UVA的测试样例太弱了。

3
10 20
20 30
30 10

NO

方法2，题目可以看出，对于申请A到B的，那么一定需要有相对应的从B到A的，而且数量也必须要相对应。例如有两个A到B，但是只有一个B到A，是不行的。
那么， 我们可以给出一个升序序列0,1,2,3,4,5,……n，存在数组arr中，对于每个申请表，假设是A到B，就swap(arr[A], arr[B])。
全部处理完后，判断这个序列是否还是和原来的排列一样。
如果是的话，就符合条件。否则就不行。
（因为对于每个swap（arr[A],arr[B]）如果有一个相对应的swap(arr[B], arr[A]),   那么相当于恢复了原排列）

方法1：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 500005;
int in[N];
int out[N];
int main() {
	int n;
	bool flag;
	while(scanf("%d",&n) != EOF && n) {
		for(int i = 0; i < n; i++) {
			scanf("%d%d",&in[i],&out[i]);
		}
		sort(in,in+n);
		sort(out,out+n);
		flag = true;
		for(int i = 0; i < n; i++) {
			if(in[i] != out[i]) {
				flag = false;
				break;
			}
		}
		if(flag) {
			printf("YES\n");
		}else {
			printf("NO\n");
		}
	}
	return 0;
}

方法2：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 500005;
int arr[N];
void init() {
	for(int i = 0; i < N; i++) {
		arr[i] = i;
	}
}

bool judge() {
	for(int i = 0; i < N; i++) {
		if(arr[i] != i) {
			return false;
		}
	}
	return true;
}
int main() {
	int u,v;
	int n;
	while(scanf("%d",&n) != EOF && n) {
		init();
		for(int i = 0; i < n; i++) {
			scanf("%d%d",&u,&v);
			int t = arr[u];
			arr[u] = arr[v];
			arr[v] = t;
		}
		bool ok = judge();
		if(ok) {
			printf("YES\n");
		}else {
			printf("NO\n");
		}
	}
	return 0;
}