java2000单词,英语翻译IgnatiusandthePrincessITimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/32768K(Jav...

最新推荐文章于 2022-07-27 10:34:53 发布

weixin_39646412

最新推荐文章于 2022-07-27 10:34:53 发布

阅读量238

点赞数

文章标签： java2000单词

这是一道编程题，描述了英雄Ignatius要从一个由字符和数字标记的N*M二维网格迷宫中，按照特定移动规则找到并解救被恶魔feng5166绑架的公主。Ignatius只能向四个方向移动，途中会遇到怪物和陷阱，需要避开陷阱并击败怪物到达目标位置(N-1, M-1)。

摘要由CSDN通过智能技术生成

英语翻译

Ignatius and the Princess I

Time Limit:2000/1000 MS (Java/Others) Memory Limit:65536/32768 K (Java/Others)

Total Submission(s):4030 Accepted Submission(s):1247

Special Judge

Problem Description

The Princess has been abducted by the BEelzebub feng5166,our hero Ignatius has to rescue our pretty Princess.Now he gets into feng5166's castle.The castle is a large labyrinth.To make the problem simply,we assume the labyrinth is a N*M two-dimensional array which left-top corner is (0,0) and right-bottom corner is (N-1,M-1).Ignatius enters at (0,0),and the door to feng5166's room is at (N-1,M-1),that is our target.There are some monsters in the castle,if Ignatius meet them,he has to kill them.Here is some rules:

1.Ignatius can only move in four directions(up,down,left,right),one step per second.A step is defined as follow:if current position is (x,y),after a step,Ignatius can only stand on (x-1,y),(x+1,y),(x,y-1) or (x,y+1).

2.The array is marked with some characters and numbers.We define them like this:

.:The place where Ignatius can walk on.

X :The place is a trap,Ignatius should not walk on it.

n :Here is a monster with n HP(1

英语作业帮用户2017-10-31举报