只拿了90分,第五个数据点超时
#include<bits/stdc++.h>
using namespace std;
const int M=510;
struct node{
int l,r;
}edge[M];
int n,m,a[M][M];
bool b[M],mp[M][M],vis[M][M];
int q[5]={1,0,-1,0},p[5]={0,1,0,-1};
inline int read(){
int ret=0;
char c=getchar();
while(c<'0'||c>'9')
c=getchar();
while(c>='0'&&c<='9'){
ret=ret*10+c-'0';
c=getchar();
}
return ret;
}
void dfs(int x,int y,int z){
int i,x0,y0;
vis[x][y]=1;
if(x==n)
mp[z][y]=1;
for(i=0;i<4;i++){
x0=x+q[i];y0=y+p[i];
if(x0<1||y0<1||x0>n||y0>m)continue;
if(a[x0][y0]>=a[x][y])continue;
if(!vis[x0][y0])dfs(x0,y0,z);
}
}
int cmp(node q,node p){
if(q.l!=p.l)return q.l<p.l;
return q.r<p.r;
}
int main(){
int i,j,k,pos,ans,maxx,no_water;
n=read();m=read();
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
a[i][j]=read();
for(i=1;i<=m;i++){
memset(vis,0,sizeof(vis));
dfs(1,i,i);
}
for(i=1;i<=m;i++)
for(j=1;j<=m+1;j++)
if(mp[i][j]){
b[j]=1;
if(!mp[i][j-1])
edge[i].l=j-1;
}
else if(mp[i][j-1])
edge[i].r=j-1;
no_water=0;
for(i=1;i<=m;i++)
if(b[i]==0)
no_water++;
if(no_water){
cout<<0<<endl<<no_water<<endl;
return 0;
}
sort(edge+1,edge+1+m,cmp);
ans=pos=0;
i=1;
while(pos!=m){
j=i;
while(edge[j].l<=pos&&j<=m)j++;
j--;
maxx=0;
for(k=i;k<=j;k++)
maxx=max(maxx,edge[k].r);
pos=maxx;
i=j+1;
ans++;
}
cout<<1<<endl<<ans<<endl;
return 0;
}