Water diversion into chengluo Valley p1514

subject
A big man's blog
Code

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e3+5;
const int inf=0x3f3f3f3f;
typedef long long ll;
typedef pair<int,int> PII;
bool vis[maxn][maxn];
int a[maxn][maxn];
int l[maxn],r[maxn];
int n,m;
int dx[4]={
    0,0,-1,1};
int dy[4]={
    -1,1,0,0};
queue<PII>q;

struct node
{
    
    int l,r;
    void clear()
    {
    
        l=inf;

    }
}nd[maxn];

inline void bfs(int x,int y)
{
    
    memset(vis,false,sizeof(vis));
    q.push({
    x,y});
    while(!q.empty())
    {
    
        PII temp=q.front();
        q.pop();
        int x1=temp.first;
        int y1=temp.second;
        if(x1<1||x1>n||y1<1||y>m)
            continue;
        if(vis[x1][y1])
            continue;
        vis[x1][y1]=true;
        if(x1==1)
            {
    
                nd[y].l=min(nd[y].l,y1);
                nd[y].r=max(nd[y].r,y1);
            }
        for(int i=0;i<4;i++)
        {
    
            int kx=x1+dx[i];
            int ky=y1+dy[i];
            if(a[kx][ky]>a[x1][y1])
            q.push({
    kx,ky});
        }
    }
}

bool cmp(node a,node b)
{
    
    if(a.l==b.l)
        return a.r<b.r;
    return a.l<b.l;
}
int main()
{
    
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
    
        for(int j=1;j<=m;j++)
        {
    
            cin>>a[i][j];
        }

    }
    int tot=0;
    for(int i=1;i<=m;i++)
    {
    
        nd[i].clear();
        bfs(n,i);
        if(nd[i].l==inf)
            tot++;
    }
    if(tot)
    {
    
        if(n!=1)
            cout<<0<<endl<<tot;
        else
            cout<<1<<endl<<tot;
        return 0;
    }
    sort(nd+1,nd+1+m,cmp);
    int last=0;// Record the location of the last water station 
    for(int i=1;i<=m;i++)// Enumerate each place from the last line 
    {
    
        if(last>=nd[i].l&&last<=nd[i].r)// If the last water station , In the area where water can be poured into this place 
            continue;
        tot++;
        last=nd[i].r;
    }
    cout<<1<<endl<<tot;
}