Metric Matrice

Metric Matrice

时间限制: 1 Sec 内存限制: 128 MB

题目描述
nt j, determine if the distance matrix is “a metric” or not.

A distance matrix a[i][j] is a metric if and only if

1.  a[i][i] = 0


2. a[i][j]> 0  if i != j

3.  a[i][j] = a[j][i]

4.  a[i][j] + a[j][k] >= a[i][k]   i ¹ j ¹ k

输入
The first line of input gives a single integer, 1 ≤ N ≤ 5, the number of test cases. Then follow, for each test case,

• Line 1: One integer, N, the rows and number of columns, 2 <= N <= 30

• Line 2…N+1: N lines, each with N space-separated integers

(-32000 <=each integer <= 32000).

输出
Output for each test case , a single line with a single digit, which is the lowest digit of the possible facts on this list:

* 0: The matrix is a metric

* 1: The matrix is not a metric, it violates rule 1 above

* 2: The matrix is not a metric, it violates rule 2 above

* 3: The matrix is not a metric, it violates rule 3 above

* 4: The matrix is not a metric, it violates rule 4 above

样例输入
2
4
0 1 2 3
1 0 1 2
2 1 0 1
3 2 1 0
2
0 3
2 0

样例输出
0
3

#include<bits/stdc++.h>
using namespace std; 

int main()
{
	int n,i,j,k,t,flag;
	int a[40][40];
	cin>>t;
	while(t--)
	{
		flag=0;
		cin>>n;
		for(i=0;i<n;i++)
			for(j=0;j<n;j++)
				cin>>a[i][j];
		for(i=0;i<n;i++)
		{
			for(j=0;j<n;j++)
			{
				if(i==j&&a[i][j]!=0)
					flag=1;
				if(i!=j&&a[i][j]<=0)
					if(flag>2||flag==0)
						flag=2;
				if(a[i][j]!=a[j][i])
					if(flag>3||flag==0)
						flag=3;
			}
		}
		if(flag==0)
			for(k=0;k<n;k++)
				for(i=0;i<n;i++)
					for(j=0;j<n;j++)
						if(i!=j&&j!=k&&i!=k)
							if(a[i][j]+a[j][k]<a[i][k])
								flag=4;
		cout<<flag<<endl;
	}
	return 0;
}