B. Beingawesomeism(模拟)

https://codeforces.com/contest/1280/problem/B

---

思路：

分类讨论

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=70;
typedef int LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char mp[maxn][maxn];
LL check(LL x1,LL y1,LL x2,LL y2){
   LL sum=0;
   for(LL i=x1;i<=x2;i++){
       for(LL j=y1;j<=y2;j++){
           if(mp[i][j]=='A') sum++;
       }
   }
   return sum;
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      memset(mp,'\0',sizeof(mp));
      LL n,m;cin>>n>>m;
      for(LL i=1;i<=n;i++){
          for(LL j=1;j<=m;j++){
              cin>>mp[i][j];
          }
      }
      LL ans=4;
      ///没有A
      if(check(1,1,n,m)==0){
         cout<<"MORTAL"<<"\n";
         continue;
      }
      ///全是A;
      if(check(1,1,n,m)==n*m) ans=min(ans,0);
      ///边上有一行/一列
      if(check(1,1,1,m)==m ) ans=min(ans,1);
      if(check(1,1,n,1)==n ) ans=min(ans,1);
      if(check(1,m,n,m)==n ) ans=min(ans,1);
      if(check(n,1,n,m)==m ) ans=min(ans,1);
      ///边角上有一点
      if(check(1,1,1,1)==1)  ans=min(ans,2);
      if(check(1,m,1,m)==1)  ans=min(ans,2);
      if(check(n,1,n,1)==1)  ans=min(ans,2);
      if(check(n,m,n,m)==1)  ans=min(ans,2);
      ///中间的一整行或一整列
      for(LL i=2;i<=n-1;i++){
          if(check(i,1,i,m)==m) ans=min(ans,2);
      }
      for(LL j=2;j<=m-1;j++){
          if(check(1,j,n,j)==n) ans=min(ans,2);
      }
      ///边上差两个端点的
      if(check(1,2,1,m-1)==m-2) ans=min(ans,3);
      if(check(n,2,n,m-1)==m-2) ans=min(ans,3);
      if(check(2,1,n-1,1)==n-2) ans=min(ans,3);
      if(check(2,m,n-1,m)==n-2) ans=min(ans,3);
      ///边的其他地方还有个点
      for(LL j=1;j<=m;j++){
          if(mp[1][j]=='A'||mp[n][j]=='A') ans=min(ans,3);
      }
      for(LL i=1;i<=n;i++){
          if(mp[i][1]=='A'||mp[i][m]=='A') ans=min(ans,3);
      }
      cout<<ans<<"\n";
   }
   return 0;
}