网络流24题之T4 魔术球问题

这题调了一个早上，全是小问题，码力不够啊= -=

#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <queue>
#include <cmath>
using namespace std ;
const int maxn=21000;
const int oo=1000000000;

typedef struct EDGE{
    int u,v;
    int c,f,next;
    EDGE (){
        u=v=c=f=0;
        next=-1;
    }
    EDGE (int a,int b,int d,int e,int g){
        u=a;v=b;c=d;f=e;next=g;
    }
}E;
E edge[100*maxn+10];
int len=-1,head[maxn],m;
int vis[maxn],dis[maxn];
int cur[maxn];
int times=1,q[100*maxn];
int allp;//总的点个数
int S,T;//源点和汇点的编号
void E_add (int s,int t,int x,int y){
    edge[++len]=EDGE (s,t,x,y,head[s]);
    head[s]=len;
}
void init (){
    cin >>m;
    S=0,T=1;
    allp=2;
    memset (head,-1,sizeof(head));
}
int bfs (){
    int headx=0,tail=0;
    int now,i;
    q[tail++]=S;
    vis[S]=++times;
    dis[S]=1;
    while (headx<tail){
        now=q[headx++];
        for (i=head[now];i!=-1;i=edge[i].next){
            if (vis[edge[i].v]!=times&&edge[i].c>edge[i].f) {
                q[tail++]=edge[i].v;
                dis[edge[i].v]=dis[now]+1;
                vis[edge[i].v]=times;
            }
        }
    }
    return vis[T];
}
int dfs (int x,int fmax){
    if (x==T||fmax==0) return fmax;
    int f,flow=0,&now=cur[x];
    for (;now!=-1;now=edge[now].next){
        if (dis[edge[now].v]==dis[x]+1&&(f=(dfs (edge[now].v,min(fmax,edge[now].c-edge[now].f))))){
            flow+=f;
            edge[now].f+=f;
            edge[now^1].f-=f;
            fmax-=f;
            if (fmax==0) break;
        }
    }
    return flow;
}
int dinic (){
    int flow=0,i;
    while (bfs ()==times){
        for (i=0;i<allp;i++) cur[i]=head[i];
        flow+=dfs (S,oo);
    }
    return flow;
}
void add (int x){
    int i,k;
    E_add (S,x*2,1,0);
    E_add (x*2,S,0,0);
    E_add (x*2+1,T,1,0);
    E_add (T,x*2+1,0,0);
    for (i=1;i<x;i++){
        k=sqrt (x+i);
        if (k*k==x+i) {
            E_add (i*2,x*2+1,1,0);
            E_add (x*2+1,i*2,0,0);
        }
    }
}
int main (){
    init ();
    int i=1,tmp=1;
    for (;;i++,tmp++){
        add (i);
        allp+=2;
        tmp-=dinic ();
        if (tmp>m) break;
    }
    cout <<i-1 <<endl;
    return 0;
}