同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

21210_NoLeftTurns

2022-5-16 18:18| 发布者: Hocassian| 查看: 34| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-3-8950520455200-Problem List-采集的数据-后羿采集器.html

Pro.ID

21210

Title

No Left Turns

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=21210

AC

Submit

Ratio

时间&空间限制

Time Limit: 1500/500 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)

描述

ALL HEADS: You're a Knight of the Round Table?

ROBIN: I am.

LEFT HEAD: In that case I shall have to kill you.

MIDDLE HEAD: Shall I?

RIGHT HEAD: Oh, I don't think so.

MIDDLE HEAD: Well, what do I think?

LEFT HEAD: I think kill him.

RIGHT HEAD: Well let's be nice to him.

MIDDLE HEAD: Oh shut up.

As the story goes, the Knight scarpers off. Right Head has taken it upon himself to search the grounds for the knight so he, Left, and Middle can go extinguish him (and then have tea and biscuits.)

Consider the following 8 by 12 maze, where shaded squares are walls that can’t be entered.

The shortest path between the Right Head (denoted by the S, for start) and the knight (denoted by the F, for finish) is of length 3, as illustrated above. But! Right Head can’t turn left or make UTurns. He can only move forward and turn right. That means the shortest path that Right Head can find is significantly longer: at 29!

输入

The input file will consist of a single integer N (N > 0) specifying the number of mazes in the file.

Following this, on a maze by maze basis will be the number of rows, r (3 < r <= 20), a space, then the number of columns, c (3 < c <= 20). After this will follow r lines of c characters, representing a map of the maze:

XXXXXXXXXXXXXX

X XXX

X XFXXXXX X

XXX XX XX X

X S X

XX XXXXXX X X

X X X X

X X X X X

XXX XX X

XXXXXXXXXXXXXX

X’s mark those locations that are walls and can’t be occupied. S marks the start location, and F marks the Knight. Blanks are locations that can be freely traveled.

输出

Description

ALL HEADS: You're a Knight of the Round Table?

ROBIN: I am.

LEFT HEAD: In that case I shall have to kill you.

MIDDLE HEAD: Shall I?

RIGHT HEAD: Oh, I don't think so.

MIDDLE HEAD: Well, what do I think?

LEFT HEAD: I think kill him.

RIGHT HEAD: Well let's be nice to him.

MIDDLE HEAD: Oh shut up.

As the story goes, the Knight scarpers off. Right Head has taken it upon himself to search the grounds for the knight so he, Left, and Middle can go extinguish him (and then have tea and biscuits.)

Consider the following 8 by 12 maze, where shaded squares are walls that can’t be entered.

Input

The input file will consist of a single integer N (N > 0) specifying the number of mazes in the file.

XXXXXXXXXXXXXX

X XXX

X XFXXXXX X

XXX XX XX X

X S X

XX XXXXXX X X

X X X X

X X X X X

XXX XX X

XXXXXXXXXXXXXX

X’s mark those locations that are walls and can’t be occupied. S marks the start location, and F marks the Knight. Blanks are locations that can be freely traveled.

Output

The output is the length of the shortest path between the start and finish locations. Based on the above maze, your program would output the minimum no-left-turns path length of 29.

Additional Constraints/Information:

• Right Head is capable of moving from the start position in any of the four primary compass directions. After that, he’s constrained to either step forward or right.

• The start and end locations will never be the same.

• The maze is always surrounded by four walls.

• You can assume that a path between the start and final locations always exists.

Sample Input

10 14

XXXXXXXXXXXXXX

X XXX

X XFXXXXX X

XXX XX XX X

X S X

XX XXXXXX X X

X X X X