40pts求调

#include <bits/stdc++.h>
using namespace std;
const int H=1e5+10;
long long n,m,a[1010][1010],t,b[H],c[H],d[H],e[H],ans,shan1[H],shan2[H];
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>a[i][j];
		}
	}
	cin>>t;
	for(int i=1;i<=t;i++) cin>>b[i]>>c[i]>>d[i]>>e[i];
    if(t){
    	for(int i=1;i<=t;i++) swap(a[b[i]][c[i]],a[d[i]][e[i]]);
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(j==1&&i==1&&a[i+1][j]<a[i][j]&&a[i][j+1]<a[i][j]) {shan1[++ans]=i;shan2[ans]=j;}
			else if(j==m&&i==1&&a[i+1][j]<a[i][j]&&a[i][j-1]<a[i][j]) {shan1[++ans]=i;shan2[ans]=j;}
			else if(j==m&&i==n&&a[i-1][j]<a[i][j]&&a[i][j-1]<a[i][j]) {shan1[++ans]=i;shan2[ans]=j;}
			else if(j==1&&i==n&&a[i-1][j]<a[i][j]&&a[i][j+1]<a[i][j]) {shan1[++ans]=i;shan2[ans]=j;}
			else if(i==1&&a[i+1][j]<a[i][j]&&a[i][j-1]<a[i][j]&&a[i][j+1]<a[i][j]) {shan1[++ans]=i;shan2[ans]=j;}
			else if(i==n&&a[i-1][j]<a[i][j]&&a[i][j-1]<a[i][j]&&a[i][j+1]<a[i][j]) {shan1[++ans]=i;shan2[ans]=j;}
			else if(j==1&&a[i+1][j]<a[i][j]&&a[i-1][j]<a[i][j]&&a[i][j+1]<a[i][j]) {shan1[++ans]=i;shan2[ans]=j;}
			else if(j==m&&a[i+1][j]<a[i][j]&&a[i-1][j]<a[i][j]&&a[i][j-1]<a[i][j]) {shan1[++ans]=i;shan2[ans]=j;}
			else if(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]<a[i][j]) {shan1[++ans]=i;shan2[ans]=j;}
	    }
	}
	cout<<ans<<endl;
	for(int i=1;i<=ans;i++) cout<<shan1[i]<<" "<<shan2[i]<<endl;
	return 0;	
}