uva 10763 Foreign Exchange

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
YES
NO
19 20
0

Problem setter: Gilbert Lee, University of Alberta, Canada

——————————————————————————————————————————

题意：交换生，一个学生想去另一个国家留学的话，该国家必须有学生过来

先是一个n，表示n个学生；然后n行，每行俩数，第一个代表该学生来自哪个国家，第二个代表他要去哪个国家，问所有学生是否满足交换生的条件

========================================================================

自己想了半天，敲了半天发现会错于是果断的百度了一下……（反省……这种思路题还是自己想的好

一开始想当邻接矩阵存_(:зゝ∠)_

md数据范围是integer……

然后想排完序二分查_(:зゝ∠)_

屮艸芔茻还有一个国家出一堆人的……（想想敲起来就费事果断放弃

果然这种题就是想方法的_(:зゝ∠)_

最后还是用的排序

两遍排序分别以来的国家和去的国家排序

得出数组相同就代表满足

嘛就是这样（好羞愧居然连这都做不到了_(:зゝ∠)_

-------------------------------------------------------------------------------------------------------------------------------

贴上自己的矬代码_(:зゝ∠)_

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
struct stud{
	int go,back;
};
stud dent[1000000],f[1000000];
int n,q,ar;
bool cmpgo(stud a,stud b)
{
	if (a.go!=b.go)
	return a.go<b.go;
	else
		return a.back<b.back;
}
bool cmpback(stud a,stud b)
{
	if (a.back!=b.back)
	return a.back<b.back;
	else
		return a.go<b.go;
}
int main()
{
	while(~scanf("%d",&n))
	{
		if (n==0)
			break;
		for (int i=1;i<=n;i++)
		{
			scanf("%d%d",&dent[i].go,&dent[i].back);
			f[i]=dent[i];
		}
		ar=1;
		sort(dent+1,dent+n+1,cmpgo);
		sort(f+1,f+n+1,cmpback);
		for (int i=1;i<=n;i++)
		{
			if (f[i].go!=dent[i].back||f[i].back!=dent[i].go)
			{
				ar=0;
				break;
			}
		}
		if (ar)
			printf("YES\n");
		else
			printf("NO\n");
	}
}