80pts求条 #6#7TLE

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778#include<bits/stdc++.h>
using namespace std;
int dis[105], pre[105], n, m, ans;
bool vis[105];
struct node{
    int id, w;
    bool operator <(const node &b) const{
        return w > b.w;
    }
};
struct edge{
    int id, w;
};
vector<edge> g[105];

int dijk(){
    memset(dis, 0x3f, sizeof dis);
    memset(vis, 0, sizeof vis);
    dis[1] = 0;
    priority_queue<node> q;
    q.push({1, 0});
    while(q.size()){
        int u = q.top().id, w = q.top().w;
        q.pop();
        if(vis[u]) continue;
        vis[u] = 1;
        for(auto it : g[u]){
            if(dis[u] + it.w < dis[it.id]){
                dis[it.id] = dis[u] + it.w;
                pre[it.id] = u;
                q.push({it.id, dis[it.id]});
            }
        }
    }
    return dis[n];
}

int main(){
    cin >> n >> m;
    for(int i = 1; i <= m; i++){
        int u, v, w;
        cin >> u >> v >> w;
        g[v].push_back({u, w});
        g[u].push_back({v, w});
    }
    int fdis = dijk();
    for(int now = n; now != 1; now = pre[now]){
        int u = now, v = pre[now], w = 0;
        for(auto &it : g[u]){
            if(it.id == v){
                w = it.w;
                it.w <<= 1;
                break;
            }
        }
        for(auto &it : g[v]){
            if(it.id == u){
                it.w <<= 1;
                break;
            }
        }
        ans = max(ans, dijk() - fdis);
        for(auto &it : g[u]){
            if(it.id == v){
                it.w >>= 1;
                break;
            }
        }
        for(auto &it : g[v]){
            if(it.id == u){
                it.w >>= 1;
                break;
            }
        }
    }
    cout << ans;
    return 0;
}