MasterG

Problem Description 度度熊是一个喜欢计算机的孩子，在计算机的世界中，所有事物实际上都只由0和1组成。 现在给你一个n*m的图像，你需要分辨他究竟是0，还是1，或者两者均不是。 图像0的定义：存在1字符且1字符只能是由一个连通块组成，存在且仅存在一个由0字符组成的连通块完全被1所包围。 图像1的定义：存在1字符且1字符只能是由一个连通块组成，不存在任何0字符组

C. The Tag Game time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Alice got tired of playing the tag game by the usual rules so she offered

The Center City fire department collaborates with the transportation department to maintain maps of the city which reflects the current status of the city streets. On any given day, several streets a

Problem Description Hogwarts正式开学以后,Harry发现在Hogwarts里,某些楼梯并不是静止不动的，相反,他们每隔一分钟就变动一次方向. 比如下面的例子里,一开始楼梯在竖直方向,一分钟以后它移动到了水平方向,再过一分钟它又回到了竖直方向.Harry发现对他来说很难找到能使得他最快到达目的地的路线,这时Ron(Harry最好的朋友)告诉Harry正好有一个魔法道具

There is a mysterious planet called Yaen, whose space is 2-dimensional. There are many beautiful stones on the planet, and the Yaen people love to collect them. They bring the stones back home and m

一道经典的搜索，回溯题吧。 深搜有点想树的前序遍历。方向数组的顺序在这里非常重要。要优先左上方向。 http://poj.org/problem?id=2488 A Knight's Journey Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 41240 Accepted: 14034 Descripti

You have been employed by the organisers of a Super Krypton Factor Contest in which contestants have very high mental and physical abilities. In one section of the contest the contestants are tested o

Description Imagine you are standing inside a two-dimensional maze composed of square cells which may or may not be filled with rock. You can move north, south, east or west one cell at a step. These

http://poj.org/problem?id=1856 题目大意:合法船只的定义：由#构成的矩形，被一圈“.”所围成的船就是合法船只。如果有不合法的船只输出Bad placement.，否则输出合法船只的个数。 队内赛题，当时题没有读懂还是别人告诉我的，亏数据太水不然比赛时就爆0了。 附上复杂代码：找矩形，然后在判断是否满足条件（比赛时还是不要太紧张为好，思维不求快，求精密） /**