MRT Map （最短路）

处理一下边权，建个图，几乎是裸的最短路算法，可用迪杰斯特拉或spfa

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#define endl '\n'
#define lowbit(x) x &(-x)
#define mh(x) memset(x, -1, sizeof h)
#define debug(x) cerr << #x << "=" << x << endl;
#define brk exit(0);
const int N = 2e5 + 10;
const int mod = 998244353;
const double esp = 1e-6;
const double pi = acos(-1);
inline int read(){
    register int x=0,f=1;register char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9')x=(x<<3)+(x<<1)+(c^48),c=getchar();
    return x*f;
}
inline void write(register int x){
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
map<int,string> mp;
unordered_map<int, unordered_map<char, bool>> ump;
typedef pair<int, int> PII;
vector<PII> g[N];
int dist[N];
bool st[N];
int get(int a,int b)
{
    int res = 0;
    for (int i = 'a'; i <= 'z';i++)
    {
        if(ump[a][i]&&ump[b][i])
            res++;
    }
    return res;
}
int spfa(int s,int p)
{
    memset(dist, 0x3f, sizeof dist);
    memset(st, 0, sizeof st);
    queue<int> q;
    q.push(s);
    dist[s] = 0;
    while(q.size())
    {
        int t = q.front();
        q.pop();
        st[t] = false;
        for(auto it:g[t])
        {
            int j=it.first,w=it.second;
            if(dist[j]>dist[t]+w)
            {
                dist[j] = dist[t] + w;
                if(!st[j])
                {
                    q.push(j);
                    st[j] = true;
                }
            }
        }
    }
    return dist[p];
}
void solve()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n;i++)
    {
        string s;
        cin >> s;
        //mp[i] = s;
        for (int j = 0; j <s.size();j++){
            if(s[j]<'a')
                s[j] += 32;
            ump[i][s[j]] = true;
        }
    }
    while(m--)
    {
        int a, b;
        cin >> a >> b;
        int w = get(a, b);
        //cout << a << " " << b << " " << w << endl;
        g[a].push_back({b,w});
        g[b].push_back({a,w});
    }
    int s, t;
    cin >> s >> t;
    cout << spfa(s, t);
}
signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    int T = 1;
    //cin >> T;
    while (T--)
    {
        solve();
    }
    return 0;
}