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
这是Sicily的1021题,题目意思不太明确。网上搜到的大多是直接贴代码,完全没有解释清楚题目的意思。后来本人浏览了好几个论坛和网页的评论,慢慢理解了。里case1为例,n = 4, 2n 就是8, 1-8 按顺时针方向排好。
1和4是couple, 2和3是couple, 5和6是couple, 7和8是couple
相邻的couple可以去掉,所以2和3, 5和6,7和8可以去掉,
原来的1和4是分开的,可是去掉相邻的(2,3) (5,6) (7,8)之后,他们又是相邻的了,所以也可以去掉,也就是说,所以的都可以去掉,所以output是YES。
而case2同理,1和3是couple, 2和4是couple,但是他们都不相邻,所以不能去掉,所以output是NO。
参照CSDN论坛上大神的理解:给每对couple一个tag值
比如,case1中,各个couple如下
Tag couple
1 (1,4)
2 (2,3)
3 (5,6)
4 (7,8)
那么这个circle中,各个couple的分布应该是这样的:
1,2,2,1,3,3,4,4
Tag相同并且是相邻的就可以去掉,而去掉相邻的以后,原来不相邻的变成相邻的也可以去掉,所以case1是可以全部去掉的。这跟括号匹配很像。如: [ ( ) ] < > { } 。所以解此题的方法也可以参照括号匹配,利用栈即可。