bzoj3698

显然是有源有汇有下界最大流，不刷不知道，一刷吓一跳
发现了我之前求有源有汇有下界最大流的错误，具体见我那篇介绍有下界的网络流的解题报告(bzoj2502)，已经更正

const inf=10000007;
type node=record
       po,next,flow:longint;
     end;

var e:array[0..40010] of node;
    pre,p,numh,h,cur,d:array[0..220] of longint;
    a:array[0..110,0..110] of double;
    len,tot,i,j,n,s,t,ss,tt:longint;

function min(a,b:longint):longint;
  begin
    if a>b then exit(b) else exit(a);
  end;

procedure add(x,y,f:longint);
  begin
    inc(len);
    e[len].po:=y;
    e[len].flow:=f;
    e[len].next:=p[x];
    p[x]:=len;
  end;

procedure build(x,y,f:longint);
  begin
    add(x,y,f);
    add(y,x,0);
  end;

function sap(s,t:longint):longint;
  var u,neck,tmp,i,j,q:longint;
  begin
    fillchar(numh,sizeof(numh),0);
    fillchar(h,sizeof(h),0);
    for i:=0 to tt do
      cur[i]:=p[i];
    u:=s;
    sap:=0;
    numh[0]:=tt+1;
    neck:=inf;
    while h[s]<tt+1 do
    begin
      d[u]:=neck;
      i:=cur[u];
      while i<>-1 do
      begin
        j:=e[i].po;
        if (e[i].flow>0) and (h[u]=h[j]+1) then
        begin
          neck:=min(neck,e[i].flow);
          cur[u]:=i;
          pre[j]:=u;
          u:=j;
          if u=t then
          begin
            sap:=sap+neck;
            while u<>s do
            begin
              u:=pre[u];
              j:=cur[u];
              dec(e[j].flow,neck);
              inc(e[j xor 1].flow,neck);
            end;
            neck:=inf;
          end;
          break;
        end;
        i:=e[i].next;
      end;
      if i=-1 then
      begin
        dec(numh[h[u]]);
        if numh[h[u]]=0 then exit;
        q:=-1;
        tmp:=tt;
        i:=p[u];
        while i<>-1 do
        begin
          j:=e[i].po;
          if e[i].flow>0 then
            if h[j]<tmp then
            begin
              q:=i;
              tmp:=h[j];
            end;
          i:=e[i].next;
        end;
        cur[u]:=q;
        h[u]:=tmp+1;
        inc(numh[h[u]]);
        if u<>s then
        begin
          u:=pre[u];
          neck:=d[u];
        end;
      end;
    end;
  end;

begin
  len:=-1;
  fillchar(p,sizeof(p),255);
  readln(n);
  dec(n);
  s:=0; t:=2*n+1; ss:=2*n+2; tt:=2*n+3;
  for i:=1 to n+1 do
    for j:=1 to n+1 do
      read(a[i,j]);
  for i:=1 to n do
  begin
    if a[i,n+1]<>trunc(a[i,n+1]) then
      build(s,i,1);
    d[i]:=d[i]+trunc(a[i,n+1]);
    d[s]:=d[s]-trunc(a[i,n+1]);
    if a[n+1,i]<>trunc(a[n+1,i]) then
      build(i+n,t,1);
    d[i+n]:=d[i+n]-trunc(a[n+1,i]);
    d[t]:=d[t]+trunc(a[n+1,i]);
  end;
  for i:=1 to n do
    for j:=1 to n do
    begin
      if trunc(a[i,j])<>a[i,j] then build(i,j+n,1);
      d[i]:=d[i]-trunc(a[i,j]);
      d[j+n]:=d[j+n]+trunc(a[i,j]);
    end;
  for i:=s to t do
    if d[i]>0 then
    begin
      build(ss,i,d[i]);
      tot:=tot+d[i];
    end
    else if d[i]<0 then build(i,tt,-d[i]);
  build(t,s,inf);
  if sap(ss,tt)<>tot then writeln('No')
  else writeln(sap(s,t)*3);
end.