hdu 4414 Finding crosses

http://acm.hdu.edu.cn/showproblem.php?pid=4414

简单枚举

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>#define LL long long
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int N=105;
string figure[N];
int n;
bool cross(int I,int J)
{int k1=0,k2=0,k3=0,k4=0;for(int j=J+1;j<n;++j){if(figure[I][j]=='#'){if(figure[I-1][j]=='o'&&figure[I+1][j]=='o')++k1;elsereturn false;}elsebreak;}if(k1==0)return false;for(int j=J-1;j>=0;--j){if(figure[I][j]=='#'){if(figure[I-1][j]=='o'&&figure[I+1][j]=='o')++k2;elsereturn false;}elsebreak;}if(k1!=k2)return false;for(int i=I+1;i<n;++i){if(figure[i][J]=='#'){if(figure[i][J+1]=='o'&&figure[i][J-1]=='o')++k3;elsereturn false;}elsebreak;}if(k1!=k3)return false;for(int i=I-1;i>=0;--i){if(figure[i][J]=='#'){if(figure[i][J+1]=='o'&&figure[i][J-1]=='o')++k4;elsereturn false;}elsebreak;}if(k1!=k4)return false;return true;}
int main()
{//freopen("data.txt","r",stdin);while(cin>>n){if(n==0)break;for(int i=0;i<n;++i)cin>>figure[i];int ans=0;for(int i=1;i<n-1;++i){for(int j=1;j<n-1;++j){if(figure[i][j]=='#'&&cross(i,j))++ans;}}cout<<ans<<endl;}return 0;
}

转载于:https://www.cnblogs.com/liulangye/archive/2012/09/26/2703410.html

hdu 4414 Finding crosses相关推荐

HDU 4414 Finding crosses（搜索）
题目链接:HDU 4414 Finding crosses [题目大意] 给你一张n*n的图,由o #这两个元素组成,让我们找其中有多少十字架. 十字架由#构成十字架的纵向长度等于横向长度 , 且这 ...
HDU-4414 Finding crosses
问题描述: The Nazca Lines are a series of ancient geoglyphs located in the Nazca Desert in southern Peru ...
HDU - 6756 Finding a MEX-分块思想
https://vjudge.net/problem/HDU-6756 题目大意:给你一个无向图,每个点有权值a,将f(u)定义为对u的邻居的集合求mex: 有两个操作: 1:将u的权值修改为x 2: ...
杭电OJ分类题目（2）
原题出处:HDOJ Problem Index by Type,http://acm.hdu.edu.cn/typeclass.php 杭电OJ分类题目(2) HDU Water~~~ HDU 100 ...
解题报告 (十三) 尺取法
文章目录尺取法解题报告 PKU 2100 Graveyard Design PKU 3061 Subsequence PKU 2739 Sum of Consecutive Prime Numbe ...
HDU多校1 - 6756 Finding a MEX(分块+二分+树状数组)
题目链接:点击查看题目大意:给出一个 n 个点和 m 条边的无向图,每个点都有一个权值,现在需要执行 q 次操作,每次操作分为两种类型: 1 pos val :将第 pos 个点的权值修改为 val ...
【HDU - 1937 】Finding Seats（二维前缀和+尺取法）
题干: A group of K friends is going to see a movie. However, they are too late to get good tickets, so ...
暑期集训3:几何基础练习题G: HDU - 1052
2018学校暑期集训第三天--几何基础练习题G -- HDU - 1052 (昨天加练题) Tian Ji -- The Horse Racing Here is a famous sto ...
台湾国立大学郭彦甫Matlab教程笔记（20） root finding(numeric)
台湾国立大学郭彦甫Matlab教程笔记(20) root finding(numeric) symbolic vs. numeric符号法和数值法的区别对比 symbolic 1)advantages ...

hdu 4414 Finding crosses

hdu 4414 Finding crosses相关推荐

最新文章

热门文章