JZTXT

Luogu P3397 地毯

发布时间 2023-05-24 18:35:41作者: Gery_8002

题目描述

link

思路

直接暴力枚举，每次读入进行处理

Code

#include <iostream>
#include <cstdio>

using namespace std;

int n, m;
int map[1005][1005];

int main() {
	scanf("%d%d", &n, &m);
	for (int G = 1; G <= m; G++) {
		int x1, y1, x2, y2;
		scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
		for (int i = x1; i <= x2; i++)
			for (int j = y1; j <= y2; j++)
				map[i][j]++;
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++)  
			printf("%d ", map[i][j]);
		printf("\n");
	}
		return 0;
}