HDU 3549 Flow Problem

#include<queue>
#include<cstdio>
#include<cstring>
using namespace std;
const int inf=0x3f3f3f3f,MAX=205;
int n,m,c[MAX][MAX],dep[MAX];
int bfs(int s, int t){
    queue<int>q;
    while(!q.empty())q.pop();
    memset(dep,-1,sizeof(dep));
    dep[s]=0;
    q.push(s);
    while(!q.empty()){
        int u=q.front();
        q.pop();
        for(int v=1;v<=m;v++)
            if(c[u][v]>0&&dep[v]==-1){
                dep[v]=dep[u]+1;
                q.push(v);
            }
    }
    return dep[t]!=-1;
}
int dfs(int u,int mi,int t){
    if(u==t)return mi;
    int tmp;
    for(int v=1;v<=m;v++)
        if(c[u][v]>0&&dep[v]==dep[u]+1&&(tmp=dfs(v,min(mi,c[u][v]),t))){
            c[u][v]-=tmp;
            c[v][u]+=tmp;
            return tmp;
        }
    return 0;
}
int dinic(){
    int ans=0,tmp;
    while(bfs(1,m))
        while(1){
            tmp=dfs(1,inf,m);
            if(tmp==0)break;
            ans+=tmp;
        }
    return ans;
} 
int main(){
    int cas;
    scanf("%d",&cas);
    for(int t=1;t<=cas;t++){
        scanf("%d%d",&m,&n);
        memset(c,0,sizeof(c));
        int u,v,w;
        while(n--){
            scanf("%d%d%d",&u,&v,&w);
            c[u][v]+=w;
        }
        printf("Case %d: %d\n",t,dinic());
    }
    return 0;
}