Uva 12125 March of the Penguins（最大流）

题目地址

思路：

1.每个点都有一次数限制。拆点：将每个点i拆成i和i'，连容量为m[i]的边，代表只能m[i]的流量通过。

2.若i和j可到达，连边i'---->j，容量为INF。

3.由于最终到达地点未知，枚举终点i，判断最大流是否等于企鹅总数即可。

#include<cmath>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define S 0
#define debug
using namespace std;
const int maxn = 200+50;
const int INF = 1000000000;
struct Edge
{
    int from, to, cap, flow;
    Edge(int a,int b,int c,int d):from(a),to(b),cap(c),flow(d) {}
};
struct Dinic
{
    int n, m, s, t;
    vector<Edge> edges;
    vector<int> G[maxn];
    bool vis[maxn];
    int d[maxn];
    int cur[maxn];
    void init(int n)
    {
        this->n=n;
        for(int i = 0; i < n; i++) G[i].clear();
        edges.clear();
    }
    void addedge(int from, int to, int cap)
    {
        edges.push_back(Edge(from,to,cap,0));
        edges.push_back(Edge(to,from,0,0));
        int m = edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }
    bool BFS()
    {
        memset(vis, 0, sizeof(vis));
        queue<int> Q;
        Q.push(s);
        vis[s] = 1;
        d[s] = 0;
        while(!Q.empty())
        {
            int x = Q.front();
            Q.pop();
            for(int i = 0; i < G[x].size(); i++)
            {
                Edge& e = edges[G[x][i]];
                if(!vis[e.to] && e.cap > e.flow)
                {
                    vis[e.to] = 1;
                    d[e.to] = d[x] + 1;
                    Q.push(e.to);
                }
            }
        }
        return vis[t];
    }
    int DFS(int x, int a)
    {
        if(x == t || a == 0) return a;
        int flow = 0, f;
        for(int& i = cur[x]; i < G[x].size(); i++)
        {
            Edge& e = edges[G[x][i]];
            if(d[x] + 1 == d[e.to] && (f = DFS(e.to, min(a, e.cap-e.flow))) > 0)
            {
                e.flow += f;
                edges[G[x][i]^1].flow -= f;
                flow += f;
                a -= f;
                if(a == 0) break;
            }
        }
        return flow;
    }
    int Maxflow(int s, int t)
    {
        this->s = s;
        this->t = t;
        int flow = 0;
        while(BFS())
        {
            memset(cur, 0, sizeof(cur));
            flow += DFS(s, INF);
        }
        return flow;
    }
};
Dinic g;

struct Node
{
    int x,y,n,m;
};
int n,tot;
double dist;
Node a[maxn];

double Distance(const Node& a,const Node& b)
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
void clearFlow()
{
    for(int i=0; i<g.edges.size(); i++)
    {
        g.edges[i].flow=0;
    }
}

int main()
{
#ifdef debu
    freopen("in.txt","r",stdin);
#endif // debug
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%lf",&n,&dist);
        g.init(n*2+1);
        tot=0;
        for(int i=1; i<=n; i++)
        {
            scanf("%d%d%d%d",&a[i].x,&a[i].y,&a[i].n,&a[i].m);
            tot+=a[i].n;
        }
        for(int i=1; i<=n; i++)
        {
            if(a[i].n>0)
            {
                g.addedge(S,i,a[i].n);
            }
            g.addedge(i,i+n,a[i].m);
        }
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=n; j++)
            {
                if(i==j) continue;
                if(Distance(a[i],a[j])<=dist)
                {
                    g.addedge(i+n,j,INF);
                }
            }
        }
        vector<int> ans;
        for(int i=1; i<=n; i++)
        {
            clearFlow();
            if(g.Maxflow(S,i)>=tot)
            {
                ans.push_back(i);
            }
        }
        if(!ans.size()) printf("-1\n");
        else
        {
            for(int i=0; i<ans.size(); i++)
            {
                if(i!=0) printf(" ");
                printf("%d",ans[i]-1);
            }
            printf("\n");
        }
    }
    return 0;
}