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
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (long long i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (long long i = (a); i >= (b); --i)
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define fi first
#define se second
#define pb push_back
#define SZ(a) ((int) a.size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef array<ll,3> arr;
typedef double DB;
typedef pair<DB,DB> pdd;
constexpr ll MAXN=static_cast<ll>(1e2)+10,INF=static_cast<ll>(1e18)+3;
ll N,T,A[MAXN][MAXN];
char maze[MAXN][MAXN];
inline void solve(){
cin>>N;
for(int i=1;i<=N;++i){
for(int j=1;j<=N;++j){
cin>>maze[i][j];
}
}
FOR(i,1,N){
FOR(j,1,N){
A[i][j]=INF;
}
}
queue<arr> q;
FOR(i,1,N){
FOR(j,1,N){
if(i==j){
q.push({i,j,0});
A[i][j]=0;
}else if(maze[i][j]!='-'){
q.push({i,j,1});
A[i][j]=1;
}
}
}
while(!q.empty()){
ll x=q.front()[0],y=q.front()[1],dis=q.front()[2];
q.pop();
FOR(i,1,N){
char c=maze[i][x];
if(c=='-') continue;
FOR(j,1,N){
char cj=maze[y][j];
if(cj==c && dis+2<A[i][j]){
q.push({i,j,dis+2});
A[i][j]=min(A[i][j],dis+2);
}
}
}
}
FOR(i,1,N){
FOR(j,1,N){
cout<<(A[i][j]!=INF?A[i][j]:-1)<<" ";
}
cout<<"\n";
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
solve();
return 0;
}
|
