bzoj1075更快的zkw费用流



#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct edgee
{
 int from, to, cap, cost, num;
};
edgee edge[150000];
int first[2000], nextt[150000], slack[2000], visit[2000], dist[2000];
int changee[3000];
int tot = 0;
int n, m;
double ans;
int start, tremin;
void addedge(int from, int to, int cap, int cost)
{
 edge[tot].from = from; edge[tot].to = to; edge[tot].cap = cap; edge[tot].cost = cost; edge[tot].num = tot;
 nextt[tot] = first[from]; first[from] = tot; tot++;
 edge[tot].from = to; edge[tot].to = from; edge[tot].cap = 0; edge[tot].cost = -cost; edge[tot].num = tot;
 nextt[tot] = first[to]; first[to] = tot; tot++;
}
int dfs(int now, int f)//表示当前弧优化没卵用.....对于这个写法来说
{
 if (f == 0 || now == (m + 1)*n + 1)
 {
  ans += dist[0] * f;
  return f;
 }
 int use = 0;
 visit[now] = 1;
 for (int &i = changee[now]; i != -1; i = nextt[i])
 {
  int to = edge[i].to;
  if (dist[to] + edge[i].cost == dist[now] && !visit[to] && edge[i].cap > 0)
  {
   int flow = dfs(to, min(edge[i].cap, f - use));
   use += flow;
   if (flow)
   {
    edge[i].cap -= flow;
    edge[edge[i].num ^ 1].cap += flow;
   }
  }
  else
  {
   if (edge[i].cap > 0 && !visit[to])//就这个地方加了就ac没就wa为什么？？？？==这很显然嘛。。因为如果不加!visit[to]那么
             //dist[to] + edge[i].cost == dist[now] 的时候你也更新这时候slack[i]=0然后最后结束的时候这个点
             //没被visit那么这时mn=0 你就进入流一个死循环.
    slack[to] = min(slack[to], dist[to] + edge[i].cost - dist[now]);
  }
  if (use == f)
   return use;
 }
 return use;
}
int change()
{
 int mn = 1000000000;
 for (int i = 0; i <= tremin; i++)
 {
  changee[i] = first[i];
  if (!visit[i])
  {
   mn = min(mn, slack[i]);
   slack[i] = 1000000000;
  }
 }
 if (mn == 1000000000)
  return 0;
 for (int i = 0; i <= tremin; i++)
 {
  if (visit[i])
   dist[i] += mn;
 }
 return mn;
}
void zkw()
{
 int k = n;
 int q;
 for (int i = 0; i <= tremin; i++)slack[i] = 1000000000,changee[i]=first[i];
 do
 {
  fill(visit, visit + (m + 1)*n + 10, 0);
  while ((q = dfs(0, k)) && k)
  {
   k -= q;
   fill(visit, visit + (m + 1)*n + 10, 0);
  }
 } while (change() && k);//这样写是为了通用模板但是此题就是一个最小费用最大流所以其实阔以不这样写
}
int main()
{
 scanf("%d%d", &m, &n);
 fill(first, first + (m + 1)*n + 10, -1);
 start = 0, tremin = (m + 1)*n + 1;
 for (int i = 1; i <= n; i++)
 {
  for (int j = 0; j < m; j++)
  {
   int a;
   scanf("%d", &a);
   for (int k = 1; k <= n; k++)
   {
    addedge(j*n + k, m*n + i, 1, k*a);
   }
  }
 }
 for (int j = 0; j < m; j++)
  for (int k = 1; k <= n; k++)
  {
   addedge(0, j*n + k, 1, 0);
  }
 for (int i = 1; i <= n; i++)
  addedge(m*n + i, (m + 1)*n + 1, 1, 0);
 zkw();
 printf("%.2lf\n", (ans*1.0) / (n*1.0));
}