poj 3498 March of the Penguins 带点容量限制的做法是拆点，把一个点拆成两个点，他们直接连一条边就是点容量。然后再求最大流

本文链接：https://blog.csdn.net/kongming_acm/article/details/6791460

Description

Somewhere near the south pole, a number of penguins are standing on a number of ice floes. Being social animals, the penguins would like to get together, all on the same floe. The penguins do not want to get wet, so they have use their limited jump distance to get together by jumping from piece to piece. However, temperatures have been high lately, and the floes are showing cracks, and they get damaged further by the force needed to jump to another floe. Fortunately the penguins are real experts on cracking ice floes, and know exactly how many times a penguin can jump off each floe before it disintegrates and disappears. Landing on an ice floe does not damage it. You have to help the penguins find all floes where they can meet.

A sample layout of ice floes with 3 penguins on them.

Input

On the first line one positive number: the number of testcases, at most 100. After that per testcase:

One line with the integer N (1 ≤ N ≤ 100) and a floating-point number D (0 ≤ D ≤ 100 000 ), denoting the number of ice pieces and the maximum distance a penguin can jump.
N lines, each line containing x_i, y_i, n_i and m_i, denoting for each ice piece its X and Y coordinate, the number of penguins on it and the maximum number of times a penguin can jump off this piece before it disappears ( −10 000 ≤x_i, y_i ≤ 10 000 , 0 ≤ n_i ≤ 10, 1 ≤ m_i ≤ 200).

Output

Per testcase:

One line containing a space-separated list of 0-based indices of the pieces on which all penguins can meet. If no such piece exists, output a line with the single number −1.

Sample Input

Sample Output

1 2 4
-1

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=410;
const int M=50000;
const int inf=(1<<28);
int head[N];
struct Edge
{
int v,next,w;
int pw;//原图中u->v的边权
} edge[M];
int cnt,n,s,t;//n从0开始 0->n-1
void addedge(int u,int v,int w)
{
edge[cnt].v=v;
edge[cnt].w=w;
edge[cnt].pw=w;
edge[cnt].next=head[u];
head[u]=cnt++;
edge[cnt].v=u;
edge[cnt].w=0;
edge[cnt].pw=w;
edge[cnt].next=head[v];
head[v]=cnt++;
}
int sap()
{
int pre[N],cur[N],dis[N],gap[N];
int flow=0,aug=inf,u;
bool flag;
for(int i=0; i<n; i++)
{
cur[i]=head[i];
gap[i]=dis[i]=0;
}
gap[s]=n;
u=pre[s]=s;
while(dis[s]<n)
{
flag=0;
for(int &j=cur[u]; j!=-1; j=edge[j].next)
{
int v=edge[j].v;
if(edge[j].w>0&&dis[u]==dis[v]+1)
{
flag=1;
if(edge[j].w<aug) aug=edge[j].w;
pre[v]=u;
u=v;
if(u==t)
{
flow+=aug;
while(u!=s)
{
u=pre[u];
edge[cur[u]].w-=aug;
edge[cur[u]^1].w+=aug;
}
aug=inf;
}
break;
}
}
if(flag) continue;
int mindis=n;
for(int j=head[u]; j!=-1; j=edge[j].next)
{
int v=edge[j].v;
if(edge[j].w>0&&dis[v]<mindis)
{
mindis=dis[v];
cur[u]=j;
}
}
if((--gap[dis[u]])==0)
break;
gap[dis[u]=mindis+1]++;
u=pre[u];
}
return flow;
}

//初始化 cnt=0;memset(head,-1,sizeof(head));
struct Point
{
int x,y;
};
Point p[300];
double maxd;
int in[300];
int lim[300];
double d[300][300];
double dis(Point h,Point k)
{
return sqrt(0.0+(h.x-k.x)*(h.x-k.x)+(h.y-k.y)*(h.y-k.y));
}
int ans[300],ln;
int main()
{
int ci;scanf("%d",&ci);
while(ci--)
{
int m;
scanf("%d%lf",&m,&maxd);
int total=0;
for(int i=1;i<=m;i++)
{
scanf("%d%d%d%d",&p[i].x,&p[i].y,&in[i],&lim[i]);
total+=in[i];
}
for(int i=1;i<=m;i++) for(int j=1;j<=m;j++)
{
d[i][j]=dis(p[i],p[j]);
}
ln=0;
for(int l=1;l<=m;l++)//枚举汇点
{
cnt=0;
memset(head,-1,sizeof(head));
s=0,t=l+m;
n=m*2+1;
for(int i=1;i<=m;i++)
{
addedge(0,i,in[i]);
if(i!=l)addedge(i,i+m,lim[i]);
else addedge(i,i+m,inf);//important
for(int j=1;j<=m;j++)
{
if(i!=j&&d[i][j]<=maxd)
{
addedge(i+m,j,inf);
}
}
}
int tmp=sap();
if(tmp==total) ans[ln++]=l;
}
if(ln==0) printf("-1\n");
else
{
printf("%d",ans[0]-1);
for(int i=1;i<ln;i++) printf(" %d",ans[i]-1);printf("\n");
}
}
return 0;
}