UVA 10763-Foreign Exchange(求入度出度是否相等)
2015-02-04 20:33
369 查看
Foreign Exchange
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu
Submit Status
Description
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.
Problem setter: Gilbert Lee, University of Alberta, Canada
题意:交换生现在是很受欢迎的,现在又一个负责这个的组织,经常会收到一大批的申请表, 申请内容是从A国家到B国家的。对于一批申请表, 会有各个不同国家申请到另外各个不同的国家, 假设有任意一个申请A到B的,但是没有B到A的申请, 那么这批申请表都不能被处理。
思路:这其实就是让你查找某个点的入度和出度相加是否为0;
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu
Submit Status
Description
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 |
题意:交换生现在是很受欢迎的,现在又一个负责这个的组织,经常会收到一大批的申请表, 申请内容是从A国家到B国家的。对于一批申请表, 会有各个不同国家申请到另外各个不同的国家, 假设有任意一个申请A到B的,但是没有B到A的申请, 那么这批申请表都不能被处理。
思路:这其实就是让你查找某个点的入度和出度相加是否为0;
#include <stdio.h> #include <string.h> #include <stdlib.h> #include <iostream> #include <algorithm> #include <set> #include <queue> #include <stack> #include <map> using namespace std; const int N=500010; int in ; int main() { int n,a,b,i; int flag; while(~scanf("%d",&n)){ if(n==0) break; memset(in,0,sizeof(in)); while(n--){ scanf("%d %d",&a,&b); in[a]--; in[b]++; } flag=0; for(i=0;i<500010;i++){ if(in[i]!=0){ flag=1; break; } } if(flag) printf("NO\n"); else printf("YES\n"); } return 0; }
相关文章推荐
- uva129困难的串(回溯法)(判断字符串是否相等)(深搜)
- 给你的类重写Equals--检测Class是否相等
- 如何快速比较这两个字符串是否相等?
- A B两个相同长度整数数组,判断相同下标对应值是否相等,true或者false 存在布尔数组C中
- JAVA--HashCode 基础(判断对象是否相等)
- 比较两个UIImage是否相等
- android、Java下判断两个String是否相等 、EditText输入是否为空,
- jQuery Easyui 验证两次密码输入是否相等
- UVa 10763: Foreign Exchange
- uva 10763
- java中两个Integer类型的值,比较是否相等
- UVALive 7281 Saint John Festival (求凸包+判断点是否在凸包内(O(logn)复杂度))
- 浮点数判断是否相等的办法
- 树---判断两棵树是否相等
- 如和判断两个浮点数是否相等
- Java 中判断两个对象是否相等
- UVA 10763 Foreign Exchange
- 经典第五章 习题 5-4 UVA 10763 Foreign Ex(思维题目)
- C语言中如何编写判断结构体是否相等的函数
- Java 实例 - 测试两个字符串区域是否相等