请教这道C++问题见图片，各位加油

Question

请教这道C++
请教这道C++
请教这道C++
请教这道C++
请教这道C++参考图片
各位加油

Answer 1

// ConsoleApplication18.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//

#include <iostream>

using namespace std;

void test();
void find(int* loc, int* loc2, int n, int m, int start, int* count);
int main()
{
    test();
}

void test() {
    
    int m, n, t,count;
    char tmp=0;
    cin >> n;
    cin >> m;
    cin >> t;
    int* loc = new int[m * n]{0};
    int* loc_break = new int[t*2];
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            cin >> tmp;
            if (tmp=='?')
            {
                *(loc+i*m+j) = 1;
            }
            else
            {
                *(loc + i * m + j) = 0;
            }
        }
    }
    for (int i = 0; i < t; i++)
    {
        cin >> *(loc_break+i*2);
        cin >> *(loc_break+i*2+1);
    }
    int* loc2 = new int[m * n]{0};
    count = 0;
    find(loc,loc2,n,m,0,&count);
    cout << count<<'\n';
    for (int i = 0; i < t; i++)
    {
        loc[ (*(loc_break+i*2) - 1)*m + *(loc_break+i*2+1) - 1] = 0;
        loc2 = new int[n*m]{0};
        count = 0;
        find(loc,loc2,n,m,0,&count);
        cout << count << '\n';
        //loc[*(loc_break + i * 2) - 1 + *(loc_break + i * 2 + 1) - 1] = 0;
    }
}

void find(int* loc,int* loc2,int n,int m,int start,int* count) {

    int i = start / m;
    int j = start % m;
            if (loc[start] == 0)
            {
                if (i == (n - 1) && j == (m - 1))
                {
                    (*count)++;
                }
                else
                {
                    find(loc, loc2, n, m, start + 1, count);
                }
            }
            else
            {

                for (int k = 1; k < 4; k++)//0empty 1 tiger 2lion 3wolf 
                {
                    int flag = 1;
                    if (k == 1)
                    {
                        if (i > 0)
                        {
                            if (loc2[(i - 1) * m + j] != 0)
                            {
                                flag = 0;
                            }

                        }
                        if (j > 0)
                        {
                            if (loc2[i * m + j - 1] != 0)
                            {
                                flag = 0;
                            }
                        }
                    }
                    else if (k == 2)
                    {
                        if (i > 0)
                        {
                            if (loc2[(i - 1) * m + j] == 1|| loc2[(i - 1) * m + j] == 3)
                            {
                                flag = 0;
                            }

                        }
                        if (j > 0)
                        {
                            if (loc2[i * m + j - 1] == 1 || loc2[i * m + j - 1] == 3)
                            {
                                flag = 0;
                            }
                        }
                    }
                    else
                    {
                        if (i > 0)
                        {
                            if (loc2[(i - 1) * m + j] == 1 || loc2[(i - 1) * m + j] == 2)
                            {
                                flag = 0;
                            }

                        }
                        if (j > 0)
                        {
                            if (loc2[i * m + j - 1] == 1 || loc2[i * m + j - 1] == 2)
                            {
                                flag = 0;
                            }
                        }
                    }
                    if (flag)
                    {
                        loc2[i * m + j] = k;
                        if (i == (n - 1) && j == (m - 1))
                        {
                            (*count)++;
                        }
                        else
                        {
                            find(loc, loc2, n, m, start + 1, count);
                        }
                    }
                }

            }
}