【网络流24题】魔术球问题

Description

click me

Solution

可以用匈牙利的为什么一定要打Dinic呢
对于每个数拆成两个点，左边的点连源点，右边的点连汇点。
从1开始枚举答案，每次找到相加为完全平方数的点，从小数向大数连边，每次跑一次网络流即可。
这题感觉isap不太方便，所以打了个dinic

Code

/**************************
 * Au: Hany01
 * Date: Jan 12th, 2018
 * Prob: luogu2765
 * Email: hany01@foxmail.com
**************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define fir first
#define sec second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#define debug(...) fprintf(stderr, __VA_ARGS__)

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

inline void File()
{
#ifdef hany01
    freopen("luogu2765.in", "r", stdin);
    freopen("luogu2765.out", "w", stdout);
#endif
}

const int maxn = 10005, maxm = 500005;

int n, s, t, Sum, e, cur, cnt, mark[maxn], beg[maxn], nex[maxm], v[maxm], gap[maxn], d[maxn], f[maxm], ff[maxm], Ans, ansf[maxm], pre[maxn], isbepreed[maxn], beg1[maxn];

inline void add(int uu, int vv, int ff) { v[++ e] = vv; f[e] = ff; nex[e] = beg[uu]; beg[uu] = e; }

bool BFS()
{
    int u;
    static int vis[maxn];
    static queue<int> q;
    Set(vis , 0);
    q.push(s);
    vis[s] = 1;
    d[s] = 0;
    while (!q.empty()) {
        u = q.front(); q.pop();
        for (int i = beg[u] ; i ; i = nex[i])
            if (!vis[v[i]] && f[i]) {
                d[v[i]] = d[u] + 1;
                vis[v[i]] = 1;
                q.push(v[i]);
            }
    }
    return vis[t];
}

int DFS(int u , int flow)
{
    if (u == t || !flow) return flow;
    int res = flow , tmp;
    for (int &i = beg[u] ; i ; i = nex[i])
    {
        if (d[v[i]] == d[u] + 1 && (tmp = DFS(v[i] , min(f[i] , res))) > 0)
        {
            f[i] -= tmp;
            f[i ^ 1] += tmp;
            if (!(res -= tmp))
                return flow;
        }
    }
    return flow - res;
}

void Dinic()
{
    Cpy(beg1, beg);
    while (BFS()) {
        Ans += DFS(s , INF);
        memcpy(beg , beg1 , sizeof(beg));
    }
}

void print(int u)
{
    if (pre[u]) print(pre[u]);
    printf("%d ", u);
}

#define l(u) (u << 1)
#define r(u) (u << 1 | 1)
#define issqr(x) ((int)sqrt(x) * (int)sqrt(x) == x)
int main()
{
    File();
    n = read(); s = 0; t = 10000; Sum = 2; e = 1;
    for (cur = 1; cur - 1 - Ans <= n; ++ cur) {
        add(s, l(cur), 1), add(l(cur), s, 0);
        add(r(cur), t, 1), add(t, r(cur), 0);
        ++ Sum;
        For(i, 1, cur - 1) if (issqr(i + cur)) add(l(i), r(cur), 1), add(r(cur), l(i), 0);
        Dinic();
    }
    printf("%d\n", cur - 2);
    cur -= 2; Set(beg, 0); e = 1; Sum = 2; Ans = 0;
    For(i, 1, cur) {
        add(s, l(i), 1), add(l(i), s, 0);
        add(r(i), t, 1), add(t, r(i), 0); ++ Sum;
        For(j, 1, i - 1) if (issqr(i + j)) add(l(j), r(i), 1), add(r(i), l(j), 0);
    }
    Dinic();
    For(i, 1, cur)
        for (register int j = beg[l(i)]; j; j = nex[j])
            if (!f[j] && v[j] != s) { pre[v[j] >> 1] = i; isbepreed[i] = 1; break; }
    For(i, 1, cur) if (!isbepreed[i]) { print(i); putchar('\n'); }
    return 0;
}
//沧海月明珠有泪，蓝田日暖玉生烟。
//    -- 李商隐《锦瑟》