Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <iostream> #include<queue> using namespace std; int main() { int n,m; cin>>n>>m; int mat[n][m]; int s=2e9; int si,sj; int roboti=0; for(int i=0; i<n; i++) { for(int j=0; j<m; j++) { cin>>mat[i][j]; } } queue<int>q; bool visited[n][m]; for(int i=0; i<n; i++) { for(int j=0; j<m; j++) { visited[i][j]=false; } } int di[]= {-1,1,0,0}; int dj[]= {0,0,-1,1}; for(int i=0; i<n; i++) { for(int j=0; j<m; j++) { si=-1; sj=-1; s=2e9; for(int x=0; x<n; x++) { for(int y=0; y<m; y++) { if(mat[x][y]<s && !visited[x][y]) { s=mat[x][y]; si=x; sj=y; } } } if(si!=-1 && sj!=-1) { q.push(si); q.push(sj); roboti+=1; visited[si][sj]=true; while(!q.empty()) { int ci=q.front(); q.pop(); int cj=q.front(); q.pop(); for(int k=0; k<4; k++) { int ti=ci+di[k]; int tj=cj+dj[k]; if(ti>=0 && tj>=0 && ti<n && tj<m && !visited[ti][tj] && mat[ti][tj]>=mat[ci][cj]) { visited[ti][tj]= true; q.push(ti); q.push(tj); } } } } } } cout<<roboti; return 0; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
