AcWing 5396. 棋盘
原题链接
简单
作者:
木可柯
,
2024-03-17 23:42:23
,
所有人可见
,
阅读 6
简单的二维差分,希望考试能出现这种题
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 2010;
int a[N][N], b[N][N];
void insert(int x1, int y1, int x2, int y2, int c)
{
b[x1][y1] += c;
b[x1][y2 + 1] -=c;
b[x2 + 1][y1] -= c;
b[x2 + 1][y2 + 1] += c;
}
int main()
{
int n, m;
cin >> n >> m;
while(m--) {
int x1, y1, x2, y2, x = 1;
cin >> x1 >> y1 >> x2 >> y2;
insert(x1, y1, x2, y2, x);
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
b[i][j] += b[i - 1][j] + b[i][j - 1] - b[i - 1][j - 1];
cout << (b[i][j] % 2 == 0 ? 0 : 1);
}
cout << endl;
}
return 0;
}