今天的每日一题是一个简单的bfs,还阔以,会做,不过add函数写错了,浪费了很多时间去debug
解题思路:
- 首先看到最短路程,那么就想到bfs,怎么转换为bfs问题,就是4个字符首尾相连,并且是单向的
- 这里就是处理稍微麻烦些,需要整大小写,不过把大写多加 26 即可
- 然后就是简单的bfs
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int N = 100010, M = 200010;
int h[N], ne[M], e[M], idx;
int dist[N];
void add(int x , int y){
e[idx] = y, ne[idx] = h[x], h[x] = idx++;
}
void bfs(int u){
queue<int> q;
q.push(u);
dist[u] = 0;
while(!q.empty()){
int t = q.front();
q.pop();
for (int i = h[t]; i != -1; i = ne[i]){
int j = e[i];
if (dist[j] == -1){
dist[j] = dist[t] + 1;
q.push(j);
// printf("%d %d\n",j, dist[j]);
}
}
}
}
int main(){
string s, e;
cin>>s>>e;
int st, en;
memset(h,-1,sizeof h);
if (s[0]>='A' && s[0] <= 'Z'){
st = s[0] - 'A' + 1 + 26;
}
else st = s[0] - 'a' + 1;
if (e[0] >='A' && e[0] <= 'Z'){
en = e[0] - 'A' + 1 + 26;
}
else en = e[0] - 'a' + 1;
int n;
scanf("%d",&n);
for (int i = 0; i < n; i++){
string st1;
cin>>st1;
int l, r;
if (st1[0] >= 'A' && st1[0] <= 'Z'){
l = st1[0] - 'A' + 1 + 26;
}
else{
l = st1[0] - 'a' + 1;
}
if (st1[3] >= 'A' && st1[3] <= 'Z'){
r = st1[3] - 'A' + 1 + 26;
}
else{
r = st1[3] - 'a' + 1;
}
add(l,r);
}
memset(dist,-1,sizeof dist);
bfs(st);
if (dist[en] != -1){
printf("%d\n",dist[en]);
}
else{
puts("-1");
}
return 0;
}