P2765 魔术球问题

题意：每个点能连接的下一个点可以连成一个链，给你1-m个点，求出来的最小路径覆盖的答案就是需要的桩子个数（画重点！最小路径覆盖）

思路：最小路径覆盖，拆点，把每个点拆成一个入点和一个出点，和为平方数的两个点连接，跑dinic

#include<bits/stdc++.h>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
const int N = 2e5 + 10;
int n, m, s, t, h[N], cnt, dep[N], cur[N], tag[N], to[N];
struct node {
    int v, w, nt;
} no[N];
void add(int u, int v, int w) {
    no[cnt] = node{v, w, h[u]};
    h[u] = cnt++;
}
int bfs() {
    queue<int> q;
    memset(dep, 0, sizeof dep);
    dep[s] = 1;
    q.push(s);
    while(!q.empty()) {
        int u = q.front();
        q.pop();
        for(int i = h[u]; ~i; i = no[i].nt) {
            int v = no[i].v;
            if(!dep[v] && no[i].w > 0) {
                dep[v] = dep[u] + 1;
                q.push(v);
            }
        }
    }
    return dep[t] > 0;
}
int dfs(int u, int flow) {
    if(u == t)
        return flow;
    for(int &i = cur[u]; ~i; i = no[i].nt) {
        int v = no[i].v;
        if(dep[v] == dep[u] + 1 && no[i].w) {
            int res = dfs(v, min(flow, no[i].w));
            if(res > 0) {
                no[i].w -= res;
                no[i ^ 1].w += res;
                if(u != s && u != t)
                    to[u] = v;
                if(u != s)
                    tag[u - 2000] = 1;
                return res;
            }
        }
    }
    return 0;
}
int dinic() {
    int res = 0;
    while(bfs()) {
        for(int i = 0; i <= t; i++)//这必须是t，不然死循环
            cur[i] = h[i];
        while(int d = dfs(s, INF))
            res += d;
    }
    return res;
}
set<int> all;
int main() {
    memset(h, -1, sizeof h);
    for(int i = 0; i <= 100; i++)
        all.insert(i * i);
    scanf("%d", &n);
    t = 4000;
    int now = 0, ans = 0;
    while(++now) {
        add(s, now, 1), add(now, s, 0);
        add(now + 2000, t, 1), add(t, now + 2000, 0);
        for(int i = 1; i < now; i++)
            if(all.count(i + now))
                add(i, now + 2000, 1), add(now + 2000, i, 0);
        ans += dinic();
        if(now - ans > n)
            break;
    }
    printf("%d\n", now - 1);
    for(int i = 1; i <= now - 1; i++) {
        if(!tag[i]) {
            int u = i;
            printf("%d ", u);
            while(to[u] && to[u] != t) {
                printf("%d ", to[u] - 2000);
                u = to[u] - 2000;
            }
            puts("");
        }
    }
    return 0;
}