HDU-4414 Finding crosses 水题
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4414
直接暴力判断即可。
1 //STATUS:C++_AC_15MS_232KB 2 #include <functional> 3 #include <algorithm> 4 #include <iostream> 5 //#include <ext/rope> 6 #include <fstream> 7 #include <sstream> 8 #include <iomanip> 9 #include <numeric> 10 #include <cstring> 11 #include <cassert> 12 #include <cstdio> 13 #include <string> 14 #include <vector> 15 #include <bitset> 16 #include <queue> 17 #include <stack> 18 #include <cmath> 19 #include <ctime> 20 #include <list> 21 #include <set> 22 #include <map> 23 using namespace std; 24 //using namespace __gnu_cxx; 25 //define 26 #define pii pair<int,int> 27 #define mem(a,b) memset(a,b,sizeof(a)) 28 #define lson l,mid,rt<<1 29 #define rson mid+1,r,rt<<1|1 30 #define PI acos(-1.0) 31 //typedef 32 typedef __int64 LL; 33 typedef unsigned __int64 ULL; 34 //const 35 const int N=60; 36 const int INF=0x3f3f3f3f; 37 const int MOD=100000,STA=8000010; 38 const LL LNF=1LL<<60; 39 const double EPS=1e-8; 40 const double OO=1e15; 41 const int dx[4]={-1,0,1,0}; 42 const int dy[4]={0,1,0,-1}; 43 const int day[13]={0,31,28,31,30,31,30,31,31,30,31,30,31}; 44 //Daily Use ... 45 inline int sign(double x){return (x>EPS)-(x<-EPS);} 46 template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;} 47 template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;} 48 template<class T> inline T lcm(T a,T b,T d){return a/d*b;} 49 template<class T> inline T Min(T a,T b){return a<b?a:b;} 50 template<class T> inline T Max(T a,T b){return a>b?a:b;} 51 template<class T> inline T Min(T a,T b,T c){return min(min(a, b),c);} 52 template<class T> inline T Max(T a,T b,T c){return max(max(a, b),c);} 53 template<class T> inline T Min(T a,T b,T c,T d){return min(min(a, b),min(c,d));} 54 template<class T> inline T Max(T a,T b,T c,T d){return max(max(a, b),max(c,d));} 55 //End 56 57 char ma[N][N]; 58 int n; 59 60 int isok(int x,int y) 61 { 62 int i,j,l,r,cnth; 63 for(l=1;y-l>=0 && ma[x][y-l]=='#';l++){ 64 if(ma[x-1][y-l]=='#' || ma[x+1][y-l]=='#')return 0; 65 } 66 for(r=1;y+r<n && ma[x][y+r]=='#';r++){ 67 if(ma[x-1][y+r]=='#' || ma[x+1][y+r]=='#')return 0; 68 } 69 if(l!=r || l==1 || r==1)return 0; 70 cnth=l; 71 for(l=1;x-l>=0 && ma[x-l][y]=='#';l++){ 72 if(ma[x-l][y-1]=='#' || ma[x-l][y+1]=='#')return 0; 73 } 74 for(r=1;x+r<n && ma[x+r][y]=='#';r++){ 75 if(ma[x+r][y-1]=='#' || ma[x+r][y+1]=='#')return 0; 76 } 77 if(l!=r || l==1 || r==1)return 0; 78 if(cnth!=l)return 0; 79 return 1; 80 } 81 82 int main() 83 { 84 // freopen("in.txt","r",stdin); 85 int i,j,cnt; 86 while(~scanf("%d",&n) && n) 87 { 88 for(i=0;i<n;i++){ 89 scanf("%s",ma[i]); 90 } 91 cnt=0; 92 for(i=1;i<n-1;i++){ 93 for(j=1;j<n-1;j++){ 94 if(ma[i][j]=='#')cnt+=isok(i,j); 95 } 96 } 97 98 printf("%d\n",cnt); 99 } 100 return 0; 101 }
