程序设计天梯赛选拔 大炮打蚊子(刷水题就变傻，确实，感觉自己变傻了)

题目
题意: 大炮打蚊子，模拟。
思路: 模拟
时间复杂度: O(n*m+k)
代码:

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<complex>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<list>
#include<set>
#include<queue>
#include<stack>
#define OldTomato ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define fir(i,a,b) for(int i=a;i<=b;++i) 
#define mem(a,x) memset(a,x,sizeof(a))
#define p_ priority_queue
// round() 四舍五入 ceil() 向上取整 floor() 向下取整
// lower_bound(a.begin(),a.end(),tmp,greater<ll>()) 第一个小于等于的
// #define int long long //QAQ
using namespace std;
typedef complex<double> CP;
typedef pair<int,int> PII;
typedef long long ll;
// typedef __int128 it;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const int N = 2e5+10;
const int M = 1e6+10;
const int mod = 1e9+7;
const double eps = 1e-6;
inline int lowbit(int x){ return x&(-x);}
template<typename T>void write(T x)
{
    if(x<0)
    {
        putchar('-');
        x=-x;
    }
    if(x>9)
    {
        write(x/10);
    }
    putchar(x%10+'0');
}
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
int n,m,k,T;
int a[22][22];
int cnt[22][22];
int dx[] = {-1,0,1,0};
int dy[] = {0,1,0,-1};
int fun(int x,int y)
{
	int res = 0;
	cnt[x][y] -= 2;
	if(cnt[x][y] == 0 && a[x][y] == 1) res++;
	for(int i=0;i<4;++i)
	{
		int tx = x+dx[i];
		int ty = y+dy[i];
		if(tx<1||ty<1||tx>n||ty>m) continue;
		if(a[tx][ty]==0) continue;
		cnt[tx][ty]--;
		if(cnt[tx][ty] == 0) res++;
	}
	return res;
}
void solve()
{
   cin>>n>>m;
   for(int i=1;i<=n;++i)
   {
   	 for(int j=1;j<=m;++j)
   	 {
   	 	char ch; cin>>ch;
   	 	if(ch=='#') a[i][j] = 1,cnt[i][j] = 2;
   	 }
   }
   cin>>k;
   while(k--)
   {
   	  int x,y; cin>>x>>y;
   	  x++,y++;
   	  cout<<fun(x,y)<<endl;
   }
}
signed main(void)
{  
   T = 1;
   // OldTomato; cin>>T;
   // read(T);
   while(T--)
   {
   	 solve();
   }
   return 0;
}