Submission #63092314

---

Source Code Expand

#include<bits/stdc++.h>
#define ll long long
#define int ll
#define L x<<1
#define R x<<1|1
#define mid ((l+r)>>1)
#define lc L,l,mid
#define rc R,mid+1,r
#define Root 1,1,n
#define OK Ll<=l&&r<=Rr
#define rep(x,y,z) for(int x=(y);x<=(z);x++)
#define per(x,y,z) for(int x=(y);x>=(z);x--)
#define repn(x) rep(x,1,n)
#define repm(x) rep(x,1,m)
#define pb push_back
#define e(x) for(int i=h[x],y=to[i];i;i=nxt[i],y=to[i])
#define E(x) for(auto y:p[x])
#define Pi pair<int,int>
#define ui unsigned ll
#define yy puts("Yes"),exit(0)
#define nn puts("No"),exit(0)
#define YY return puts("Yes"),void()
#define	NN return puts("No"),void()
inline int read(){int s=0,w=1;char c=getchar();while(c<48||c>57) {if(c=='-') w=-1;c=getchar();}while(c>=48&&c<=57)s=(s<<1)+(s<<3)+c-48,c=getchar();return s*w;}
inline void pf(ll x){if(x<0) putchar('-'),x=-x;if(x>9)pf(x/10);putchar(x%10+48);}
using namespace std;
const int N=1e2+5,M=1e6+5,inf=(1LL<<30)-1,mod=998244353;
const ll llf=1e18;
int n,m;
struct node{
	int y,w;
};
vector<node>p[N];
vector<int>Q[N][27];
inline void add_(int a,int b,char c){
	Q[a][c-'a'+1].pb(b);
	p[b].pb({a,c-'a'+1});
}
string s[N];
int f[N][N],g[N][N][27];
struct nod{
	int x,y,c;
};
inline void bfs(){
	queue<nod>q;
	repn(x)f[x][x]=0,q.push({x,x,-1});
	repn(x)rep(c,1,26)for(auto y:Q[x][c])if(y^x)f[x][y]=1,q.push({x,y,-1});
	while(!q.empty()){
		int A=q.front().x,B=q.front().y,c=q.front().c;
		q.pop();
		if(c==-1){
			for(auto z:p[A]){
				int Z=z.y,C=z.w;
				if(g[Z][B][C]>f[A][B]+1)g[Z][B][C]=f[A][B]+1,q.push({Z,B,C});
			}
		}else {
			for(auto Y:Q[B][c]){
				if(f[A][Y]>g[A][B][c]+1)f[A][Y]=g[A][B][c]+1,q.push({A,Y,-1});
			}
		}
	}
}
inline void Main(){
	n=read();
	repn(i)cin>>s[i],s[i]='#'+s[i];
	repn(i)repn(j){
		if(s[i][j]!='-')add_(i,j,s[i][j]);
	}
	repn(i)repn(j)f[i][j]=inf;
	repn(i)repn(j)rep(c,1,26)g[i][j][c]=inf;
	bfs();
	repn(x){
		repn(y)if(f[x][y]==inf)cout <<-1<<' ';
		else cout <<f[x][y]<<' ';
		puts("");
	}
}
signed main(){
	int T=1;
	while(T--)Main();
	return 0;
}

Submission Info

Judge Result