NKGUARD - Bảo vệ nông trang
Tác giả: happyboy99x
Ngôn ngữ: C++
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define sz(a) int((a).size())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(c,i) for(typeof((c).begin()) i = (c).begin(), _e = (c).end(); i != _e; ++i)
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define rep(i,n) for(int i = 0, _n = (n); i < _n; ++i)
#define repd(i,n) for(int i = (n)-1; i >= 0; --i )
#define fo(i,a,b) for(int i = (a), _b = (b); i <= _b; ++i)
#define fod(i,a,b) for(int i = (a), _b = (b); i >= _b; --i)
#define INF 1000000000
#define N 1005
int h[N][N], n, m, qu[N*N];
bool vst[N][N];
int I[] = {-1,-1,-1,0,0,1,1,1}, J[] = {-1,0,1,-1,1,-1,0,1};
int hilltop( int i, int j ) {
int H = h[i][j], lo = 0, hi = 2;
vst[i][j] = 1; qu[0] = i; qu[1] = j;
int res = 1;
while(lo!=hi) {
int i = qu[lo++], j = qu[lo++];
rep(k,8) {
int x = i + I[k], y = j + J[k];
if( h[x][y] > H ) res = 0;
else if( h[x][y] == H && vst[x][y] == 0 ) {
vst[x][y] = 1;
qu[hi++] = x; qu[hi++] = y;
}
}
}
return res;
}
int main() {
#ifndef ONLINE_JUDGE
freopen( "input.txt", "r", stdin );
//freopen( "output.txt", "w", stdout );
#endif
scanf("%d%d",&n,&m);
fo(i,1,n) fo(j,1,m) scanf("%d",&h[i][j]);
rep(i,n+2) h[i][0] = h[i][m+1] = -1;
rep(j,m+2) h[0][j] = h[n+1][j] = -1;
int res = 0;
fo(i,1,n) fo(j,1,m)
if(!vst[i][j] && h[i][j] != 0) res += hilltop(i,j);
printf("%d\n", res);
return 0;
}