hihoCoder 1252 Kejin Game

2015 ACM / ICPC 北京站 D题

网络最大流

和同学讨论了一会儿，还是Xiang578机智... ...

/* ***********************************************
Author        :周甄陶
Email         :774388357@qq.com
Created Time  :2015/11/19 22:32:32
File Name     :acm\acm.cpp
************************************************ */

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;

const int maxn = *+;
const int INF = 0x7FFFFFFF;
struct Edge
{
    int from, to, cap, flow;
    Edge(int u, int v, int c, int f) :from(u), to(v), cap(c), flow(f){}
};
vector<Edge>edges;
vector<int>G[maxn];
bool vis[maxn];
int d[maxn];
int cur[maxn];
int n, m, s, t;
int S;
int U[+],V[+],Cost[+];
int P[maxn],D[maxn];

void init()
{
    for (int i = ; i < maxn; i++) G[i].clear();
    edges.clear();
}

void AddEdge(int from, int to, int cap)
{
    edges.push_back(Edge(from, to, cap, ));
    edges.push_back(Edge(to, from, , ));
    int w = edges.size();
    G[from].push_back(w - );
    G[to].push_back(w - );
}

bool BFS()
{
    memset(vis, , sizeof(vis));
    queue<int>Q;
    Q.push(s);
    d[s] = ;
    vis[s] = ;
    while (!Q.empty())
    {
        int x = Q.front();
        Q.pop();
        for (int i = ; i<G[x].size(); i++)
        {
            Edge e = edges[G[x][i]];
            if (!vis[e.to] && e.cap>e.flow)
            {
                vis[e.to] = ;
                d[e.to] = d[x] + ;
                Q.push(e.to);
            }
        }
    }
    return vis[t];
}

int DFS(int x, int a)
{
    if (x == t || a == )
        return a;
    int flow = , f;
    for (int &i = cur[x]; i<G[x].size(); i++)
    {
        Edge e = edges[G[x][i]];
        if (d[x]+ == d[e.to]&&(f=DFS(e.to,min(a,e.cap-e.flow)))>)
        {
            edges[G[x][i]].flow+=f;
            edges[G[x][i] ^ ].flow-=f;
            flow+=f;
            a-=f;
            if(a==) break;
        }
    }
    if(!flow) d[x] = -;
    return flow;
}

int dinic(int s, int t)
{
    int flow = ;
    while (BFS())
    {
        memset(cur, , sizeof(cur));
        flow += DFS(s, INF);
    }
    return flow;
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        init();
        scanf("%d%d%d",&n,&m,&S);
        for(int i=;i<=m;i++)
            scanf("%d%d%d",&U[i],&V[i],&Cost[i]);
        for(int i=;i<=n;i++) scanf("%d",&P[i]);
        for(int i=;i<=n;i++) scanf("%d",&D[i]);
        for(int i=;i<=n;i++) AddEdge(i,i+n,D[i]);
        for(int i=;i<=n;i++) AddEdge(,i,P[i]);
        for(int i=;i<=m;i++) AddEdge(U[i]+n,V[i],Cost[i]);
        AddEdge(S+n,n+n+,INF);
        s=; t=n+n+;
        printf("%d\n",dinic(s,t));
    }
    return ;
}