#include<iostream>
#include<stdlib.h>
#include<stdio.h>
#include<string>
#include<vector>
#include<deque>
#include<queue>
#include<algorithm>
#include<set>
#include<map>
#include<stack>
#include<time.h>
#include<math.h>
#include<list>
#include<cstring>
#include<fstream>
#include<bitset>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define INF 1000000007
char line[55];
vector<int>e[53];
int d[55];//d[i]=到i点的最短距离
int dijkstra(int n){
fill(d,d+n+1,INF);
d[1]=0;
priority_queue<pii,vector<pii>,greater<pii> >que;//fist d,second index
que.push({0,1});
while(!que.empty()){
int fr=que.top().second;
que.pop();
for(int i=0;i<e[fr].size();++i){
int to=e[fr][i];
if(d[to]>d[fr]+i){//边的权值就等于这条边之前有多少条从i出发的边
d[to]=d[fr]+i;
que.push({d[to],to});
}
}
}
return d[n]==INF?-1:d[n];
}
int main()
{
int t,n;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(int i=0;i<53;++i)
e[i].clear();//清空邻接链表
for(int i=1;i<=n;++i){
scanf("%s",line);
for(int j=0;j<n;++j)
if(line[j]=='Y')
e[i].push_back(j+1);
}
cout<<dijkstra(n)<<endl;
}
return 0;
}
紫书上的模板
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
using namespace std;
const int maxn=55;
struct HeadNode{
int d,u;
bool operator < (const HeadNode& rhs) const{
return d>rhs.d;
}
};
struct Edge{
int from,to,dist;
Edge(int u,int v,int d):from(u),to(v),dist(d){}
};
struct Dijkstra{
int n,m;
vector<Edge> edges;
vector<int> G[maxn];
bool done[maxn];
int d[maxn];
int p[maxn];
void init(int n){
this->n=n;
for(int i=0;i<n;i++){
G[i].clear();
}
edges.clear();
}
void AddEdge(int from,int to,int dist){
edges.push_back(Edge(from,to,dist));
m=edges.size();
G[from].push_back(m-1);
}
void dijkstra(int s){
priority_queue<HeadNode> Q;
for(int i=0;i<n;i++) d[i]=INF;
d[s]=0;
memset(done,0,sizeof(done));
Q.push((HeadNode){0,s});
while(!Q.empty()){
HeadNode x=Q.top();
Q.pop();
int u=x.u;
if(done[u]) continue;
done[u]=true;
for(int i=0;i<G[u].size();i++){
Edge& e=edges[G[u][i]];
if(d[e.to]>d[u]+e.dist){
d[e.to]=d[u]+e.dist;
p[e.to]=G[u][i];
Q.push((HeadNode){d[e.to],e.to});
}
}
}
}
};
int main()
{
return 0;
}