0分求调,TLE
查看原帖
0分求调,TLE
1036940
bjqxszx_wangyiheng楼主2024/1/25 15:51
#include<iostream>
#include<cmath>
using namespace std;
int a[1005][1005], x[1000005], y[1000005];
int main(){
	int n, m, t, cnt = 0, x1, y1, x2, y2;
	cin >> n >> m;
	for(int i = 1; i <= n; i ++)
		for(int j = 1; j <= m; j ++)
			scanf("%d", &a[i][j]);
	
	cin >> t;
	for(int i = 1; i <= t; i ++)
	{
		scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
		swap(a[x1][y1],a[x2][y2]);
	}
	
	for(int i = 1; i <= n; i ++)
		for(int j = 1; j <= m; j ++)
			if(a[i][j] > a[i][j--] && a[i][j] > a[i--][j] && a[i][j] > a[i][j++] && a[i][j] > a[i++][j])
			{
				cnt ++;
				x[cnt] = i;
				y[cnt] = j;
			}
	
	cout << cnt << "\n";
	for(int i = 1; i <= cnt; i ++)
		cout << x[i] << ' ' << y[i] << "\n";
	return 0;
}

谢谢

2024/1/25 15:51
加载中...