Robot Instructions

最新推荐文章于 2022-12-04 15:52:51 发布

蚕豆儿

最新推荐文章于 2022-12-04 15:52:51 发布

阅读量1.1k

点赞数

分类专栏： CF 基础文章标签： C++ CF 字符串处理 ACM

本文链接：https://blog.csdn.net/candouer/article/details/9829765

版权

基础同时被 2 个专栏收录

35 篇文章 1 订阅

订阅专栏

16 篇文章 0 订阅

订阅专栏

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3947

Robot Instructions

You have a robot standing on the origin of x axis. The robot will be given some instructions. Your task is to predict its position after executing all the instructions.

LEFT: move one unit left (decrease p by 1, where p is the position of the robot before moving)
RIGHT: move one unit right (increase p by 1)
SAME AS i: perform the same action as in the i-th instruction. It is guaranteed that i is a positive integer not greater than the number of instructions before this.

Input

The first line contains the number of test cases T ( T $\le$ 100 ). Each test case begins with an integer n ( 1 $\le$ n $\le$ 100 ), the number of instructions. Each of the following n lines contains an instruction.

Output

For each test case, print the final position of the robot. Note that after processing each test case, the robot should be reset to the origin.

Sample Input

2
3
LEFT
RIGHT
SAME AS 2
5
LEFT
SAME AS 1
SAME AS 2
SAME AS 1
SAME AS 4

Sample Output

1
-5

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

int now;

char inst[110][7];
int b[110];

void s(int i)
{
    switch(inst[i][0])
    {
    case 'L':
        now--;break;
    case 'R':
        now++;break;
    case 'S':
        s(b[i]);break;
    }
}

int main()
{
    int t,n,i;
    char x[5];
    scanf("%d",&t);
    while(t--)
    {
        memset(b,0,sizeof(b));
        now = 0;
        scanf("%d",&n);
        for(i = 1; i <= n; i++)
        {
            scanf("%s",&inst[i]);
            if(inst[i][0] == 'S')
            {
                scanf("%s",&x);
                scanf("%d",&b[i]);
            }
            s(i);
        }
        printf("%d\n",now);
    }

    return 0;
}