当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2513:Colored Sticks

题目描述
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.

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-2513

最后修改于 2020-10-29T06:34:33+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
5000 128000