网络流24题---魔术球

思路：注意 在残余网络上跑出的流量需要和之前的结果进行累加。

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef int lint;
const lint inf = 0x3f3f3f3f;
const int maxn = 20005;
vector<int> ve[maxn];
struct dinic{
    static const int N = 20005;
    static const int M = 200005;
    static const lint inf = 0x3f3f3f3f;
    int he[N],ne[M],ver[M],d[N];
    lint edge[M];
    int s,t,tot;
    queue<int> que;
    void init( int n ){
        for( int i = 0;i <= n;i++ ){
            he[i] = 0;
        }
        tot = 1;
    }
    void add( int x,int y,lint z ){
        ver[++tot] = y; ne[ tot ] = he[x]; he[x] = tot; edge[ tot ] = z;
        ver[++tot] = x; ne[tot] = he[y]; he[y] = tot;edge[tot] = 0;
    }
    bool bfs(){
        memset( d,0,sizeof( d ) );
        while( que.size() ) que.pop();
        que.push( s );
        d[s] = 1;
        while( que.size() ){
            int x = que.front();
            que.pop();
            for( int cure = he[x];cure;cure = ne[cure] ){
                int y = ver[cure];
                if( edge[cure] && !d[y] ){
                    que.push( y );
                    d[ y ] = d[x] + 1;
                    if( y == t ) return 1;
                }
            }
        }
        return 0;
    }
    lint dfs( int x,lint flow ){
        if( x== t ) return flow;
        lint rest = flow,k;
        for( int cure = he[x];cure && rest;cure = ne[cure] ){
            int y = ver[cure];
            if( edge[cure] && d[ y ] == d[x] + 1 ){
                k = dfs( y,min( rest,edge[cure] ) );
                if( !k ) d[ y ] = 0;
                edge[cure] -= k;
                edge[ cure^1 ] += k;
                rest -= k;
            }
        }
        return flow - rest;
    }
    lint max_flow( int x,int y ){
        s = x; t = y;
        lint maxflow = 0;
        lint flow = 0;
        while( bfs() )
            while( flow = dfs( s,inf ) ) maxflow += flow;
        return maxflow;
    }
    void DFS( int x,int cnt ){
        ve[cnt].push_back(x);
        for( int cure = he[x];cure;cure = ne[cure] ){
            int c = edge[cure];
            if(!c){
                int y  = ver[cure];
                if(y)
                    DFS( y-10000,cnt);
            }
        }
    }
    void solve(int n,int T){
        int cnt = 0;
        for( int i = 1;i <= n;i++ ){
            int x = i+10000;
            for( int cure = he[x];cure;cure = ne[cure] ){
                int y = ver[cure];
                if( y == T && edge[cure] ){
                    DFS(x-10000,++cnt);
                }
            }
        }
    }
} g;
int val[40005];
int main(){
    int n;scanf("%d",&n);
    int S = 0,T = 20001;
    for( int i = 1;i <= 200;i++ ){
        val[i*i] = 1;
    }
    g.init(T);
    int ans;
    int maxflow = 0;
    for( int i = 1;i <= 10000;i++ ){
        g.add( S,i,1 );g.add(i+10000,T,1);
        for( int j = 1;j < i;j++ ){
            if( val[i+j] )
                g.add( j,i+10000,1 );
        }
        maxflow += g.max_flow( S,T );
        if( i-maxflow <= n  ){
            ans = i;
        }else  break;
    }
    g.solve( ans,T );
    printf("%d\n",ans);
    for( int i = 1;i <= n;i++ ){
        for( int j = 0;j < ve[i].size();j++ ){
            printf("%d ",ve[i][j]);
        }
        puts("");
    }
   return 0;
}