Codeforces GYM 100114 B. Island 水题

//qscqesze
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <bitset>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include <map>
#include <stack>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
#define maxn 510000
#define mod 10007
#define eps 1e-9
int Num;
//const int inf=0x7fffffff;   //§ß§é§à§é¨f§³
const int inf=0x3f3f3f3f;
inline ll read()
{
    ll x=0,f=1;char ch=getchar();
    while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
    while(ch>=‘0‘&&ch<=‘9‘){x=x*10+ch-‘0‘;ch=getchar();}
    return x*f;
}
//**************************************************************************************

string s[1010];
int vis[1010][1010];
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
struct node
{
    int x,y;
};
int main()
{
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    //input.txt / output.txt
    int n=read(),m=read();
    node st;
    for(int i=0;i<n;i++)
        cin>>s[i];
    int ans=0;
    int flag=0;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            if(s[i][j]==‘+‘)
            {
                int flag=0;
                for(int k=0;k<4;k++)
                {
                    if(i+dx[k]<0||i+dx[k]>=n)
                        flag=1;
                    else if(j+dy[k]<0||j+dy[k]>=m)
                        flag=1;
                    else if(s[i+dx[k]][j+dy[k]]==‘-‘)
                        flag=1;
                }
                if(flag)
                    ans++;
            }
        }
    }
    printf("%d\n",ans);
}