洛谷还有人吗

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<ctime>
#include<iomanip>
#include<vector>
int a[1002][1002];
using namespace std;
void my_swap(int x1,int y1,int x2,int y2){
    int t=a[x1][y1];
    a[x1][y1]=a[x2][y2];
    a[x2][y2]=t;
}
int main(){
    int n,m,ans=0;
    vector<int>x,y;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>a[n][m];
        }
    }
    int t;
    cin>>t;
    int x1,y1,x2,y2;
    for(int i=1;i<=t;i++){
        cin>>x1>>y1>>x2>>y2;
        my_swap(x1,y1,x2,y2);
    }
    for(int i=1;i<=n;i++){//l
        for(int j=1;j<=m;j++){//c
            bool yes=0;
            
            if(a[i][j-1]<a[i][j]&&a[i][j+1]<a[i][j]&&a[i-1][j]<a[i][j]&&a[i+1][j])yes=1;

            if(yes==1){
                ans++;
                x.push_back(i+1);
                y.push_back(j+1);
            }
        }
    }
    cout<<ans<<'\n';
    for(int i=0;i<ans;i++){
        cout<<x[i]<<' '<<y[i]<<'\n';
    }
    return 0;
}