LA 2957 网络流【好题】

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define zero(x) (fabs(x)<eps)
#define pi acos(-1.0)
#define f1 first
#define f2 second
#define CLR(x,y) memset(x,y,sizeof(x))
using namespace std;
typedef long long LL;
typedef pair <int, int> PII;

template<typename X> inline bool minimize(X&p,X q){if(p<=q)return 0;p=q;return 1;}
template<typename X> inline bool maximize(X&p,X q){if(p>=q)return 0;p=q;return 1;}
const int MAXN=3000,INF=0x3f3f3f3f;
struct ISAP
{   struct Edge
    {
        int from,to,cap,flow,r;
        Edge(){}
        Edge(int a,int b,int c,int d,int e):from(a),to(b),cap(c),flow(d),r(e){}
    };
    int n,m,s,t;//结点数，边数(含反向弧)，源点，汇点
    vector<Edge> edges;//边表，edges[e]&edges[e^1]互为反向弧
    vector<int> G[MAXN];//邻接表，G[i][j]表示结点i的第j条边在e数组中的序号
    bool vis[MAXN];//BFS使用
    int d[MAXN];//从起点到i的距离
    int cur[MAXN];//当前弧下标
    int p[MAXN];//可增广路上的上一条弧
    int num[MAXN];//距离标号计数

    void AddEdge(int from,int to,int cap,int res)//重边不影响
    {   //printf("%d %d %d\n",from,to,cap);
        edges.push_back(Edge(from,to,cap,0,res));
        edges.push_back(Edge(to,from,0,0,-1));//容量为0,表示反向弧
        m=edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }

    void init(int n)
    {
        this->n=n;
        for(int i=0;i<n;++i) G[i].clear();
        edges.clear();
    }
    void add(int nn)
    {   nn+=n;
        for (int i=n;i<nn;i++)  G[i].clear();
        n=nn;
    }
    void BFS()//反向
    {   for (int i=0;i<n;i++)
            d[i]=n+10; //!!!
        memset(vis,0,sizeof(vis));
        queue<int> Q;
        Q.push(t);
        d[t]=0;
        vis[t]=1;
        while(!Q.empty())
        {
            int x=Q.front();
            Q.pop();
            for(int i=0; i<G[x].size(); ++i)
            {
                Edge& e=edges[G[x][i]^1];
                if(!vis[e.from]&&e.cap>e.flow)
                {
                    vis[e.from]=1;
                    d[e.from]=d[x]+1;
                    Q.push(e.from);
                }
            }
        }
    }

    int Augment()
    {
        int x=t,a=INF;
        while(x!=s)
        {
            Edge& e=edges[p[x]];
            a=min(a,e.cap-e.flow);
            x=edges[p[x]].from;
        }
        x=t;
        while(x!=s)
        {
            edges[p[x]].flow+=a;
            edges[p[x]^1].flow-=a;
            x=edges[p[x]].from;
        }
        return a;
    }

    int Maxflow(int s,int t)//结点数
    {
        this->s=s,this->t=t;
        int flow=0;
        BFS();
        memset(num,0,sizeof(num));
        for(int i=0;i<n;++i) if (d[i]!=n+10)++num[d[i]];//!!!
        int x=s;
        memset(cur,0,sizeof(cur));
        while(d[s]<n)
        {
            if(x==t)
            {
                flow+=Augment();
                x=s;
            }
            int ok=0;
            for(int i=cur[x];i<G[x].size();++i)
            {
                Edge& e=edges[G[x][i]];
                if(e.cap>e.flow&&d[x]==d[e.to]+1)//Advance
                {
                    ok=1;
                    p[e.to]=G[x][i];
                    cur[x]=i;
                    x=e.to;
                    break;
                }
            }
            if(!ok)//Retreat
            {
                int m=n-1;
                for(int i=0;i<G[x].size();++i)
                {
                    Edge& e=edges[G[x][i]];
                    if(e.cap>e.flow) m=min(m,d[e.to]);
                }
                if(--num[d[x]]==0) break;//gap优化
                num[d[x]=m+1]++;
                cur[x]=0;
                if(x!=s) x=edges[p[x]].from;
            }
        }
        return flow;
    }
    int pos[55],vi[55];
    vector <int> a;
    vector <int> b;
    void solve(int ansday,int kk,int nn,int ss)
    {   int id=1,size=edges.size();

        for(int j=0; j<kk; j++) pos[j]=ss;
        for (int day=1;day<=ansday;day++)
            {   int nowl=2+day*nn+1,nowr=2+day*nn+nn;
                int lastl=nowl-nn,lastr=nowr-nn;

                a.clear(); b.clear();memset(vi,0,sizeof(vi));
                for (;id<size;id++)
                    {if (edges[id].to>nowr) break;
                     if (edges[id].flow>0&&edges[id].r!=-1)
                     if (edges[id].from>=lastl   &&edges[id].from<=lastr)
                     if (edges[id].to  >=nowl     &&edges[id].to  <=nowr)
                     if (edges[edges[id].r].flow==0)
                        {
                            a.pb(edges[id].from-lastl+1);
                            b.pb(edges[id].to-nowl+1);
                        }
                    }
                printf("%d", a.size());
                for(int j=0; j<kk; j++)
                for(int i=0; i<a.size(); i++)
					if(!vi[i]&&a[i]==pos[j])
					{
						printf(" %d %d",j+1,b[i]);
						pos[j]=b[i];
						vi[i]=1;
						break;
					}

                printf("\n");
            }
    }
}it;
int n,m,ss,tt,kk;
int a[205][2];
void doit()
{
    for (int i=1;i<=m;i++)
        scanf("%d%d",&a[i][0],&a[i][1]);
    it.init(n*2+3);
    it.AddEdge(0,1,kk,-1);
    it.AddEdge(1,ss+2,INF,-1);
    it.AddEdge(1,ss+2+n,INF,-1);
    it.AddEdge(tt+n+2,2,INF,-1);

    int last=n+2;
    for (int i=1;i<=m;i++)
        {it.AddEdge(a[i][0]+last-n,a[i][1]+last,1,it.edges.size()+2);
         it.AddEdge(a[i][1]+last-n,a[i][0]+last,1,it.edges.size()-2);
        }
     for (int i=1;i<=n;i++)
        it.AddEdge(last-n+i,last+i,INF,-1);
    int tmp=it.Maxflow(0,2),day=1;

    if (tmp<kk)
         {
            for (++day;;++day)
                {   last+=n;
                    it.add(n);
                    for (int i=1;i<=m;i++)
                        {it.AddEdge(a[i][0]+last-n,a[i][1]+last,1,it.edges.size()+2);
                         it.AddEdge(a[i][1]+last-n,a[i][0]+last,1,it.edges.size()-2);
                        }
                    for (int i=1;i<=n;i++)
                        it.AddEdge(last-n+i,last+i,INF,-1);
                    it.AddEdge(last+tt,2,INF,-1);
                    it.AddEdge(1,last+ss,INF,-1);

                    tmp+=it.Maxflow(0,2);
                    if (tmp==kk) break;
                }
         }
    printf("%d\n",day);
    it.solve(day,kk,n,ss);
}
int main()
{
    while (scanf("%d%d%d%d%d",&n,&m,&kk,&ss,&tt)!=EOF) doit();
}