Submission #1597702

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<utility>
typedef long long int ll;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<signed(n);i++)
#define EREP(i,n) for(int i=1;i<=signed(n);i++)
#define ALL(a) (a).begin(),(a).end()
using std::cout;
using std::vector;
using std::endl;
using std::cin;
using std::string;
//#define EVEL 1
#ifdef EVEL
#define DEB(X) cout << #X << ":" <<X<<" " ;
#define TF(f) f ? cout<<"true  " : cout<<"false ";
#define END cout<<"\n";
#else
#define DEB(X) {}
#define TF(f) {}
#define END {}
#endif
const int MOD = 1000000007;
const ll INF = 50000000000000000;
typedef std::pair<int,int> P;
struct edge {int to,cost;};
#define VMAX 301
    int N;
    ll d[VMAX][VMAX];
    ll A[VMAX][VMAX];
    bool vis[VMAX][VMAX]={};
    ll ans=0;
    bool No=false;
    void warshall_floyd(int n) { // nは頂点数
      for (int i = 0; i < n; i++)      // 経由する頂点
        for (int j = 0; j < n; j++)    // 開始頂点
          for (int k = 0; k < n; k++){  // 終端
          if(d[j][k]> d[j][i] + d[i][k]){No=true;return;}
          if(d[j][k] == d[j][i] + d[i][k]&&!(i==k||i==j)){vis[j][k]=true;}
            d[j][k] = std::min(d[j][k], d[j][i] + d[i][k]);
        }
    }
int main(){
    std::ios_base::sync_with_stdio(false);
    cin>>N;
    REP(i,N)REP(j,N){
        cin>>d[i][j];
    }
    warshall_floyd(N);
    if(No)cout<<"-1";
    else{
        for(int i=0;i<N;i++){
            for(int j=i+1;j<N;j++){
                //DEB(i)DEB(j)TF(vis[i][j])END
                if(!vis[i][j])ans+=d[i][j];
            }

        }
        cout<<ans;
    }
    return 0;
}

Submission Info

Judge Result