Hugging Face's logo

Datasets:
slayone
/
uva_spoj_raw

Tasks:
Translation
Text Generation
Size:
1K<n<10K
Tags:
code
License:
Dataset card Files Community
uva_spoj_raw
File size: 1,707 Bytes 
c4b0eef
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
 
/*
****************************************************************
****************************************************************
-> Coded by Stavros Chryselis				   
-> Visit my github for more solved problems over multiple sites 
-> https://github.com/StavrosChryselis			  
-> Feel free to email me at stavrikios@gmail.com	
****************************************************************
****************************************************************
*/

#include <stdio.h>
#include <string.h>
#include <string>
#define gc() getchar_unlocked()
 
using namespace std;
 
int dx[]={-1, -1, -1,  0, 0,  1, 1, 1};
int dy[]={-1,  0,  1, -1, 1, -1, 0, 1};
char board[128][128];
bool V[128][128];
int R, C;
string S = "ALLIZZWELL";
 
inline void init()
{
	int i, j;
 
	scanf("%d %d\n", &R, &C);
	memset(board, 0, sizeof(board));
 
	for(i=0; i<R; i++)
	{
		for(j=0; j<C; j++)
			board[i][j] = gc();
		gc();
	}
}
 
inline int check(int pos, int x, int y)
{
	if(pos == S.length())
		return 1;
 
	if(x<0 || y<0 || x>=R || y>=C)
		return 0;
 
	if(board[x][y] != S[pos] || V[x][y])
		return 0;
 
	return -1;
}
 
int solve(int x, int y, int pos)
{
	int i;
 
	int temp = check(pos, x, y);
 
	if(temp == 0)
		return 0;
 
	if(temp == 1)
		return 1;
 
	V[x][y] = 1;
 
	for(i=0; i<8; i++)
		if(solve(x+dx[i], y+dy[i], pos+1))
			return 1;
 
	V[x][y] = 0;
	return 0;
}
 
inline bool solvee()
{
	int i, j;
 
	for(i=0; i<R; i++)
		for(j=0; j<C; j++)
		{
			memset(V, 0, sizeof(V));
			if(solve(i, j, 0))
				return 1;
		}
	return 0;
}
 
int main()
{
	int T;
 
	//freopen("input.txt","r",stdin);
 
	scanf("%d", &T);
 
	while(T--)
	{
		init();
		if(solvee())
			printf("YES\n");
		else
			printf("NO\n");
	}
 
	return 0;
}