BZOJ 3332

题解：给边赋上权值，然后求最大生成树，如果不符合那就无解

证明：留坑

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxN=;
const int maxM=;
const int oo=;

int TT;
int n,m;
int f[maxN][maxN];
struct Edge{
    int u,v,ed;
}edges[maxM];
bool mycmp(const Edge &E1,const Edge &E2){
    return E1.ed>E2.ed;
}

int father[maxN];
int Getf(int x){
    if(father[x]==x)return x;
    return father[x]=Getf(father[x]);
}
void Unionn(int x,int y){
    int fx=Getf(x);
    int fy=Getf(y);
    if(fx!=fy){
        father[fx]=fy;
    }
}

int cntedge=;
int head[maxN]={};
int to[maxN<<],nex[maxN<<],dist[maxN<<];
void Addedge(int x,int y,int z){
    nex[++cntedge]=head[x];
    to[cntedge]=y;
    dist[cntedge]=z;
    head[x]=cntedge;
}

int fdist[maxN];
void Dfs(int x,int fa){
    for(int i=head[x];i;i=nex[i]){
        if(to[i]==fa)continue;
        fdist[to[i]]=min(fdist[x],dist[i]);
        Dfs(to[i],x);
    }
}

void Myinit(){
    cntedge=;
    memset(head,,sizeof(head));
}
int rd(){
    int r=,k=;
    char c=getchar();
    for(;c<''||c>'';c=getchar())if(c=='-')k=-;
    for(;c>=''&&c<='';c=getchar())r=r*+c-'';
    return r*k;
}

int main(){
    scanf("%d",&TT);
    for(int t=;t<=TT;++t){
        Myinit();
        scanf("%d%d",&n,&m);
        for(int i=;i<=m;++i)scanf("%d%d",&edges[i].u,&edges[i].v);
        for(int i=;i<=n;++i){
            for(int j=;j<=n;++j){
                scanf("%d",&f[i][j]);
            }
        }
        for(int i=;i<=m;++i){
            int u=edges[i].u;
            int v=edges[i].v;
            edges[i].ed=f[u][v];
        }
        sort(edges+,edges++m,mycmp);
        for(int i=;i<=n;++i)father[i]=i;
        for(int i=;i<=m;++i){
            int u=edges[i].u,v=edges[i].v,z=edges[i].ed;
            if(Getf(u)==Getf(v))continue;
            Unionn(u,v);
            Addedge(u,v,z);
            Addedge(v,u,z);
        }
        int fla=;
        for(int u=;u<=n;++u){
            fdist[u]=oo;
            Dfs(u,);
            for(int v=;v<=n;++v){
                if(u==v)continue;
                if(Getf(u)!=Getf(v)){
                    if(f[u][v]!=-){
                        fla=;break;
                    }
                }else{
                    if(f[u][v]!=fdist[v]){
                        fla=;break;
                    }
                }
            }
            if(!fla)break;
        }
        if(fla)printf("Case #%d: Yes\n",t);
        else printf("Case #%d: No\n",t);
    }
    return ;
}