HDU 2426

#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 505;
const int INF = (1<<30)-1;
int g[maxn][maxn];
int lx[maxn],ly[maxn];
int match[maxn];
bool visx[maxn],visy[maxn];
int slack[maxn];
int n,m;
bool dfs(int cur){
     visx[cur] = true;
     for(int y=1;y<=m;y++){
         if(visy[y])   continue;
//         if(g[cur][y]==INF)  continue;
         int t=lx[cur]+ly[y]-g[cur][y];
         if(t==0){
            visy[y] = true;
            if(match[y]==-1||dfs(match[y])){
                match[y] = cur;
                return true;
            }
         }
         else if(slack[y]>t){
                 slack[y]=t;
         }
     }
     return false;
}
int KM(){
    memset(match,-1,sizeof(match));
    memset(ly,0,sizeof(ly));
    for(int i=1 ;i<=n;i++){
         lx[i]=-INF;
       for(int j=1;j<=m;j++)
           if(g[i][j]>lx[i])   lx[i]=g[i][j];
   }
   for(int x=1;x<=n;x++){
        for(int i=1;i<=m;i++)  slack[i]=INF;
        while(true){
            memset(visx,false,sizeof(visx));
            memset(visy,false,sizeof(visy));
            if(dfs(x))  break;
            int d=INF;
            for(int i=1;i<=m;i++){
               if(!visy[i]&&d>slack[i])     d=slack[i];
            }
            for(int i=1;i<=n;i++){
               if(visx[i])                  lx[i]-=d;
            }
            for(int i=1;i<=m;i++){
               if(visy[i])                 ly[i]+=d;
               else                        slack[i]-=d;
            }
        }
   }
    int result = 0,flag=0;
    for(int i = 1; i <=m; i++){
        if(match[i]==-1||g[match[i]][i]==-INF)
            continue;
      if(match[i]>-1){
        result += g[match[i]][i];
        flag++;
      }
    }
    if(flag<n) result=-1;
    return result;
}
int main(){
    int a,b,c,e,ca=1;
    while(scanf("%d%d%d",&n,&m,&e)!=EOF){
        memset(g,0,sizeof(g));
        for(int i=1;i<=n;i++)
         for(int j=1;j<=m;j++)
             g[i][j]=-INF;
        for(int i=0;i<e;i++) {
            scanf("%d%d%d",&a,&b,&c);
            a++;     b++;
            if(c<0)  continue;            //      。
            g[a][b]=c;
        }

        int ans=KM();
        printf("Case %d: %d
",ca++,ans);
    }
    return 0;
}