UVA - 10763 Foreign Exchange
来源:互联网 发布:网络机房有辐射吗 编辑:程序博客网 时间:2024/05/21 11:11
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
这道题刚开始几遍都是TLE,最后AC也有1592MS,感觉效率不高。。。
题目本身方面,要注意可能会出现两个A相同的情况,所以不能用map,而用multimap;
其他就是练习C++语法方面的了。练习STL的find、pair、insert、erase等等,熟练的话应该好做;
没有找到更好的更快的好方法。。。
#include <bits/stdc++.h>using namespace std;int main(){ int n; while(cin >> n, n!=0) { multimap<int, int> table; multimap<int, int>::iterator it; for(int i = 0; i < n; i++) { int A, B; cin >> A >> B; for(it = table.find(B); it!=table.end() && (*it).first==B; it++) { if((*it).second == A) break; } if((*it).second == A) table.erase(it); else table.insert({A, B}); } if(!table.size()) printf("YES\n"); else printf("NO\n"); } return 0;}
- UVa 10763 - Foreign Exchange
- UVa 10763 - Foreign Exchange
- uva 10763 - Foreign Exchange
- uva 10763 - Foreign Exchange
- Foreign Exchange uva 10763
- UVa 10763 - Foreign Exchange
- Uva-10763-Foreign Exchange
- UVa 10763 - Foreign Exchange
- UVa 10763 - Foreign Exchange
- UVa 10763: Foreign Exchange
- UVA 10763 Foreign Exchange
- UVa 10763 - Foreign Exchange
- uva 10763 - Foreign Exchange
- uva 10763 Foreign Exchange
- uva 10763 Foreign Exchange
- uva 10763 Foreign Exchange
- UVA 10763 Foreign Exchange
- uva 10763Foreign Exchange
- mac配置apache+php+mysql问题记录
- BadNeighbors - 2004 TCCC Round 4
- servlet生命周期
- oracle 存储过程 利用数组类型type实现批量插入数据库
- zoj 3819(牡丹江现场赛A题)
- UVA - 10763 Foreign Exchange
- Linux命令export - 设置或显示环境变量
- 黑马程序员_JAVA_IO(二)
- 算法导论-第九章-中位数和顺序统计量:最坏情况为线性时间的选择算法C++实现
- C++ primer 容易出错小记第一章
- Android动画之Tween动画实现
- Android AVD 没有键盘
- TCP协议的三次握手和四次挥手的整理
- 根据文字自定义Label和Cell高度