25.3.16刷题

P1007 魔法少女小Scarlet

https://www.luogu.com.cn/problem/p1007

题解

模拟，二维数组，临时数组存数据，行变成列

#include<bits/stdc++.h>
using namespace std;

const int N = 505;
int arr[N][N],f[N][N];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n, m; cin >> n >> m;
	
	int nums = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			arr[i][j] = ++nums;
		}
	}

	while (m--) {
		int x, y, r, z; cin >> x >> y >> r >> z;
		if (z == 0) {
			for (int i = x - r; i <= x + r; i++) {
				for (int j = y - r; j <= y + r; j++) {
					f[i][j] = arr[i][j];
				}
			}
			int x1 = x + r, y1 = y - r;
			for (int i = x - r; i <= x + r; i++) {
				for (int j = y - r; j <= y + r; j++) {
					arr[i][j] = f[x1][y1];
					x1--;
				}
				x1 = x + r, y1++;
			}
		}
		else {
			for (int i = x - r; i <= x + r; i++) {
				for (int j = y - r; j <= y + r; j++) {
					f[i][j] = arr[i][j];
				}
			}
			int x1 = x - r, y1 = y + r;
			for (int i = x - r; i <= x + r; i++) {
				for (int j = y - r; j <= y + r; j++) {
					arr[i][j] = f[x1][y1];
					x1++;
				}
				x1 = x - r, y1--;
			}

		}
	}

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			cout << arr[i][j] << ' ';
		}
		cout << endl;
	}

	return 0;
}