#include #include #include struct GraphType{ int Value; bool IsVisited; }; struct BufferType{ int X, Y; }; bool isPeak(std::vector>&, int, int); bool bfs(std::vector>&, int, int, int); int main(int argc, char* argv[]){ int N, M; scanf("%d %d", &N, &M); std::vector> graph(N+2, std::vector(M+2, {-1, false})); for(int i = 1; i <= N; i++){ for(int j = 1; j <= M; j++){ scanf("%d ", &graph[i][j].Value); } } int result = 0; for(int i = 1; i <= N; i++){ for(int j = 1; j <= M; j++){ if(graph[i][j].IsVisited){ continue; } if(graph[i][j].Value == 0){ continue; } if(!isPeak(graph, i, j)){ continue; } if(!bfs(graph, i, j, graph[i][j].Value)){ continue; } result++; } } printf("%d", result); return 0; } bool bfs(std::vector>& graph, int x, int y, int p){ bool result = true; int N = graph.size(), M = graph[0].size(); std::queue buffer; buffer.push({x, y}); while(!buffer.empty()){ struct BufferType current = buffer.front(); buffer.pop(); if(current.X < 1 || current.Y < 1 || current.X > N || current.Y > M){ continue; } if(graph[current.X][current.Y].Value != p || graph[current.X][current.Y].IsVisited){ continue; } if(!isPeak(graph, current.X, current.Y)){ result = false; } graph[current.X][current.Y].IsVisited = true; buffer.push({current.X + 1, current.Y}); buffer.push({current.X + 1, current.Y+1}); buffer.push({current.X + 1, current.Y-1}); buffer.push({current.X - 1, current.Y}); buffer.push({current.X - 1, current.Y+1}); buffer.push({current.X - 1, current.Y-1}); buffer.push({current.X, current.Y + 1}); buffer.push({current.X, current.Y - 1}); } return result; } bool isPeak(std::vector>& graph, int i, int j){ if(graph[i][j].Value < graph[i+1][j].Value){ return false; } if(graph[i][j].Value < graph[i+1][j+1].Value){ return false; } if(graph[i][j].Value < graph[i+1][j-1].Value){ return false; } if(graph[i][j].Value < graph[i-1][j].Value){ return false; } if(graph[i][j].Value < graph[i-1][j+1].Value){ return false; } if(graph[i][j].Value < graph[i-1][j-1].Value){ return false; } if(graph[i][j].Value < graph[i][j+1].Value){ return false; } if(graph[i][j].Value < graph[i][j-1].Value){ return false; } return true; }

코드 #1906