Subimage Recognition 【POJ - 3600】【图形的简单匹配】

题目链接

---

  可以删除行或者列，问最后小方块能否被大方块表示？

  由于图形很小，所以我想的是直接去dfs()去暴力。对应匹配即可。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
#define MP3(a, b, c) MP(MP(a, b), c)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 27;
int r, c, R, C, choC[maxN];
char s1[maxN][maxN], s2[maxN][maxN];
inline bool check(int now_R)
{
    bool flag = false;
    int id_r = 1;
    for(int i=now_R + 1; i<=R; i++)
    {
        for(int j=1; j<=c; j++)
        {
            if(s1[id_r + 1][j] == s2[i][choC[j]])
            {
                if(j == c) id_r++;
            }
            else break;
        }
        if(id_r == r) { flag = true; break; }
    }
    return flag;
}
inline bool dfs(int now_R, int now_C, int now)
{
    if(now == c) return check(now_R);
    for(int i=now_C + 1; i<=C; i++)
    {
        if(s1[1][now + 1] == s2[now_R][i])
        {
            choC[now + 1] = i;
            if(dfs(now_R, i, now + 1)) return true;
        }
    }
    return false;
}
int main()
{
    scanf("%d%d", &r, &c);
    for(int i=1; i<=r; i++) scanf("%s", s1[i] + 1);
    scanf("%d%d", &R, &C);
    for(int i=1; i<=R; i++) scanf("%s", s2[i] + 1);
    bool op = false;
    for(int i=1; i<=R - r + 1; i++)
    {
        for(int j=1; j<=C - c + 1; j++)
        {
            if(s1[1][1] == s2[i][j])
            {
                choC[1] = j;
                op = dfs(i, j, 1);
                if(op) break;
            }
        }
        if(op) break;
    }
    printf(op ? "Yes\n" : "No\n");
    return 0;
}
/*
2 1
1
0
3 3
101
111
110
ans:Yes
*/