UVA 12503（模拟）

题意：开始有个数字p，left表示p--，righ表示p++，same as。。。。就是跳到对应行操作

题解：直接模拟就可以啦

#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<vector>#include<queue>#include<map>#include<set>#include<utility>using namespace std;#define LL long long #define N int(1e2+10)#define lson L,mid,rt<<1#define rson mid+1,R,rt<<1|1char s[N][N];vector< pair<char,int> >v;int ans;void dfs(int x){if(v[x-1].second==0){if(v[x-1].first=='L')ans--;else ans++;return ;}dfs(v[x-1].second);}int main (){#ifdef CDZSCfreopen("i.txt","r",stdin);#endifchar s[N];int n,t;scanf("%d",&t);while(t--){ans=0;v.clear();scanf("%d",&n);for(int i=0;i<n;i++){int x=0;scanf("%s",s);if(s[0]=='L'){ans-=1;}else if(s[0]=='R'){ans+=1;}else {scanf("%s%d",s,&x);dfs(x);}v.push_back(make_pair(s[0],x));}printf("%d\n",ans);}return 0;}