60分求调(必关)

#include<bits/stdc++.h>
using namespace std;
int a[1010][1010]={0};
int main(){
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>a[i][j];
        }
    }
    int t;
    cin>>t;
    for(int i=1;i<=t;i++){
        int x,x1,y,y1;
        cin>>x>>y>>x1>>y1;
        swap(a[x][y],a[x1][y1]);
    }
    int k=1;
    int ans=0,xy[1010][2]={0};
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(a[i][j]>a[i-1][j]&&a[i][j]>a[i+1][j]&&a[i][j]>a[i][j-1]&&a[i][j]>a[i][j+1]){
                ans++;
            }
        }
    }
    cout<<ans<<"\n";
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(a[i][j]>a[i-1][j]&&a[i][j]>a[i+1][j]&&a[i][j]>a[i][j-1]&&a[i][j]>a[i][j+1]){
                cout<<i<<" "<<j<<"\n";
            }
        }
    }
    return 0;
}