The 2018 ACM-ICPC Asia Qingdao Regional Contest, Online -C：Halting Problem（模拟）

C Halting Problem

In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program, whether the program will finish running (i.e., halt) or continue to run forever.

Alan Turing proved in 1936 that a general algorithm to solve the halting problem cannot exist, but DreamGrid, our beloved algorithm scientist, declares that he has just found a solution to the halting problem in a specific programming language -- the Dream Language!

Dream Language is a programming language consists of only 5 types of instructions. All these instructions will read from or write to a 8-bit register r, whose value is initially set to 0. We now present the 5 types of instructions in the following table. Note that we denote the current instruction as the i-th instruction.

Instruction	Description
add v	Add v to the register r. As r is a 8-bit register, this instruction actually calculates (r+v)mod256 and stores the result into r, i.e. r←(r+v)mod256. After that, go on to the (i+1)-th instruction.
beq v k	If the value of r is equal to v, jump to the k-th instruction, otherwise go on to the (i+1)-th instruction.
bne v k	If the value of r isn't equal to v, jump to the k-th instruction, otherwise go on to the (i+1)-th instruction.
blt v k	If the value of r is strictly smaller than v, jump to the k-th instruction, otherwise go on to the (i+1)-th instruction.
bgt v k	If the value of r is strictly larger than v, jump to the k-th instruction, otherwise go on to the (i+1)-th instruction.

A Dream Language program consisting of n instructions will always start executing from the 1st instruction, and will only halt (that is to say, stop executing) when the program tries to go on to the (n+1)-th instruction.

As DreamGrid's assistant, in order to help him win the Turing Award, you are asked to write a program to determine whether a given Dream Language program will eventually halt or not.

Input

There are multiple test cases. The first line of the input is an integer T, indicating the number of test cases. For each test case:

The first line contains an integer n (1≤n≤10​4​​), indicating the number of instructions in the following Dream Language program.

For the following n lines, the i-th line first contains a string s (s∈{“add”,“beq”,“bne”,“blt”,“bgt”}), indicating the type of the i-th instruction of the program.

• If s equals to "add", an integer v follows (0≤v≤255), indicating the value added to the register;
• Otherwise, two integers v and k follow (0≤v≤255, 1≤k≤n), indicating the condition value and the destination of the jump.

It's guaranteed that the sum of n of all test cases will not exceed 10​5​​.

Output

For each test case output one line. If the program will eventually halt, output "Yes" (without quotes); If the program will continue to run forever, output "No" (without quotes).

Sample Input

4
2
add 1
blt 5 1
3
add 252
add 1
bgt 252 2
2
add 2
bne 7 1
3
add 1
bne 252 1
beq 252 1

Sample Output

Yes
Yes
No
No

Hint

For the second sample test case, note that r is a 8-bit register, so after four "add 1" instructions the value of r will change from 252 to 0, and the program will halt.

For the third sample test case, it's easy to discover that the value of r will always be even, so it's impossible for the value of r to be equal to 7, and the program will run forever.

题意

对于一个系统，有“add”，“beq”，“bne”，“blt”，“bgt”五种操作（具体操作看题目。。）输入由这五种操作组成的程序能不能停止（进行到最后一条）

思路

用二维数组vis[i][j]记录第i步操作，数值j是否出现，如果出现，则会陷入死循环，输出“No”，停止操作，直到程序进行到最后一条。

//vis数组要定义成bool型，定义成int型会TLE

AC代码

（一开始写的没有这么长，但是一直TLE，所以就加上了各种break......最大的坑点就是vis数组的类型）

#pragma GCC optimize(3)
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <math.h>
#include <limits.h>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <string>
#define ll long long
#define ull unsigned long long
#define ms(a) memset(a,0,sizeof(a))
#define pi acos(-1.0)
#define INF 0x7f7f7f7f
#define lson o<<1
#define rson o<<1|1
const double E=exp(1);
const int maxn=1e4+10;
using namespace std;
int a[maxn];
int d[maxn];
int x[maxn],y[maxn];
bool vis[maxn][300];
inline int read()
{
    int X=0,w=1;
    char c=getchar();
    while (c<'0'||c>'9') { if (c=='-') w=-1; c=getchar(); }
    while (c>='0'&&c<='9') X=(X<<3)+(X<<1)+c-'0',c=getchar();
    return X*w;
}
//////////////
//////      //
// 1-> add  //
// 2-> beq  //
// 3-> bne  //
// 4-> blt  //
// 5-> bgt  //
//          //
//////      //
//////////////
int main(int argc, char const *argv[])
{
	int t;
	t=read();
	// scanf("%d",&t);
	int n;
	while(t--)
	{
		// ms(d);
		// ms(a);
		// ms(x);
		// ms(y);
		ms(vis);
		char str[5];
		n=read();
		for(int i=1;i<=n;i++)
		{
			scanf("%s",str);
			if(strcmp(str,"add")==0)
				d[i]=1;
			else if(strcmp(str,"beq")==0)
				d[i]=2;
			else if(strcmp(str,"bne")==0)
				d[i]=3;
			else if(strcmp(str,"blt")==0)
				d[i]=4;
			else if(strcmp(str,"bgt")==0)
				d[i]=5;
			if(d[i]==1)
				x[i]=read();
			else
			{
				x[i]=read();
				y[i]=read();
			}
		}
		int r=0;
		int i=1;
		while(1)
		{
			if(i>n)
			{
				puts("Yes");
				break;
			}
			if(d[i]==1)
			{
				r=(r+x[i])%256;
				if(vis[i][r])
				{
					puts("No");
					break;
				}
				else
					vis[i][r]=1;
				i++;
				if(i>n)
				{
					puts("Yes");
					break;
				}
			}
			else if(d[i]==2)
			{
				if(vis[i][r])
				{
					puts("No");
					break;
				}
				else
					vis[i][r]=1;
				if(r==x[i])
				{
					i=y[i];
				}
				else
					i++;
				if(i>n)
				{
					puts("Yes");
					break;
				}
			}
			else if(d[i]==3)
			{
				if(vis[i][r])
				{
					puts("No");
					break;
				}
				else
					vis[i][r]=1;
				if(r!=x[i])
					i=y[i];
				else
					i++;
				if(i>n)
				{
					puts("Yes");
					break;
				}
			}
			else if(d[i]==4)
			{
				if(vis[i][r])
				{
					puts("No");
					break;
				}
				else
					vis[i][r]=1;
				if(r<x[i])
					i=y[i];
				else
					i++;
				if(i>n)
				{
					puts("Yes");
					break;
				}
			}
			else if(d[i]==5)
			{
				if(vis[i][r])
				{
					puts("No");
					break;
				}
				else
					vis[i][r]=1;
				if(r>x[i])
					i=y[i];
				else
					i++;
				if(i>n)
				{
					puts("Yes");
					break;
				}
			}
			if(i>n)
			{
				puts("Yes");
				break;
			}
		}
	}
	return 0;
}