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
#include <iostream>
#include <stack>
using namespace std;
int arr[200002];//存放夫妇对应编号
int main()
{
int n,a,b;
while(cin>>n&&n)
{
stack<int>st;
for(int i=0;i<n;i++)
{
cin>>a>>b;
arr[a]=b;
arr[b]=a;//这样处理基于夫妇只有2个人,方便后面比较
}
for(int i=1;i<=2*n;i++)
{
if(!st.empty()&&arr[i]==st.top())
st.pop();
else st.push(i);
}
if(st.empty())
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
return 0;
}