#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int N,M; ll E[101][101]; ll D[101]; void solve() { int i,j,k,l,r,x,y; string s; cin>>N>>M; FOR(x,N) FOR(y,N) E[x][y]=(x==y?0:1LL<<60); FOR(i,M) { ll d; cin>>x>>y>>d; E[x-1][y-1]=min(E[x-1][y-1],d); } FOR(i,N) { ll ret=0; FOR(j,N) D[j]=1LL<<60; D[i]=0; priority_queue> Q; Q.push({0,i}); while(Q.size()) { ll co=-Q.top().first; int cur=Q.top().second; Q.pop(); if(co!=D[cur]) continue; FOR(j,N) if(j!=cur&&D[j]>co+E[cur][j]) { D[j]=co+E[cur][j]; Q.push({-D[j],j}); } } FOR(j,N) if(D[j]<1LL<<50) ret+=D[j]; cout<