Submission #1692235

---

Source Code Expand

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
//#define mt make_tuple
//typedef tuple<pii,int,int> tp;
//typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
//template<class C>constexpr int size(const C &c){return (int)c.size();}
//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}
const double PI=acos(-1);
const double EPS=1e-7;
Def inf=sizeof(Def)==sizeof(long long)?9e18:1e9;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int dp1[5010][5010]={0};
int dp2[5010][5010]={0};
int main(){
	int q;
	cin>>q;
	while(q--){
		int n;
		cin>>n;
		vvi cost(n,vi(n));
		rep(i,n)rep(j,n)cin>>cost[i][j];
		rep(i,n)rep(j,n)if(cost[i][j]==-1)cost[i][j]=inf;
		vvi t=cost;
		rep(k,n)rep(i,n)rep(j,n)
			t[i][j]=min(t[i][j],t[i][k]+t[k][j]);
//		rep(i,n){rep(j,n)cout<<" "<<t[i][j];cout<<endl;}
//		cout<<endl;
		bool h=true;
		rep(i,n)rep(j,n)if(i==j&&(t[i][j]||cost[i][j])||cost[i][j]-t[i][j])h=false;
		if(h)cout<<"YES"<<endl;
		else cout<<"NO"<<endl;
	}
}

Submission Info

Judge Result