AcWing 5396. 棋盘
原题链接
简单
作者:
利巴嫩的香柏树
,
2024-04-11 12:02:20
,
所有人可见
,
阅读 1
#差分(每次加1)+奇偶性
n, m = map(int, input().split())
b= [[0] * (n + 2) for i in range(n + 2)]
def solve(b, x1, y1, x2, y2):
b[x1][y1] += 1
b[x1][y2 + 1] -= 1
b[x2 + 1][y1] -= 1
b[x2 + 1][y2 + 1] += 1
for _ in range(m):
x1, y1, x2, y2 = map(int, input().split())
solve(b, x1, y1, x2, y2)
print(b)
for i in range(1, n + 1):
for j in range(1, n + 1):
b[i][j] += b[i - 1][j] + b[i][j - 1] - b[i - 1][j - 1]
print(b[i][j] % 2, end='')
print('')