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
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<complex>
#include<cstdlib>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define mid (x+y>>1)
#define sqr(x) ((x)*(x))
#define NM 205
#define nm 400005
const double pi=acos(-1);
const int inf=1e9+7;
using namespace std;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
int n,a[NM],b[NM][NM];
ll d[NM][NM][NM],f[NM][NM][NM],g[NM][NM][NM],h[NM][NM][NM],ans;
int main(){
int _=read();while(_--){
n=read();inc(i,1,n)a[i]=read();
inc(i,1,n)inc(j,1,n)scanf("%1d",&b[i][j]);
ans=0;
inc(i,1,n)inc(j,1,n)inc(k,1,n){
if(a[i]==a[j]&&a[j]==a[k]){
d[i][j][k]=(1+h[i-1][j-1][k-1])%inf;
}else d[i][j][k]=0;
g[i][j][k]=g[i][j][k-1]+d[i][j][k];
if(b[a[i]][a[k+1]])f[i][j][k]=f[i][j-1][k]+g[i][j][k];else f[i][j][k]=0;
h[i][j][k]=h[i-1][j][k]+f[i][j][k];
ans+=d[i][j][k];
}
printf("%lld\n",ans%inf);
}
return 0;
}
|
