SRM 440 DIVII 500中文翻译及思路（C#）

最新推荐文章于 2024-10-30 04:50:08 发布

cbq926

最新推荐文章于 2024-10-30 04:50:08 发布

阅读量801

点赞数

分类专栏：编程题目文章标签： c# constraints character string parameters 数据结构

本文链接：https://blog.csdn.net/cbq926/article/details/4192693

版权

编程题目专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Problem Statement（陈述）

According to research conducted recently, listening to classical music increases one's mental abilities, while listening to metal decreases them. Now, yet another experiment is being conducted to try to prove or disprove this statement.

根据最新的研究表明，听古典音乐能增加一个人的思维能力，但是听金属摩擦的声音则降低这种能力。现在，有一个实验，正试图证明或推翻这一陈述。

In this new experiment, a mouse is placed in a rectangular maze consisting of NxM squares. Each square either contains a wall or is empty. The maze is structured in such a way that for any two empty squares, there exists exactly one path between them. A path is a sequence of pairwise distinct empty squares such that every two consecutive squares are neighboring. Two squares are considered neighboring if they share a common edge.

在这个新的实验中，一只老鼠被放置在一个由NxM方块组成的长方形迷宫中。每一个方块都代表了墙壁或空。迷宫是这样一种结构，任何两个方块之间存在着一条路。这条路是一连串成对的空方块，每两个连续的方块是挨着的。两个方块如果他们有共同的边则被视为友邻。

One of the empty squares in the maze contains a piece of cheese. The mouse's goal is to reach that square without visiting the same square twice. The mouse can only move between neighboring squares. Since the mouse has been listening to classical music for a week, he is extremely intelligent and guaranteed to achieve his goal.

在迷宫中有一个方块里包含一块奶酪。老鼠的目标是到达这个方块，但是不能通过相同的方块两次以上。老鼠只能在相邻的两个方块间移动。假设老鼠已经听古典音乐一个星期了，他非常聪明而且保证能实现目标。

As the mouse moves from his starting point to the cheese, he may encounter some squares where he must choose between several neighboring squares to continue. This happens when the mouse steps into a square which has more than one neighboring empty square, excluding the square from which he came, or when he has more than one neighboring empty square at the start.

老鼠从他的出发点到奶酪，可能会遇到一些方块，他必须选择一些相邻的方块继续前行。老鼠走到这种方块，该方块有一个以上为空的友邻时，但不包括他已经经过的方块。

These situations are called "decisions" and the mouse will always make the right choice. You are given a string[] maze representing the maze. It contains N elements, each containing M characters. Empty squares are denoted by '.', walls are denoted by uppercase 'X', the mouse's starting point is denoted by 'M', and the square containing the cheese is denoted by '*'. Return the number of decisions the mouse will make on his way to the cheese.

这些情况被称为“决定”，并且老鼠一直都会做出正确的选择。给你一个代表迷宫的字符串（string[] maze）。它包含多个个元素，每个元素由多个字符组成。空方块指由'. '表示，墙由大写的字符' X'表示，老鼠的出发点由字符' M'表示，有奶酪的方块由字符' * '表示。返回老鼠到达奶酪途中决定的次数。

Definition（定义）

Class（类名）: MazeWanderingEasy

Method（方法）: decisions

Parameters（参数）: string[]

Returns（返回值类型）: int

Method signature（方法定义样式）:public int decisions(string[] maze)

Constraints（限制）

- maze will contain between 1 and 50 elements, inclusive.

- 迷宫包含1到50个元素。

- element of maze will contain between 1 and 50 characters, inclusive.

- 迷宫的每个元素将包含1到50个字符。

- Elements of maze will be of the same length.