最短路 2

http://acm.hdu.edu.cn/showproblem.php?pid=6714 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define pii pair<int,int>
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e3+9;
const int maxm=2e5+9;
const int mod=998244353;

struct E
{
    int to,nex;
    ll w;
}edge[maxn<<2];
int tot;
int head[maxn];

void addedge(int u,int v,ll w)
{
    edge[tot].to=v;
    edge[tot].w=w;
    edge[tot].nex=head[u];
    head[u]=tot++;
}

int n,m;
ll dis[maxn];
int mxu[maxn];
ll ans=0;
struct node
{
    int to;
    int mu;
    ll w;
    node(){}
    node(int _to,ll _w,int _mu)
    {
        to=_to;
        w=_w;
        mu=_mu;
    }
    bool operator < (const node &b) const
    {
        if(w==b.w) return mu>b.mu;
        return w>b.w;
    }
};

bool vis[maxn];

void dj(int s)
{
    for(int i=0;i<=n;i++) dis[i]=1e18,mxu[i]=0,vis[i]=0;
    dis[s]=0;
    priority_queue<node>q;
    q.push(node(s,0,0));

    while(!q.empty())
    {
        node tmp=q.top();
        q.pop();

        int u=tmp.to;
        if(vis[u]) continue;
        vis[u]=1;
        //cout<<u<<" "<<dis[u]<<endl;
        for(int i=head[u];i!=-1;i=edge[i].nex)
        {
            int v=edge[i].to;
            ll w=edge[i].w;
            if(dis[v]>dis[u]+w)
            {
                dis[v]=dis[u]+w;

                mxu[v]=tmp.mu;

                int maxu=max(tmp.mu,v);
                //ans%=mod;
                q.push(node(v,dis[v],maxu));
            }
            else if(dis[v]==dis[u]+w)
            {
                mxu[v]=min(mxu[v],tmp.mu);
                int maxu=max(tmp.mu,v);
                q.push(node(v,dis[v],maxu));
            }

        }
    }
}

void init()
{
    tot=0;
    mem(head,-1);
}

int main()
{
    FAST_IO;

    //freopen("input.txt","r",stdin);


    int T;
    cin>>T;
    while(T--)
    {
        init();
        cin>>n>>m;
        for(int i=1;i<=m;i++)
        {
            int u,v,w;
            cin>>u>>v>>w;
            addedge(u,v,w);
            addedge(v,u,w);
        }

        ans=0;
        for(int i=1;i<=n;i++)
        {
            dj(i);
            for(int j=1;j<=n;j++) ans=(ans+mxu[j])%mod;
        }
        cout<<ans<<endl;

    }


    return 0;
}