Codeforces Round #361 div2

ProblemA(Codeforces Round 689A):

题意：

　　给一个手势，问这个手势是否是唯一。

思路：

　　暴力，模拟将这个手势上下左右移动一次看是否还在键盘上即可。

代码：

 1 #include <cmath>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cstdlib>
 5 #include <ctime>
 6 #include <set>
 7 #include <map>
 8 #include <list>
 9 #include <stack>
10 #include <queue>
11 #include <string>
12 #include <vector>
13 #include <fstream>
14 #include <iterator>
15 #include <iostream>
16 #include <algorithm>
17 using namespace std;
18 #define LL long long
19 #define INF 0x3f3f3f3f
20 #define MOD 1000000007
21 #define eps 1e-6
22 #define MAXN 10
23 #define MAXM 100
24 #define dd {cout<<"debug"<<endl;}
25 #define pa {system("pause");}
26 #define p(x) {printf("%d\n", x);}
27 #define pd(x) {printf("%.7lf\n", x);}
28 #define k(x) {printf("Case %d: ", ++x);}
29 #define s(x) {scanf("%d", &x);}
30 #define sd(x) {scanf("%lf", &x);}
31 #define mes(x, d) {memset(x, d, sizeof(x));}
32 #define do(i, x) for(i = 0; i < x; i ++)
33 #define dod(i, x, l) for(i = x; i >= l; i --)
34 #define doe(i, x) for(i = 1; i <= x; i ++)
35 int n;
36 int row[MAXN] = {4, 1, 1, 1, 2, 2, 2, 3, 3, 3};
37 int col[MAXN] = {2, 1, 2, 3, 1, 2, 3, 1, 2, 3};
38 int dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
39 char str[MAXN];
40 
41 bool move_one_step(int d)
42 {
43     for(int i = 0; i < n; i ++)
44     {
45         int x = str[i] - '0';
46         if((d == 2 || d == 3) && x == 0) return false;
47         if(row[x] + dir[d][0] < 1 || col[x] + dir[d][1] < 1 || col[x] + dir[d][1] > 3)
48             return false;
49         if(x != 8 && (row[x] + dir[d][0] > 3))
50             return false;
51     }
52     return true;
53 }
54 
55 void get_ans()
56 {
57     bool flag = false;
58     for(int d = 0; d < 4; d ++)
59     {
60         if(move_one_step(d)) flag = true;
61     }
62     printf(flag ? "NO\n" : "YES\n");
63 }
64 
65 int main()
66 {
67     scanf("%d", &n);
68     scanf("%s", str);
69     
70     get_ans();
71     return 0;
72 }

View Code