0分求解

#include <iostream>
#include<cstring>
using namespace std;
const int inf = 99999999;
#define maxn 100
int p, dis[maxn], tu[maxn][maxn], vis[maxn];
char str;
void de(int x, int y, int w) {
    if (tu[x][y] == 0) {
        tu[x][y] = w;
        tu[y][x] = w;
    }
    if (w < tu[x][y]) {
        tu[x][y] = w;
        tu[y][x] = w;
    }
}
void dj() {
    int u, min;
    for (int i = 1; i <= 51; i++) {
        min = inf;
        for(int j=1;j<=51;j++){
            if (vis[j] == 0 && dis[j] < min) {
                min = dis[j];
                u = j;
            }
        }
        vis[u] = 1;
        for (int v = 1; v <= 51; v++){
            if (dis[v] > dis[u] + tu[u][v] && vis[v] == 0 && tu[u][v] < inf) {
                dis[v] = dis[u] + tu[u][v];
            }      
        }
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin >> p;
    for (int i = 1; i <= p; i++) {
        for (int j = 1; j <= 51; j++) {
            tu[i][j] = inf;
        }
    }
    vis[52] = 1;
    for (int i = 1; i <= p; i++) {
        char a, b;
        int c;
        int aa, bb;
        cin >> a >> b >> c;
        if (a >= 'a' && a <= 'z') {
            aa = a - 'a' + 1;
        }
        else {
            aa = a - 'A' + 27;
        }
        if (b >= 'A' && b <= 'Z') {
            bb = b - 'Z' + 1;
        }
        else {
            bb = b - 'A' + 27;
        }
        de(aa, bb, c);
    }
    for (int i = 1; i <= 51; i++)
        dis[i] = tu[52][i];
    dj();
    int hh=inf,point;
    for(int i=1;i<=51;i++){
    	if(dis[i]<hh&&i>=27){
    		hh=dis[i];
    		point = i;
		}
	}
	str=point-27+'A';
	cout<<str<<" "<<hh;
    return 0;
}