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

建议使用的浏览器:

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

3050:Cat Jim

题目描述
Long long ago,there was a very big forest, called Happy Forest. In the forest, there was a very naughty cat, named Jim. One day, when Jim played in the forest, he was attracted by a beautiful butterfly and followed the butterfly, he went into the dire area, the Black Forest

An evil wizard lived in the Black Forest, he would kill anyone who entered the forest, and had a good meal with their bodies. Obviously, Jim knew what would happen to him. As a clever cat, Jim came up an idea quickly, that is, calling for help.

Unfortunately, the wizard trapped Jim with a magic called Maze, and then he went home prepered for the delicious cat-meet-dinner. He would come back at time T.

The magic Maze transmits somebody to a special square. At there, one must solve a riddle to get out, or waiting for powerful wizard to dispel the Maze.

On the square, there are N rows stone. Each row has M stones. Each stone has its own number, and there are M pieces of stone whose number is k(1<=k<=N). Only all the stone in kth row has the same number k, the person can exit the Maze.

Certainly, Jim didn't want to become a cat-meet-dinner, so he asked you for help.

You can assume Jim would take 1 time from one row to any row (nomatter he took a stone or not), and when start (time 0), he could go to any row he likes.

Notice: even Jim can get out of magic Maze, he also need at least 1 time to call for help.(After that he would save by SuperCat and Wizard would lost his cat-meet-dinner. Clearly he might be crazy and do something terrible. For exmaple, he might summon some vampire to catch the cat Jim and then destroy the Happy Forest:( After all, he was a dread wizard.)
输入解释
The first line contains N (the number of row, 1<=N<=10000), M (the number of stone in each row, 1<=M<=100), T(the time mentioned before, T<=2^32), Each of the next N lines contains M numbers in the range from 1 to N. The numbers are separated with a space.
输出解释
The first line is minimal possible time he needed to get out of magic Maze.If he would become a cat-meet-dinner,you must put another line, "Poor Cat".
输入样例
4 3 10
1 3 1
2 3 3
1 2 2
4 4 4
4 3 1
1 3 1
2 3 3
1 2 2
4 4 4 
输出样例
6
6
Poor Cat
来自杭电HDUOJ的附加信息
Recommend gaojie

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-3050

最后修改于 2020-10-25T22:59:35+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65535/65535K(Java/Others)