hack：
```c++
Input:
5 5
3 2 1 2 3
3 2 1 2 3
3 2 1 2 3
3 2 1 2 3
3 2 1 2 3
Output:
3 2
Answer:
2 1
```
还有，不会说英文可以不说
by Loser_King @ 2022-02-22 20:46:17
NiWeiShaYaoZheYangShuoHua
by wzj_zhzx_oicon @ 2022-02-22 20:46:57
ZhuiJia
```cpp
#include <cstdio>
int n,Map[1005][1005],v = 0,r = 0,tmp,dx[] = {0,0,1,-1,1,1,-1,-1},dy[] = {1,-1,0,0,1,-1,1,-1},sw;
bool vis[1005][1005] = {false},flag = true;
bool cp(int x,int y,int L){ //注，此变量名没有特别用意，CheckPoint
return !(x < 0 || x >= n || y < 0 || y >= n || vis[x][y] == true && Map[x][y] == L);
}
void dfs(int x,int y){
if(vis[x][y]) return;
vis[x][y] = true;
for(int i = 0; i < 8; i++){
int nx = x + dx[i],ny = y + dy[i];
if(cp(nx,ny,Map[x][y])){
if(Map[x][y] == Map[nx][ny]){
dfs(nx,ny);
}
if(Map[x][y] > Map[nx][ny]){
sw = 1;
}
if(Map[x][y] < Map[nx][ny]){
sw = 2;
}
}
}
return;
}
void SCAN(int i,int j){
int a;
scanf("%d",&a);
if(i == 0 && j == 0) tmp = a;
if(a != tmp) flag = false;
Map[i][j] = a;
return;
}
int main(){
scanf("%d",&n);
for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) SCAN(i,j);
if(flag){
printf("1 1");
return 0;
}
for(int i = 0; i < n; i++) for(int j = 0; j < n; j++){
if(vis[i][j]) continue;
dfs(i,j);
switch(sw){
case 1:
r++;
break;
case 2:
v++;
break;
}
}
printf("%d %d",r,v);
return 0;
}
```
E
WoGaiLeGaiYiJingWuShiFenLe
by songhx @ 2022-02-23 20:52:54
@[Loser_King](/user/159686) 您这个点可以的么？2旁边有3有1
by songhx @ 2022-02-23 20:53:58
@[Loser_King](/user/159686) 哦哦懂了，题没读懂，谢了
by songhx @ 2022-02-23 20:57:08