hdoj 5641 King's Phone 【模拟】

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#define PI acos(-1.0)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define fi first
#define se second
#define ll o<<1
#define rr o<<1|1
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 1e6 + 1;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int Map[10][10] = {
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-1, -1, 0, 2, 0, 0, 0, 4, 0, 5,
-1, 0, -1, 0, 0, 0, 0, 0, 5, 0,
-1, 2, 0, -1, 0, 0, 0, 5, 0, 6,
-1, 0, 0, 0, -1, 0, 5, 0, 0, 0,
-1, 0, 0, 0, 0, -1, 0, 0, 0, 0,
-1, 0, 0, 0, 5, 0, -1, 0, 0, 0,
-1, 4, 0, 5, 0, 0, 0, -1, 0, 8,
-1, 0, 5, 0, 0, 0, 0, 0, -1, 0,
-1, 5, 0, 6, 0, 0, 0, 8, 0, -1,
};
bool vis[10];
int a[10];
int main()
{
int t; scanf("%d", &t);
while(t--)
{
int k; scanf("%d", &k); int cnt = 0;
CLR(vis, false); bool flag = true;
for(int i = 1; i <= k; i++) {
scanf("%d", &a[i]);
if(a[i] == 0 || a[i] > 9) {
flag = false;
}
if(vis[a[i]]) {
flag = false;
}
else {
cnt++;
vis[a[i]] = true;
}
}
if(cnt < 4) {
flag = false;
}
if(!flag) {
printf("invalid\n");
continue;
}
CLR(vis, false); vis[a[1]] = true;
for(int i = 2; i <= k; i++) {
int op = Map[a[i-1]][a[i]];
if(op > 0 && !vis[op]) {
flag = false;
break;
}
vis[a[i]] = true;
}
printf(flag ? "valid\n" : "invalid\n");
}
return 0;
}