#include <bits/stdc++.h> #define FOR(x, b, e) for(int x = b; x <= (e); ++x) #define FORD(x, b,e) for(int x = b; x >= (e); --x) #define REP(x, b) for(int x = 0; x < (b); ++x) #define SIZE(c) ((int)c.size()) #define ALL(c) (c).begin(), (c).end() #define MP make_pair #define PB push_back #define ST first #define ND second using namespace std; typedef long long LL; typedef vector <int> VI; typedef pair <int, int> PII; typedef vector <PII> VPII; const int MAXN = 4e3 + 9; int tab[MAXN][MAXN]; char s[MAXN]; int main() { int n, k; int wyn = 0; cin>>n>>k; REP(i, n) { scanf("%s", s); REP(j, n) { if(s[j] == '#') tab[j + 1][i + 1] = 1; } } FOR(i, 1, n) FOR(j, 1, n) { if(tab[j][i] == 1) continue; int suma = tab[j - 1][i] + tab[j + 1][i] + tab[j][i - 1] + tab[j][i + 1]; if(suma > 0) wyn++; } cout<<wyn<<endl; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 | #include <bits/stdc++.h> #define FOR(x, b, e) for(int x = b; x <= (e); ++x) #define FORD(x, b,e) for(int x = b; x >= (e); --x) #define REP(x, b) for(int x = 0; x < (b); ++x) #define SIZE(c) ((int)c.size()) #define ALL(c) (c).begin(), (c).end() #define MP make_pair #define PB push_back #define ST first #define ND second using namespace std; typedef long long LL; typedef vector <int> VI; typedef pair <int, int> PII; typedef vector <PII> VPII; const int MAXN = 4e3 + 9; int tab[MAXN][MAXN]; char s[MAXN]; int main() { int n, k; int wyn = 0; cin>>n>>k; REP(i, n) { scanf("%s", s); REP(j, n) { if(s[j] == '#') tab[j + 1][i + 1] = 1; } } FOR(i, 1, n) FOR(j, 1, n) { if(tab[j][i] == 1) continue; int suma = tab[j - 1][i] + tab[j + 1][i] + tab[j][i - 1] + tab[j][i + 1]; if(suma > 0) wyn++; } cout<<wyn<<endl; return 0; } |