-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathCAOS2.cpp
96 lines (82 loc) · 3.63 KB
/
CAOS2.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
91
92
93
94
95
96
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int prime1[501] = {0,0,1,2,2,3, 3, 4, 4, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 17, 17, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 25, 25, 25, 25, 26, 26, 27, 27, 27, 27, 28, 28, 29, 29, 29, 29, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 31, 31, 31, 31, 32, 32, 32, 32, 32, 32, 33, 33, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 35, 35, 36, 36, 36, 36, 36, 36, 37, 37, 37, 37, 37, 37, 38, 38, 38, 38, 39, 39, 39, 39, 39, 39, 40, 40, 40, 40, 40, 40, 41, 41, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 43, 43, 44, 44, 44, 44, 45, 45, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 48, 48, 48, 48, 49, 49, 50, 50, 50, 50, 51, 51, 51, 51, 51, 51, 52, 52, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 54, 54, 54, 54, 54, 54, 55, 55,
55, 55, 55, 55, 56, 56, 56, 56, 56, 56, 57, 57, 58, 58, 58, 58, 58, 58, 59, 59, 59, 59, 60, 60, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 63, 63, 63, 63, 64, 64, 65, 65, 65, 65, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 67, 67, 67, 67, 67, 67, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 69, 69, 70, 70, 70, 70, 71, 71, 71, 71, 71, 71, 72, 72, 72, 72, 72, 72, 72, 72, 73, 73, 73, 73, 73, 73, 74, 74, 74, 74, 74, 74, 75, 75, 75, 75, 76, 76, 76, 76, 76, 76, 77, 77, 77, 77, 77, 77, 77, 77, 78, 78, 78, 78, 79, 79, 79, 79, 79, 79, 79, 79, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 81, 81, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 83, 83, 84, 84, 84, 84, 84, 84, 85, 85, 85, 85, 86, 86, 86, 86, 86, 86, 87, 87, 87, 87, 87, 87, 87, 87, 88, 88, 88, 88, 89, 89, 90, 90, 90, 90, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 92, 92, 92, 92, 92, 92, 92, 92, 93, 93, 93, 93, 94, 94, 94, 94, 94, 94, 94, 94, 95,95};
int t;
cin >> t;
while(t!=0){
int r,c,ans=0;
cin >> r >> c;
string a[r];
for (int i=0;i<r;i++)
cin >> a[i];
if (r<5 || c<5)
cout << "0" << endl;
else{
int l2[r][c];
int r2[r][c];
int u2[r][c];
int d2[r][c];
for (int i=0;i<r;i++)
for(int j=0;j<c;j++){
if (j==0 & a[i][j]=='#'){
l2[i][j]=-1;
r2[i][j]=-1;
u2[i][j]=-1;
d2[i][j]=-1;
}
if (j==0){
l2[i][j]=0;
r2[i][c-j-1]=0;
}
else{
if (a[i][j-1]=='^' && a[i][j]=='^')
l2[i][j]=l2[i][j-1]+1;
if (a[i][j] == '#')
l2[i][j]=-1;
if (a[i][j-1]=='#' && a[i][j]=='^')
l2[i][j]=0;
if (a[i][c-j]=='^' && a[i][c-j-1]=='^')
r2[i][c-j-1]=r2[i][c-j]+1;
if (a[i][c-j-1]=='#')
r2[i][c-j-1]=-1;
if (a[i][c-j]=='#' && a[i][c-j-1]=='^')
r2[i][c-j-1]=0;
}
if (i==0){
u2[i][j]=0;
d2[r-1-i][j]=0;
}
if (i!=0){
if (a[i-1][j]=='^' && a[i][j]=='^')
u2[i][j]=u2[i-1][j]+1;
if (a[i][j]=='#')
u2[i][j]=-1;
if (a[i-1][j]=='#' && a[i][j]=='^')
u2[i][j]=0;
if (a[r-i][j]=='^' && a[r-i-1][j]=='^')
d2[r-i-1][j]=d2[r-i][j]+1;
if (a[r-i-1][j]=='#')
d2[r-i-1][j]=-1;
if (a[r-i][j]=='#'&& a[r-i-1][j]=='^')
d2[r-i-1][j]=0;
}
}
for (int i=2;i<r-2;i++)
for (int j=2;j<c-2;j++){
if (l2[i][j]!=-1){
int x1=min(l2[i][j],u2[i][j]);
int x2=min(r2[i][j],d2[i][j]);
int x=min(x1,x2);
if (x>1)
ans=ans+prime1[x];
}
}
cout << ans << endl;
}
t--;
}
return 0;
}