Location:
Search - pku 14
Search list
Description: www.acm.pku.edu.cn上的1005题-www.acm.pku.edu.cn of 1005 that
Platform: |
Size: 41555 |
Author: 请不要用公用帐号上载 |
Hits:
Description: www.acm.pku.edu.cn上的1005题-www.acm.pku.edu.cn of 1005 that
Platform: |
Size: 40960 |
Author: 请不要用公用帐号上载 |
Hits:
Description: 二分图的最大匹配之匈牙利算法详解，以前做ACM时写的，仅供参考，另外提供了一个北大题目的源程序作为实现实例-data structure--graph
Platform: |
Size: 4096 |
Author: 宋天宝 |
Hits:
Description: 北京大学ACM/ICPC竞赛队
2009 PKU ACM/ICPC Trainning 14
Colored Sticks
F:Colored Sticks
时间限制:
5000ms
内存限制:
65536kB
描述
You are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a straight line such that the colors of the endpoints that touch are of the same color?
输入
Input is a sequence of lines, each line contains two words, separated by spaces, giving the colors of the endpoints of one stick. A word is a sequence of lowercase letters no longer than 10 characters. There is no more than 250000 sticks.
输出
If the sticks can be aligned in the desired way, output a single line saying Possible, otherwise output Impossible.
样例输入
blue red
red violet
cyan blue
blue magenta
magenta cyan
样例输出
Possible
提示
Huge input,scanf is recommended. -2009 PKU ACM/ICPC Trainning 14
Colored Sticks
Platform: |
Size: 1024 |
Author: changxin |
Hits: