UVALIVE 3972 March of the Penguins

最大流建图比较容易第一次Dicnc抄了下别人的版

存一下以后方便查

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b) {return a % b ==  ? b : gcd(b, a % b);}
#define MAXN 220
const int INF = 0x3f3f3f3f ;
struct node
{
    int u,v,next;
    int cap,flow;
}edge[MAXN * MAXN * ];
struct Dicnc
{
    int source,target;
    bool vis[MAXN];
    int d[MAXN],cur[MAXN],head[MAXN],cnt;
    int n;
    void init(int x)
    {
        memset(head,-,sizeof(head));
        cnt = ;
        n = x;
    }
    void addedge(int u ,int v, int cap)
    {
        edge[cnt].u = u;
        edge[cnt].v = v;
        edge[cnt].cap = cap;
        edge[cnt].flow = ;
        edge[cnt].next = head[u];
        head[u] = cnt++;

        edge[cnt].u = v;
        edge[cnt].v = u;
        edge[cnt].flow = ;
        edge[cnt].cap = ;
        edge[cnt].next = head[v];
        head[v] = cnt++;
    }
    bool BFS()
    {
        memset(vis,false,sizeof(vis));
        queue<int>q;
        d[source] = ;
        vis[source] = true;
        q.push(source);
        while (!q.empty())
        {
            int u = q.front(); q.pop();
            for (int i = head[u]; i != -; i = edge[i].next)
            {
                node & e = edge[i];
                if (!vis[e.v] && e.cap > e.flow)
                {
                    vis[e.v] = true;
                    d[e.v] = d[u] + ;
                    q.push(e.v);
                }
            }
        }
        return vis[target];
    }
    int DFS(int x,int a)
    {
        if (x == target || a == ) return a;
        int flow = ,f;
        for (int & i = cur[x]; i != -; i = edge[i].next)
        {
            node & e = edge[i];
            if (d[x] +  == d[e.v] && (f = DFS(e.v,min(a,e.cap - e.flow))) > )
            {
                e.flow += f;
                edge[i ^ ].flow -= f;
                flow += f;
                a -= f;
                if (a == ) break;
            }
        }
        return flow;
    }
    int Maxflow(int S,int T)
    {
        source = S;
        target = T;
        int flow = ;
        while (BFS())
        {
             for(int i=; i<=n; i++) cur[i]=head[i];
            flow += DFS(source,INF);
            //cout<<flow<<endl;
        }
        return flow;
    }
};
struct point
{
    int x,y;
    int a,b;
}p[MAXN];
double dist(int i,int j)
{
    double a=(p[i].x-p[j].x)*(p[i].x-p[j].x)*1.0;
    double b=(p[i].y-p[j].y)*(p[i].y-p[j].y)*1.0;
    return sqrt(a+b);
}
Dicnc ans;
int N;
double D;
int main()
{
    //freopen("sample.txt","r",stdin);
    int T;
    scanf("%d",&T);
    while (T--)
    {
        scanf("%d%lf",&N,&D);
        int sum = ;
        for (int i = ; i <= N; i++) { scanf("%d%d%d%d",&p[i].x,&p[i].y,&p[i].a,&p[i].b); sum += p[i].a;}
        bool first = false;
        //printf("%d\n",sum);
        for (int k = ; k <= N; k++)
        {
            ans.init( * N + );
            for (int i = ; i <= N; i++)
            {
                ans.addedge(,i,p[i].a);
                ans.addedge(i,i + N,p[i].b);
            }
            for (int i = ; i <= N; i++)
                for (int j = i + ; j <= N; j++)
                if (dist(i,j) <= D)
            {
                ans.addedge(i + N,j,INF);
                ans.addedge(j + N,i,INF);
            }
            int temp = ans.Maxflow(,k);
            if (sum == temp)
            {
                if (!first) {printf("%d",k - );first = true;}
                else printf(" %d",k - );
            }
        }
        if (!first) printf("-1");
        puts("");
    }
    return ;
}