QOJ.ac

QOJ

Time Limit: 2 s Memory Limit: 64 MB Total points: 100

#23748. 骰子

Statistics

一颗骰子按下图所示的朝向放置。

problem_23748_304c8f4f0d7bcdf755f610a4d1534eee.png

这里所使用的骰子如该图所示,当上方为 $1$、南侧为 $2$ 时,东侧为 $3$。由于骰子相对两面的点数之和总是 $7$,因此看不见的面分别为北侧 $5$、西侧 $4$、下方 $6$。

从这一初始配置状态开始,按照指示移动骰子。其中,指示是若干次执行以下 $6$ 种操作。

problem_23748_72d8c824c4b7e7b2153bcc762586c844.png problem_23748_351ae00444f5f85272c6e0b480784775.png problem_23748_c14159840b38cefaa3541522e15482ec.png problem_23748_348dec7a597c22f23bab6e9c675aeeca.png
problem_23748_593a588389d24d87834e078753aa4bfd.png problem_23748_d77964fb3dfcacbf2a397262f4d096a7.png

North、East、South、West 各操作将骰子向所指示的方向旋转 $90$ 度。

Right、Left 这 $2$ 种操作保持上下面不变,在水平方向上旋转 $90$ 度。(请特别注意旋转方向。)

将初始配置中顶面朝上的点数 $1$ 作为初始值,每完成 $1$ 次操作,就加上此时顶面朝上的点数,请编写一个程序,输出按照指示完成所有操作后的总和。

输入文件的第 $1$ 行写有总指示次数 $n$,接下来的 $n$ 行每行写有“North、East、South、West、Right、Left”中的某 $1$ 个指示。其中 $n \le 10000$。

在上传的输出文件中,请在输出(总和)之后加入换行。

样例

输入格式 1

5
North
North
East
South
West

输出格式 1

21

输入格式 2

8
West
North
Left
South
Right
North
Left
East

输出格式 2

34

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.