/
find_string_in_matrix.cpp
90 lines (72 loc) · 1.13 KB
/
find_string_in_matrix.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <stdio.h>
#include <cstring>
// we can go to any adjacent block even diagonal
int M,N;
int r[8]={1,1, 1,-1,-1,-1,0, 0};
int c[8]={1,0,-1, 1, 0,-1,1,-1};
char P[102][102];
int vis[102][102];
int isSafe(int x,int y,char *s)
{
if(x>=0 && y>=0 && x<M && y<N && P[x][y]==*s && !vis[x][y])
{
return 1;
}
return 0;
}
int findNeighbour(char *s,int x,int y)
{
int n;
if(*s=='\0')
return 1;
if(isSafe(x,y,s))
{
vis[x][y]=1;
for(n=0;n<8;n++)
{
if(findNeighbour(s+1,x+r[n],y+c[n]))
return 1;
}
vis[x][y]=0;
return 0;
}
return 0;
}
void find(char *s)
{
int i,j;
for(i=0;i<M;i++)
{
for(j=0;j<N;j++)
{
if(P[i][j]==*s)
{
if(findNeighbour(s,i,j))
{
printf("YES\n");
return;
}
}
}
}
printf("NO\n");
}
int main()
{
int t;
scanf("%d",&t);
char str[]="ALLIZZWELL";//string to be searched for
while(t--)
{
scanf("%d%d",&M,&N);
for(int i=0;i<M;i++)
scanf("%s",P[i]);
for(int i=0;i<M;i++)
{
for(int j=0;j<N;j++)
vis[i][j]=0;
}
find(str);
}
return 0;
}