UVA 10763 - Foreign Exchange(2점 찾기)
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu
Description
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
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
Sample Output
YES
NO
===================================
제목에 대한 이해는 1, 2, 2, 1은 YES, 1, 2, 3, 3, 1은 NO입니다.
생각의 방향은 바로 빠른 배열 + 2점 찾기
#include
#include
#include
#include
using namespace std;
bool mark[511111];
struct student
{
int a,b;
}s[511111];
bool cmp(student x,student y)
{
if(x.b==y.b) return x.akey1||(vis[m].b==key1&&vis[m].a>key2)) r=m-1;
else l=m+1;
}
if(p)
{
if(!mark[p]) return p;
else
{
while(mark[p]) p++;
if(vis[p].b==key1&&vis[p].a==key2) return p;
}
}
return 0;//s[0] , 0
}
int main()
{
int n;
while(~scanf("%d",&n))
{
if(n==0) break;
memset(s,0,sizeof(s));
memset(mark,0,sizeof(mark));
int ok=1;
for(int i=0;i
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
UVA 10763 - Foreign Exchange(2점 찾기)B - Foreign Exchange Your non-profit organization (iCORE - international Confederation of Revolver Enthusiasts) coordina...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.