procon

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub mugen1337/procon

:heavy_check_mark: test/yuki5764.test.cpp

Depends on

Code

#define PROBLEM "https://yukicoder.me/problems/5764"

#include "../template.hpp"

#include "../Graph/WarshallFloyd.hpp"

signed main(){
    int n,m;cin>>n>>m;
    vector<vector<ll>> mat(n,vector<ll>(n,LINF));
    rep(i,n) mat[i][i]=0;

    rep(i,m){
        int u,v;ll w;cin>>u>>v>>w;u--,v--;
        chmin(mat[u][v],w);
    }

    mat=WarshallFloyd(mat,LINF);
    rep(i,n){
        ll res=0;
        rep(j,n) if(mat[i][j]<LINF) res+=mat[i][j];
        cout<<res<<endl;
    }
    return 0;
}
#line 1 "test/yuki5764.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/5764"

#line 1 "template.hpp"
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

#line 4 "test/yuki5764.test.cpp"

#line 1 "Graph/WarshallFloyd.hpp"
template<typename T>
vector<vector<T>> WarshallFloyd(vector<vector<T>> mat, T inf=1000000100){
    int n=(int)mat.size();
    for(int k=0;k<n;k++)for(int i=0;i<n;i++)for(int j=0;j<n;j++)
    if(mat[i][k]<inf and mat[k][j]<inf) mat[i][j]=min(mat[i][j],mat[i][k]+mat[k][j]);
    return mat;
}
#line 6 "test/yuki5764.test.cpp"

signed main(){
    int n,m;cin>>n>>m;
    vector<vector<ll>> mat(n,vector<ll>(n,LINF));
    rep(i,n) mat[i][i]=0;

    rep(i,m){
        int u,v;ll w;cin>>u>>v>>w;u--,v--;
        chmin(mat[u][v],w);
    }

    mat=WarshallFloyd(mat,LINF);
    rep(i,n){
        ll res=0;
        rep(j,n) if(mat[i][j]<LINF) res+=mat[i][j];
        cout<<res<<endl;
    }
    return 0;
}
Back to top page