POJ 2155 Matrix （二维树状数组）

最新推荐文章于 2018-08-29 09:05:48 发布

Southan97

最新推荐文章于 2018-08-29 09:05:48 发布

阅读量357

点赞数

分类专栏： Binary Index Tree 文章标签： BIT 二维树状数组

本文链接：https://blog.csdn.net/mrx_nh/article/details/73501205

版权

Binary Index Tree 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Matrix

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 27811		Accepted: 10153

Description

Given an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th column. Initially we have A[i, j] = 0 (1 <= i, j <= N).

We can change the matrix in the following way. Given a rectangle whose upper-left corner is (x1, y1) and lower-right corner is (x2, y2), we change all the elements in the rectangle by using "not" operation (if it is a '0' then change it into '1' otherwise change it into '0'). To maintain the information of the matrix, you are asked to write a program to receive and execute two kinds of instructions.

1. C x1 y1 x2 y2 (1 <= x1 <= x2 <= n, 1 <= y1 <= y2 <= n) changes the matrix by using the rectangle whose upper-left corner is (x1, y1) and lower-right corner is (x2, y2).
2. Q x y (1 <= x, y <= n) querys A[x, y].

Input

The first line of the input is an integer X (X <= 10) representing the number of test cases. The following X blocks each represents a test case.

The first line of each block contains two numbers N and T (2 <= N <= 1000, 1 <= T <= 50000) representing the size of the matrix and the number of the instructions. The following T lines each represents an instruction having the format "Q x y" or "C x1 y1 x2 y2", which has been described above.

Output

For each querying output one line, which has an integer representing A[x, y].

There is a blank line between every two continuous test cases.

Sample Input

Sample Output

二维树状数组和一维树状数组非常相似，相当于一维树状数组的每一个节点就是一个一维树状数组，本题只要判断出每个坐标的修改次数就最后模2就是结果了。

参考自：http://www.geeksforgeeks.org/two-dimensional-binary-indexed-tree-or-fenwick-tree/

注意这里的矩阵对角线和本题的区别，本题为反对角线。

//#include <bits/stdc++.h>
#include <iostream>
#include <cstring>
#include <cstdio> 

using namespace std;

const int MAXN = 1024;

int n;
int c[MAXN][MAXN]; 

inline int lowbit(int x) {
  return x & (-x);
}

int sum(int x, int y) {
  int sum = 0;
  for(int i = x; i > 0; i -= lowbit(i)) {
    for(int j = y; j > 0; j -= lowbit(j)) {
      sum += c[i][j];  
    }
  }
  return sum;
}

void update(int x, int y, int val) {
  for(int i = x; i <= n; i += lowbit(i)) {
    for(int j = y; j <= n; j += lowbit(j)) {
      c[i][j] += val;
    }
  }
}

int main() {
   int T;
   scanf("%d", &T);
   while(T--) {
     int t;
     scanf("%d%d", &n, &t);
     memset(c, 0, sizeof(c));
     while(t--) {
       char op;
       scanf(" %c", &op);
       int x1, y1, x2, y2;
       if(op == 'C') {
         scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
         update(x1, y1, 1);
       	 update(x2 + 1, y1, -1);
         update(x1, y2 + 1, -1);		
         update(x2 + 1, y2 + 1, 1);
       } else {
         scanf("%d%d", &x1, &y1);
         printf("%d\n", sum(x1, y1) % 2);
       }               
     }
     puts("");
   }
   return 0;
}