Blind Maze

Statement

Goal

You enter the maze at room 0 with a list of directions to reach the exit.
Each room has a sign showing connected room indexes for each cardinal direction W, N, E, and S.
Find your way to the exit!

Input

Line 1: The directions D, space separated letters, each is W, N, E, or S.
Line 2: Number of rooms, R
Next R Lines: Room signs in order as space-separated room indexes W, N, E, and S. -1 means "no room here".

Output

An integer, the room index of the exit, where you will be after following the directions.

Constraints

2<Number of Letters in D<28
0<R<101
W, N, E, and S are all integers ≥ -1

Example

Input

N N E
10
1 2 3 -1
4 -1 0 -1
-1 5 -1 0
0 -1 -1 -1
-1 6 1 -1
7 8 9 2
-1 -1 -1 4
-1 -1 5 -1
-1 -1 -1 5
5 -1 -1 -1

Output

Game modes

Fastest, Shortest

Test cases

Maze 1 Test

Input

N N E 10 1 2 3 -1 4 -1 0 -1 -1 5 -1 0 0 -1 -1 -1 -1 6 1 -1 7 8 9 2 -1 -1 -1 4 -1 -1 5 -1 -1 -1 -1 5 5 -1 -1 -1

Output

Validator 1 Validator

Input

W W N 10 1 2 3 -1 4 -1 0 -1 -1 5 -1 0 0 -1 -1 -1 -1 6 1 -1 7 8 9 2 -1 -1 -1 4 -1 -1 5 -1 -1 -1 -1 5 5 -1 -1 -1

Output

Maze 2 Test

Input

S S S S E S E E N N W 18 -1 -1 1 11 0 -1 2 -1 1 -1 3 -1 2 -1 -1 4 -1 3 -1 5 -1 4 -1 6 17 5 -1 7 -1 6 -1 8 9 7 -1 -1 10 -1 8 -1 -1 16 9 -1 -1 0 -1 12 -1 11 13 14 12 -1 -1 -1 -1 12 -1 15 -1 14 16 -1 15 -1 -1 10 -1 -1 6 -1

Output

Validator 2 Validator

Input

E E E S S S S S W W N W N N E 18 -1 -1 1 11 0 -1 2 -1 1 -1 3 -1 2 -1 -1 4 -1 3 -1 5 -1 4 -1 6 17 5 -1 7 -1 6 -1 8 9 7 -1 -1 10 -1 8 -1 -1 16 9 -1 -1 0 -1 12 -1 11 13 14 12 -1 -1 -1 -1 12 -1 15 -1 14 16 -1 15 -1 -1 10 -1 -1 6 -1

Output

Maze 3 Test

Input

S E E N E S S S S W N W 25 -1 -1 1 5 0 -1 2 6 1 -1 3 7 2 -1 4 8 3 -1 -1 9 -1 0 6 10 5 1 7 11 6 2 8 12 7 3 9 13 8 4 -1 14 -1 5 11 15 10 6 12 16 11 7 13 17 12 8 14 18 13 9 -1 19 -1 10 16 20 15 11 17 21 16 12 18 22 17 13 19 23 18 14 -1 24 -1 15 21 -1 20 16 22 -1 21 17 23 -1 22 18 24 -1 23 19 -1 -1

Output

Validator 3 Validator

Input

E S E S S S E E N N 25 -1 -1 1 5 0 -1 2 6 1 -1 3 7 2 -1 4 8 3 -1 -1 9 -1 0 6 10 5 1 7 11 6 2 8 12 7 3 9 13 8 4 -1 14 -1 5 11 15 10 6 12 16 11 7 13 17 12 8 14 15 13 9 -1 19 -1 10 16 20 15 11 17 21 16 12 15 22 17 13 19 23 15 14 -1 24 -1 15 21 -1 20 16 22 -1 21 17 23 -1 22 15 24 -1 23 19 -1 -1

Output

Maze 4 Test

Input

N N E S S E N N E S S E N N E S S E N N E S S E N N N 100 -1 1 10 -1 -1 2 11 0 -1 3 12 1 -1 4 13 2 -1 5 14 3 -1 6 15 4 -1 7 16 5 -1 8 17 6 -1 9 18 7 -1 -1 19 8 0 11 20 -1 1 12 21 10 2 13 22 11 3 14 23 12 4 15 24 13 5 16 25 14 6 17 26 15 7 18 27 16 8 19 28 17 9 -1 29 18 10 21 30 -1 11 22 31 20 12 23 32 21 13 24 33 22 14 25 34 23 15 26 35 24 16 27 36 25 17 28 37 26 18 29 38 27 19 -1 39 28 20 31 40 -1 21 32 41 30 22 33 42 31 23 34 43 32 24 35 44 33 25 36 45 34 26 37 46 35 27 38 47 36 28 39 48 37 29 -1 49 38 30 41 50 -1 31 42 51 40 32 43 52 41 33 44 53 42 34 45 54 43 35 46 55 44 36 47 56 45 37 48 57 46 38 49 58 47 39 -1 59 48 40 51 60 -1 41 52 61 50 42 53 62 51 43 54 63 52 44 55 64 53 45 56 65 54 46 57 66 55 47 58 67 56 48 59 68 57 49 -1 69 58 50 61 70 -1 51 62 71 60 52 63 72 61 53 64 73 62 54 65 74 63 55 66 75 64 56 67 76 65 57 68 77 66 58 69 78 67 59 -1 79 68 60 71 80 -1 61 72 81 70 62 73 82 71 63 74 83 72 64 75 84 73 65 76 85 74 66 77 86 75 67 78 87 76 68 79 88 77 69 -1 89 78 70 81 90 -1 71 82 91 80 72 83 92 81 73 84 93 82 74 85 94 83 75 86 95 84 76 87 96 85 77 88 97 86 78 89 98 87 79 -1 99 88 80 91 -1 -1 81 92 -1 90 82 93 -1 91 83 94 -1 92 84 95 -1 93 85 96 -1 94 86 97 -1 95 87 98 -1 96 88 99 -1 97 89 -1 -1 98

Output

Validator 4 Validator

Input

N N N N N N N N N E E E E E E E S S S S S W W W N N N 100 -1 1 10 -1 -1 2 11 0 -1 3 12 1 -1 4 13 2 -1 5 14 3 -1 6 15 4 -1 7 16 5 -1 8 17 6 -1 9 18 7 -1 -1 19 8 0 11 20 -1 1 12 21 10 2 13 22 11 3 14 23 12 4 15 24 13 5 16 25 14 6 17 26 15 7 18 27 16 8 19 28 17 9 -1 29 18 10 21 30 -1 11 22 31 20 12 23 32 21 13 24 33 22 14 25 34 23 15 26 35 24 16 27 36 25 17 28 37 26 18 29 38 27 19 -1 39 28 20 31 40 -1 21 32 41 30 22 33 42 31 23 34 43 32 24 35 44 33 25 36 45 34 26 37 46 35 27 38 47 36 28 39 48 37 29 -1 49 38 30 41 50 -1 31 42 51 40 32 43 52 41 33 44 53 42 34 45 54 43 35 46 55 44 36 47 56 45 37 48 57 46 38 49 58 47 39 -1 59 48 40 51 60 -1 41 52 61 50 42 53 62 51 43 54 63 52 44 55 64 53 45 56 65 54 46 57 66 55 47 58 67 56 48 59 68 57 49 -1 69 58 50 61 70 -1 51 62 71 60 52 63 72 61 53 64 73 62 54 65 74 63 55 66 75 64 56 67 76 65 57 68 77 66 58 69 78 67 59 -1 79 68 60 71 80 -1 61 72 81 70 62 73 82 71 63 74 83 72 64 75 84 73 65 76 85 74 66 77 86 75 67 78 87 76 68 79 88 77 69 -1 89 78 70 81 90 -1 71 82 91 80 72 83 92 81 73 84 93 82 74 85 94 83 75 86 95 84 76 87 96 85 77 88 97 86 78 89 98 87 79 -1 99 88 80 91 -1 -1 81 92 -1 90 82 93 -1 91 83 94 -1 92 84 95 -1 93 85 96 -1 94 86 97 -1 95 87 98 -1 96 88 99 -1 97 89 -1 -1 98

Output

Solution language

Solution

Stub generator input

Comments

13 Comments

Azeddine blidi Unnamed CodinGamer

almost 2 years ago

✅ Approved the contribution. Comment: its a clean code

TimothyHoytBSME Unnamed CodinGamer

Thanks!

Rafalon Unnamed CodinGamer

✅ Approved the contribution. Comment: Assez facile pour un Clash, l'énoncé est très clair

pigonhae Unnamed CodinGamer

❌ Rejected the contribution. Comment: think the description needs more

think the description needs more

rb4code Unnamed CodinGamer

I would propose changing the variable names (D => directions, R => rooms) to something more meaningful. Also, in Stub generator input I would suggest changing "write integer" to "write 0" or something, at least in Typescript the code generated initially is confusing.

I changed "write integer" to "write roomIndex". I will consider the other changes for a bit, many people, including myself, prefer single-letter variables.

Personne_3 Unnamed CodinGamer

✅ Approved the contribution. Comment: Very interesting !!

5DN1L Unnamed CodinGamer

about 2 years ago

Input * Please change "<<Next N Lines>>" to "<<Next [[R]] Lines>>. * Suggest to delete "from 0 to R". (…and it is R - 1 if you're referring to indexes, but in any case, I don't think it's necessary to mention it; it may actually add to further confusion.) * Please add '{{-1}} means "no room here"' here. Constraints * Please change "Letters" to "Number of letters". * Please change 10 to 0 because R = 10 in two cases. * You may delete the third constraint as it merely repeats what is stated in Input section. * In the last concstraint, "≥ 0" and "-1" are contradictory. Please change '≥ 0, where 0 is the start and -1 means "no room here".' to '≥ {{-1}}'. (The other stuff is explanation of already stated rules and not constraints.) Thanks.

All done! Please re-check.

Looking for feedback before switching to ready state. Also, am I correct in thinking this would not work well for Reverse mode?

I think it's too difficult in Reverse mode to guess 0 means start and what the room lines represent, or in what order the rooms are given in each line (N/E/S/W? N/S/E/W? … there are 24 possible combinations…)