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: 2,195 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
111
112
113
114
115
116
117
118
119
120
 
/*
****************************************************************
****************************************************************
-> Coded by Stavros Chryselis				   
-> Visit my github for more solved problems over multiple sites 
-> https://github.com/StavrosChryselis			  
-> Feel free to email me at [email protected]	
****************************************************************
****************************************************************
*/

#include <stdio.h>
#include <ctype.h>
#include <algorithm>
#include <string.h>
 
#define gc() getchar()
#define MAXN 2048
using namespace std;
 
inline char next_char()
{
	char c = gc();
 
	while (isspace(c))
		c = gc();
 
	return c;
}
 
char board[MAXN][MAXN];
int maxleft[MAXN][MAXN];
int maxright[MAXN][MAXN];
int maxup[MAXN][MAXN];
int maxdown[MAXN][MAXN];
 
int N;
 
inline void init()
{
	int i, j;
 
	scanf("%d", &N);
 
	for (i = 1; i <= N; i++)
		for (j = 1; j <= N; j++)
			board[i][j] = next_char();
 
	memset(maxleft, 0, sizeof(maxleft));
	memset(maxright, 0, sizeof(maxright));
	memset(maxdown, 0, sizeof(maxdown));
	memset(maxup, 0, sizeof(maxup));
 
	for (i = 1; i <= N; i++)
		for (j = 1; j <= N; j++)
		{
			if (board[i][j] == '#')
				maxleft[i][j] = maxleft[i][j - 1] + 1;
			else
				maxleft[i][j] = 0;
		}
 
	for (i = 1; i <= N; i++)
		for (j = N; j >= 1; j--)
		{
			if (board[i][j] == '#')
				maxright[i][j] = maxright[i][j + 1] + 1;
			else
				maxright[i][j] = 0;
		}
 
	for (j = 1; j <= N; j++)
		for (i = 1; i <= N; i++)
		{
			if (board[i][j] == '#')
				maxup[i][j] = maxup[i - 1][j] + 1;
			else
				maxup[i][j] = 0;
		}
 
	for (j = 1; j <= N; j++)
		for (i = N; i >= 1; i--)
		{
			if (board[i][j] == '#')
				maxdown[i][j] = maxdown[i + 1][j] + 1;
			else
				maxdown[i][j] = 0;
		}
}
 
inline int solve()
{
	int ans = 0;
	int i, j;
 
	for (i = 1; i <= N; i++)
		for (j = 1; j <= N; j++)
			if(board[i][j] == '#')
				ans = max(ans, 1 + min(min(maxleft[i][j - 1], maxright[i][j + 1]), min(maxup[i - 1][j], maxdown[i + 1][j])));
 
	return ans;
}
 
int main()
{
	int T;
 
//	freopen("input.txt", "r", stdin);
 
	scanf("%d", &T);
 
	while (T--)
	{
		init();
		printf("%d\n", solve());
	}
 
	return 0;
}