[BZOJ3993][SDOI2015]星际战争（二分+最大流）

题目描述

传送门

题解

二分+最大流的思路很好想吧
二分时间mid，对于每一个武器s->x,mid*bi，对于每一个机器人x->t,ai，对于每一个武器x和它能攻击到的机器人y，x->y,inf，判断是否能满流即可
精度还是比较良心的
写网络流总是数组开小真是醉了
再开小数组自断双手

代码

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
#define N 10005

const double eps=1e-12;
const double inf=1e10;
int dcmp(double x)
{
    if (x<=eps&&x>=-eps) return 0;
    return (x>0)?1:-1;
}
int n,m,s,t;
double a[55],b[55],sum,maxflow,ans;
int attack[55][55];
int tot,point[N],nxt[N],v[N];double remain[N];
int deep[N],last[N],cur[N],num[N];
queue <int> q;

void addedge(int x,int y,double cap)
{
    ++tot; nxt[tot]=point[x]; point[x]=tot; v[tot]=y; remain[tot]=cap;
    ++tot; nxt[tot]=point[y]; point[y]=tot; v[tot]=x; remain[tot]=0;
}
void bfs(int t)
{
    for (int i=s;i<=t;++i) deep[i]=t;
    deep[t]=0;
    for (int i=s;i<=t;++i) cur[i]=point[i];
    while (!q.empty()) q.pop();
    q.push(t);

    while (!q.empty())
    {
        int now=q.front();q.pop();
        for (int i=point[now];i!=-1;i=nxt[i])
            if (deep[v[i]]==t&&dcmp(remain[i^1]))
            {
                deep[v[i]]=deep[now]+1;
                q.push(v[i]);
            }
    }
}
double addflow(int s,int t)
{
    int now=t;
    double ans=inf;
    while (now!=s)
    {
        ans=min(ans,remain[last[now]]);
        now=v[last[now]^1];
    }
    now=t;
    while (now!=s)
    {
        remain[last[now]]-=ans;
        remain[last[now]^1]+=ans;
        now=v[last[now]^1];
    }
    return ans;
}
void isap(int s,int t)
{
    for (int i=s;i<=t;++i) deep[i]=cur[i]=num[i]=last[i]=0;
    bfs(t);
    for (int i=s;i<=t;++i) ++num[deep[i]];

    int now=s;
    while (deep[s]<t)
    {
        if (now==t)
        {
            maxflow+=addflow(s,t);
            now=s;
        }

        bool has_find=false;
        for (int i=cur[now];i!=-1;i=nxt[i])
            if (deep[v[i]]+1==deep[now]&&dcmp(remain[i]))
            {
                has_find=true;
                cur[now]=i;
                last[v[i]]=i;
                now=v[i];
                break;
            }

        if (!has_find)
        {
            int minn=t-1;
            for (int i=point[now];i!=-1;i=nxt[i])
                if (dcmp(remain[i])) minn=min(minn,deep[v[i]]);
            if (!(--num[deep[now]])) break;
            ++num[deep[now]=minn+1];
            cur[now]=point[now];
            if (now!=s) now=v[last[now]^1];
        }
    }
}
bool check(double mid)
{
    tot=-1;memset(point,-1,sizeof(point));
    for (int i=1;i<=n;++i) addedge(1+m+i,t,a[i]);
    for (int i=1;i<=m;++i) addedge(s,1+i,mid*b[i]);
    for (int i=1;i<=m;++i)
        for (int j=1;j<=n;++j)
            if (attack[i][j]) addedge(1+i,1+m+j,inf);
    maxflow=0;isap(s,t);
    return dcmp(maxflow-sum)==0;
}
double find()
{
    double l=0,r=1e7,mid,ans=1e7;
    while (dcmp(r-l)>0)
    {
        mid=(l+r)/2;
        if (check(mid)) ans=r=mid;
        else l=mid;
    }
    return ans;
}
int main()
{
    scanf("%d%d",&n,&m);
    s=1,t=n+m+2;
    for (int i=1;i<=n;++i) scanf("%lf",&a[i]),sum+=a[i];
    for (int i=1;i<=m;++i) scanf("%lf",&b[i]);
    for (int i=1;i<=m;++i)
        for (int j=1;j<=n;++j)
            scanf("%d",&attack[i][j]);
    ans=find();
    printf("%.6lf\n",ans);
}