[ACM_模拟] UVA 12503 Robot Instructions [指令控制坐标轴上机器人移动 水]

 

 

  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 (   T100). Each test case begins with an integer n (   1n100), 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


题目大意：机器人在原点，有3种命令：LEFT坐标减1，RIGHT坐标加1，SAME AS n和第n个命令一样，问最后机器人的坐标。水题不解释！

#include<iostream>
#include<cstdio>
#include<string>
#include<string.h>
#include<cstring>
#include<sstream>
using namespace std;
int main(){
    string str;
    int T;cin>>T;
    getline(cin,str);
    while(T--){
        int n;cin>>n;
        getline(cin,str);
        int move[105];
        int sum=0;
        for(int i=1;i<=n;i++){
            getline(cin,str);
            if(str[0]=='L')move[i]=-1;
            else if(str[0]=='R')move[i]=1;
            else{
                string temp=str.substr(8);
                istringstream in(temp);
                int t;
                in>>t;
                move[i]=move[t];
            }
            sum+=move[i];
        }
        cout<<sum<<'\n';
    }return 0;
}