【网络流24题】骑士共存问题

Description

click me

Solution

2.1

考虑建一个二分图：互相攻击的点连边，求最小覆盖数

2.2

考虑将互相攻击的点连一条流量为1的边，然后求最小割

Code

3.1

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

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
#define For(i , j , k) for (int i = (j) , _##end_ = (k) ; i <= _##end_ ; ++ i)
#define Fordown(i , j , k) for (int i = (j) , _##end_ = (k) ; i >= _##end_ ; -- i)
#define Set(a , b) memset(a , b , sizeof(a))
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define INF (0x3f3f3f3f)
#define Mod (1000000007)
using namespace std;
typedef long long LL;
typedef pair<int , int> PII;

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; }

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

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

const int maxn = 210 , maxnode = 40010 , maxedge = 40010 * 8;

int beg[maxnode] , nex[maxedge] , v[maxedge] , e , n , m , dt[8][2] = {1 , 2 , 2 , 1 , -1 , -2 , -2 , -1 , -1 , 2 , 2 , -1 , -2 , 1 , 1 , -2} , x_ , y_ , vis[maxnode] , n1 , n2 , a[maxn][maxn] , Ans , mat[maxnode] , cnt1 , cnt2 , idx[maxn][maxn];

inline bool isin(int x_ , int y_) { if (x_ >= 1 && x_ <= n && y_ >= 1 && y_ <= n) return true; return false; }

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

inline bool dfs(int u)
{
    for (int i = beg[u] ; i ; i = nex[i])
    {
        if (vis[v[i]])
            continue;
        vis[v[i]] = true;
        if (!mat[v[i]] || dfs(mat[v[i]]))
        {
            mat[v[i]] = u;
            return true;
        }
    }
    return false;
}

int main()
{
    File();
    n = read(); m = read();
    For(i , 1 , m) x_ = read(), y_ = read(), a[x_][y_] = true;
    For(i , 1 , n) For(j , 1 , n) if ((i + j) & 1) idx[i][j] = ++ cnt2; else idx[i][j] = ++ cnt1;
    For(i , 1 , n)
        For(j , 1 , n) {
            if ((i + j) & 1) ++ n1;
            if (a[i][j] || ((i + j) & 1)) continue;
            For(k , 0 , 7) {
                x_ = i + dt[k][0]; y_ = j + dt[k][1];
                if (!isin(x_ , y_) || a[x_][y_]) continue;
                add(idx[i][j] , idx[x_][y_]);
            }
        }
    n2 = n * n - n1;
    For(i , 1 , n1) {
        Set(vis , false);
        if (dfs(i)) ++ Ans;
    }
    printf("%d\n" , n * n - m - Ans);
    return 0;
}
//雁字无多，写得相思几许。
//    -- 周密《扫花游·九日怀归》

3.2

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

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
#define For(i , j , k) for (int i = (j) , _##end_ = (k) ; i <= _##end_ ; ++ i)
#define Fordown(i , j , k) for (int i = (j) , _##end_ = (k) ; i >= _##end_ ; -- i)
#define Set(a , b) memset(a , b , sizeof(a))
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define INF (0x3f3f3f3f)
#define Mod (1000000007)
using namespace std;
typedef long long LL;
typedef pair<int , int> PII;

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; }

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

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

const int maxn = 210 , maxnode = 40010 , maxedge = 40010 * 20;

int beg[maxnode] , nex[maxedge] , v[maxedge] , e , n , m , dt[8][2] = {1 , 2 , 2 , 1 , -1 , -2 , -2 , -1 , -1 , 2 , 2 , -1 , -2 , 1 , 1 , -2} , x_ , y_ , a[maxn][maxn] , Ans , f[maxedge], gap[maxnode], d[maxnode], s, t;

inline bool isin(int x_ , int y_) { if (x_ >= 1 && x_ <= n && y_ >= 1 && y_ <= n) return true; return false; }

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

int sap(int u, int flow)
{
    if (u == t) return flow;
    register int res = flow, tmp;
    for (register int i = beg[u]; i; i = nex[i]) {
        if (d[u] != d[v[i]] + 1 || !f[i]) continue;
        tmp = sap(v[i], min(res, f[i]));
        f[i] -= tmp; f[i ^ 1] += tmp;
        if (!(res -= tmp)) return flow;
    }
    if (!--gap[d[u]]) d[s] = t + 1;
    ++ gap[++ d[u]];
    return flow - res;
}

#define idx(x, y) ((x - 1) * n + y)
int main()
{
    File();
    n = read(); m = read(); s = 0; t = n * n + 1;
    For(i , 1 , m) x_ = read(), y_ = read(), a[x_][y_] = true;
    e = 1;
    For(i , 1 , n) For(j , 1 , n) {
        if (a[i][j]) continue;
        if ((i + j) & 1) {
            add(idx(i, j), t, 1), add(t, idx(i, j), 0);
            continue;
        }
        add(s, idx(i, j), 1), add(idx(i, j), s, 0);
        For(k , 0 , 7) {
            x_ = i + dt[k][0]; y_ = j + dt[k][1];
            if (!isin(x_ , y_) || a[x_][y_]) continue;
            add(idx(i, j) , idx(x_, y_), 1); add(idx(x_, y_) , idx(i, j), 0);
        }
    }
    for (gap[0] = t + 1; d[s] < t + 1; ) Ans += sap(s, INF);
    printf("%d\n" , n * n - m - Ans);
    return 0;
}
//人生若只如初见，何事秋风悲画扇。
//    -- 纳兰性德《木兰词·拟古决绝词柬友》