洛谷 ~ P2765 ~ 魔术球问题 （最小路径覆盖）

思路

易证球的个数越多需要的柱子数越多（可能相等），是一个单调递增的关系。

我们枚举球的个数num，拆点，如果 i+j 为完全平方数，那么 i - j' 建边，建图方式同洛谷 ~ P2764 ~ 最小路径覆盖问题 （最小路径覆盖 + 方案输出），求得最小路径覆盖数就是需要的柱子数，当最小路径覆盖数 > 柱子数时，最小路径覆盖数-1就是答案。

如果每枚举一个num，都去初始化，重新建边一次，重跑一次网络流，时间复杂度太高。

由于网络流是可以在残量网络中继续跑的，所以我们枚举num得过程中只添加新的边，然后在上一次得残量网络中继续跑网络流，这样就复杂度就低了很多。过程中累计匹配数就是最大匹配数，点数num - 最大匹配数 = 最小路径覆盖数。

代码①：

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 0x3f3f3f3f;
struct Edge
{
    int from, to, cap, flow;       //起点,终点,容量,流量
    Edge(int u, int v, int c, int f) : from(u), to(v), cap(c), flow(f) {}
};
struct Dinic
{
    int n, m, s, t;                //结点数,边数(包括反向弧),源点s,汇点t
    vector<Edge> edges;            //边表。edges[e]和edges[e^1]互为反向弧
    vector<int> G[MAXN];           //邻接表，G[i][j]表示结点i的第j条边在edges数组中的序号
    int d[MAXN];                   //从起点到i的距离（层数差）
    int cur[MAXN];                 //当前弧下标
    bool vis[MAXN];                //BFS分层使用

    void init(int n)
    {
        this->n = n;
        edges.clear();
        for (int i = 0; i <= n; i++) G[i].clear();
    }

    void add_edge(int from, int to, int cap)
    {
        edges.push_back(Edge(from, to, cap, 0));
        edges.push_back(Edge(to, from, 0, 0));
        m = edges.size();
        G[from].push_back(m - 2);
        G[to].push_back(m - 1);
    }

    bool BFS()//构造分层网络
    {
        memset(vis, 0, sizeof(vis));
        queue<int> Q;
        d[s] = 0;
        vis[s] = true;
        Q.push(s);
        while (!Q.empty())
        {
            int x = Q.front(); Q.pop();
            for (int i = 0; i < G[x].size(); i++)
            {
                Edge& e = edges[G[x][i]];
                if (!vis[e.to] && e.cap > e.flow)
                {
                    vis[e.to] = true;
                    d[e.to] = d[x] + 1;
                    Q.push(e.to);
                }
            }
        }
        return vis[t];
    }
    int DFS(int x, int a)//沿阻塞流增广
    {
        if (x == t || a == 0) return a;
        int flow = 0, f;
        for (int& i = cur[x]; i < G[x].size(); i++)//从上次考虑的弧
        {
            Edge& e = edges[G[x][i]];
            if (d[x] + 1 == d[e.to] && (f = DFS(e.to, min(a, e.cap - e.flow))) > 0)//多路增广
            {
                e.flow += f;
                edges[G[x][i]^1].flow -= f;
                flow += f;
                a -= f;
                if (a == 0) break;
            }
        }
        return flow;
    }
    int max_flow(int s, int t)
    {
        this->s = s; this->t = t;
        int flow = 0;
        while (BFS())
        {
            memset(cur, 0, sizeof(cur));
            flow += DFS(s, INF);
        }
        return flow;
    }

}solve;

int to[MAXN];
bool vis[MAXN];

int main()
{
    int n; scanf("%d", &n);
    int s = 0, t = 10000;
    solve.init(t);
    int nn = 0, sum = 0, num = 0;
    while (nn <= n)
    {
        num++;
        solve.add_edge(s, num, 1);
        solve.add_edge(num+5000, t, 1);
        for (int i = 1; i < num; i++)
        {
            int k = sqrt(i+num);
            if (k*k == i+num) solve.add_edge(i, num+5000, 1);
        }
        sum += solve.max_flow(s, t);//统计匹配数
        nn = num-sum;//最小路径覆盖数 = 点数 - 最大匹配数
    }
    printf("%d\n", --num);
    for (int i = 1; i <= num; i++)
    {
        for (int j = 0; j < solve.G[i].size(); j++)
        {
            Edge& e = solve.edges[solve.G[i][j]];
            if (e.flow == 1) to[i] = e.to-5000;
        }
    }
    for (int i = 1; i <= num; i++)
    {
        if (!vis[i])
        {
            int x = i;
            while (x)
            {
                printf("%d ", x);
                vis[x] = 1;
                x = to[x];
            }
            printf("\n");
        }
    }
    return 0;
}
/*
4
*/

代码②：

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 0x3f3f3f3f;
struct Edge
{
    int from, to, cap, flow;       //起点,终点,容量,流量
    Edge(int u, int v, int c, int f) : from(u), to(v), cap(c), flow(f) {}
};
struct Dinic
{
    int n, m, s, t;                //结点数,边数(包括反向弧),源点s,汇点t
    vector<Edge> edges;            //边表。edges[e]和edges[e^1]互为反向弧
    vector<int> G[MAXN];           //邻接表，G[i][j]表示结点i的第j条边在edges数组中的序号
    int d[MAXN];                   //从起点到i的距离（层数差）
    int cur[MAXN];                 //当前弧下标
    bool vis[MAXN];                //BFS分层使用

    void init(int n)
    {
        this->n = n;
        edges.clear();
        for (int i = 0; i <= n; i++) G[i].clear();
    }

    void add_edge(int from, int to, int cap)
    {
        edges.push_back(Edge(from, to, cap, 0));
        edges.push_back(Edge(to, from, 0, 0));
        m = edges.size();
        G[from].push_back(m - 2);
        G[to].push_back(m - 1);
    }

    bool BFS()//构造分层网络
    {
        memset(vis, 0, sizeof(vis));
        queue<int> Q;
        d[s] = 0;
        vis[s] = true;
        Q.push(s);
        while (!Q.empty())
        {
            int x = Q.front(); Q.pop();
            for (int i = 0; i < G[x].size(); i++)
            {
                Edge& e = edges[G[x][i]];
                if (!vis[e.to] && e.cap > e.flow)
                {
                    vis[e.to] = true;
                    d[e.to] = d[x] + 1;
                    Q.push(e.to);
                }
            }
        }
        return vis[t];
    }
    int DFS(int x, int a)//沿阻塞流增广
    {
        if (x == t || a == 0) return a;
        int flow = 0, f;
        for (int& i = cur[x]; i < G[x].size(); i++)//从上次考虑的弧
        {
            Edge& e = edges[G[x][i]];
            if (d[x] + 1 == d[e.to] && (f = DFS(e.to, min(a, e.cap - e.flow))) > 0)//多路增广
            {
                e.flow += f;
                edges[G[x][i]^1].flow -= f;
                flow += f;
                a -= f;
                if (a == 0) break;
            }
        }
        return flow;
    }
    int max_flow(int s, int t)
    {
        this->s = s; this->t = t;
        int flow = 0;
        while (BFS())
        {
            memset(cur, 0, sizeof(cur));
            flow += DFS(s, INF);
        }
        return flow;
    }

}solve;

int to[MAXN];
bool vis[MAXN];

int main()
{
    int n; scanf("%d", &n);
    int s = 0, t = 10000;
    solve.init(t);
    int nn = 0, sum = 0, num = 0;
    while (nn <= n)
    {
        num++;
        solve.add_edge(s, num, 1);
        solve.add_edge(num+5000, t, 1);
        for (int i = 1; i < num; i++)
        {
            int k = sqrt(i+num);
            if (k*k == i+num) solve.add_edge(i, num+5000, 1);
        }
        int x = solve.max_flow(s, t);
        if (!x) nn++;//此次最大流为0即匹配数没有增加,则需要多加一跟柱子
    }
    printf("%d\n", --num);
    for (int i = 1; i <= num; i++)
    {
        for (int j = 0; j < solve.G[i].size(); j++)
        {
            Edge& e = solve.edges[solve.G[i][j]];
            if (e.flow == 1) to[i] = e.to-5000;
        }
    }
    for (int i = 1; i <= num; i++)
    {
        if (!vis[i])
        {
            int x = i;
            while (x)
            {
                printf("%d ", x);
                vis[x] = 1;
                x = to[x];
            }
            printf("\n");
        }
    }
    return 0;
}
/*
4
*/