atcoder Restoring Road Network(floyd的应用)

给出一张最短路的表,问你是否有可能正确,如果正确,输出最短的所有路径和.
这题吧,其实一开始是猜的,看到300的数据,想到了floyd,然后这样想,一个最短路数值被认为是”错误的”,肯定是要先认为其他是正确的,显然,是短的推翻长的,所以,跑一遍floyd,判断是否有某个段有问题,然后最短路径和的话,注意到假如一个最短路,不会和任何中继方式相等,那他就是直连最短路,一定要他的,所以这种,被加上.

#include <iostream>
using namespace std;
#define debug(x) std::cerr << #x << " = " << (x) << std::endl
typedef long long LL;
const int MAXN = 3e2+17;
LL dis[MAXN][MAXN],n;
bool can[MAXN][MAXN];
LL func()
{
    LL ret = 0;
    for (int k = 0; k < n; ++k)
        for (int i = 0; i < n; ++i)
            for (int j = i+1; j < n; ++j)
            {
                if(dis[i][j]>dis[i][k]+dis[k][j]) return -1;
                if(dis[i][j]==dis[i][k]+dis[k][j]&&k!=j&&k!=i)
                    can[i][j] = true;
            }
    for (int i = 0; i < n; ++i)
        for (int j = i+1; j < n; ++j)
            if(!can[i][j])
                ret += dis[i][j];
    return ret;
}
int main(int argc ,char const *argv[])
{
    #ifdef noob
    freopen("Input.txt","r",stdin);freopen("Output.txt","w",stdout);
    #endif
    cin>>n;
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
        {
            can[i][j] = false;
            cin>>dis[i][j];
        }
    cout<<func()<<endl;
    return 0;
}

这题还是蛮简单的.