牛客-石油采集

原题链接
方法一：统计每一个连通块中每个油田坐标点横纵坐标总和为奇数的个数和偶数的个数，取两者最小值便是此联通块能得到油的个数，统计所有连通块的总数即为答案

C++代码

#include <bits/stdc++.h>
#define int long long 
using namespace std;
const int N = 55;
char g[N][N];
int t, n, odd, even;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

void dfs(int x, int y)
{
    if ((x + y) & 1) even ++ ;
    else odd ++ ;
    g[x][y] = '.';
    for (int i = 0; i < 4; i ++ )
    {
        int a = x + dx[i], b = y + dy[i];
        if (a >= 0 && a < n && b >= 0 && b < n && g[a][b] == '#')
        {
            dfs(a, b);
        }
    }
}


signed main()
{
    cin >> t;
    for (int op = 1; op <= t; op ++ )
    {
        cin >> n;
        for (int i = 0; i < n; i ++ ) cin >> g[i];
        int ans = 0;
        for (int i = 0; i < n; i ++ )
        {
            for (int j = 0; j < n; j ++ )
            {
                if (g[i][j] == '#')
                {
                    odd = 0, even = 0;
                    dfs(i, j);
                    ans += min(odd, even);                    
                }
            }
        }
        cout << "Case " << op  << ": " << ans << endl;
    }
    return 0;
}

方法二：二分图匹配

#include <cstring>
#include <iostream>
#include <algorithm>

#define x first
#define y second

using namespace std;

typedef pair<int, int> PII;

const int N = 55;

int n, m;
PII match[N][N];
bool g[N][N], st[N][N];
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

bool find(int x, int y)
{
    for (int i = 0; i < 4; i ++ )
    {
        int a = x + dx[i], b = y + dy[i];
        if (a && a <= n && b && b <= n && !g[a][b] && !st[a][b])
        {
            st[a][b] = true;
            PII t = match[a][b];
            if (t.x == -1 || find(t.x, t.y))
            {
                match[a][b] = {x, y};
                return true;
            }
        }
    }

    return false;
}

int main()
{
    int t;
    cin >> t;
    for (int op = 1; op <= t;  op ++ )
    {
        cin >> n;

        for (int i = 1; i <= n; i ++ )
        {
            for (int j = 1; j <= n; j ++ )
            {
                char c;
                cin >> c;
                if (c == '#') g[i][j] = 0;
                else g[i][j] = 1;
            }
        }

        memset(match, -1, sizeof match);

        int res = 0;
        for (int i = 1; i <= n; i ++ )
            for (int j = 1; j <= n; j ++ )
                if ((i + j) % 2 && !g[i][j])
                {
                    memset(st, 0, sizeof st);
                    if (find(i, j)) res ++ ;
                }

        cout << "Case " << op << ": " << res << endl;    
    }

    return 0;
}