联通分量+dfs

前言：对于这个题目，注意是只能选择一个联通分量进行操作
如果不能一击必杀，那么就会陷入僵局

---

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e3 + 10;
char ch[maxn][maxn];
int bel[maxn][maxn];
int pianx[4] = {1, 0, -1, 0}, piany[4] = {0, 1, 0, -1};
int n, m;
set<int> s[1000000];
void dfs(int x, int y, int id) {
    ch[x][y] = '@';
    bel[x][y] = id;
    for (int i = 0; i < 4; i++) {
        int xx = x + pianx[i], yy = y + piany[i];
        if (xx < 1 || xx > n || yy < 1 || yy > m || ch[xx][yy] != '#')
            continue;
        dfs(xx, yy, id);
    }
}
void solve() {
    cin >> n >> m;
    int cntb = 0, cnt = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++) {
            cin >> ch[i][j];
            cntb += ch[i][j] == '.';
        }
    if (cntb == n * m) {
        cout << "Blue" << endl;
        return;
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++) {
            if (ch[i][j] == '#')
                dfs(i, j, ++cnt);
        }
    for (int i = 1; i <= cnt; i++)
        s[i].clear();
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            if (ch[i][j] == '.') {
                for (int k = 0; k < 4; k++) {
                    int ii = i + pianx[k], jj = j + piany[k];
                    if (ii < 1 || ii > n || jj < 1 || jj > m ||
                        ch[ii][jj] != '@')
                        continue;
                    s[bel[ii][jj]].insert((i - 1) * m + j);
                }
            }
    for (int i = 1; i <= cnt; i++)
        if (s[i].size() == cntb) {
            cout << "Red" << endl;
            return;
        }
    cout << "Draw" << endl;
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--)
        solve();
    return 0;
}