1021. Couples
Description
N couples are standing in a circle, numbered consecutively clockwise from 1 to 2N. Husband and wife do not always stand together. We remove the couples who stand together until the circle is empty or we can't remove a couple any more.
Can we remove all the couples out of the circle?
Input
There may be several test cases in the input file. In each case, the first line is an integer N(1 <= N <= 100000)----the number of couples. In the following N lines, each line contains two integers ---- the numbers of each couple.
N = 0 indicates the end of the input.
Output
Output "Yes" if we can remove all the couples out of the circle. Otherwise, output "No".
Sample Input
4 1 4 2 3 5 6 7 8 2 1 3 2 4 0
Sample Output
Yes No
Problem Source
ZSUACM Team Member
思路:这条题目,刚刚开始想用双向链表下去做,不过有同学提示下说用stack去,然后就没多想了。
代码:
#include<iostream>
#include<stack>
using namespace std;
int coup[200002];
int main()
{
while( true )
{
int n;
cin >> n;
if( 0 == n )
break;
for( int i = 0; i < n; i++ )
{
int man;
int woman;
cin >> man >> woman;
coup[man] = i;
coup[woman] = 0 - i;
}
stack< int > deal;
deal.push( coup[1] );
int scan = 2;
int endflag = 2 * n;
while( scan <= endflag )
{
if( deal.empty() )
deal.push( coup[scan] );
else
{
if( deal.top() + coup[scan] )
deal.push( coup[scan] );
else
deal.pop();
}
scan++;
}
if( deal.empty() )
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}