UVa 10763 Foreign Exchange

UVa 10763 Foreign Exchange2014-07-29 csdn博客 synapse7

10763 - Foreign Exchange

Time limit: 3.000 seconds

http://uva.onlinejudge.org/index.php？option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1704Your non-profit organization （iCORE - internationalConfederation 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 to500000 candidates！

Input

The input file contains multiple cases. Each test case will consist of a line containingn - the number of candidates （1≤n≤500000）, followed byn lines representing the exchange information for each candidate. Each of these lines will contain2 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 wheren = 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

我居然往multimap那里想了。。。

其实只要排个序就行了啊（┬＿┬）

完整代码：

/*0.162s*/#include <cstdio>#include <algorithm>using namespace std;const int MAXN = 500010;int loc[MAXN] , res[MAXN], n, i;bool solve（）{sort（loc , loc + n）;sort（res , res + n）;for （i = 0 ; i < n ; ++i）if （loc[i] ！= res[i]） return false;return true;}int main（）{while （scanf（"%d", &n）, n）{for （i = 0 ; i < n ; ++i）scanf（"%d%d", &loc[i] , &res[i]）;puts（solve（） ？ "YES" : "NO"）;}return 0;}