POJ 2155 Matrix 【树状数组 更新区间 求点】
来源:互联网 发布:淘宝上几十块的人参 编辑:程序博客网 时间:2024/06/06 01:06
Matrix
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 22105 Accepted: 8243
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].
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.
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.
There is a blank line between every two continuous test cases.
Sample Input
12 10C 2 1 2 2Q 2 2C 2 1 2 1Q 1 1C 1 1 2 1C 1 2 1 2C 1 1 2 2Q 1 1C 1 1 2 1Q 2 1
Sample Output
1001
恩,题目大意就是说,矩阵开始时全为零,然后 C x1 y1 x2 y2 表示以 x1 y1 和 x2 y2 为对角的矩形中的值都改变一次,若原为0改为1 若原为1改为0 。恩,至于修改时这里概率论里的某一点貌似有点相似,本来是从 x1 y1 到n n 的加1 然后从 x2+1 y1 到n n 的减1 由于这里只需判断奇偶数,所以减1相当于加1
#include <iostream>#include<cstdio>#include<cstring>#define maxn 1010using namespace std;int n,c[maxn][maxn];int lowbit(int t){ return t&(t^(t-1));}void update(int x,int y){ for(int i=x;i<=n;i+=lowbit(i)) { for(int j=y;j<=n;j+=lowbit(j)) c[i][j]++; }}int sum(int x,int y){ int ans=0; for(int i=x;i>0;i-=lowbit(i)) { for(int j=y;j>0;j-=lowbit(j)) ans+=c[i][j]; } return ans;}int main(){ int t,q,x1,x2,y1,y2; char s[5]; scanf("%d",&t); while(t--) { memset(c,0,sizeof(c)); scanf("%d%d",&n,&q); while(q--) { scanf("%s",s); if(s[0]=='C') { scanf("%d%d%d%d",&x1,&y1,&x2,&y2); update(x1,y1); update(x2+1,y1); update(x1,y2+1); update(x2+1,y2+1); } else { scanf("%d%d",&x1,&y1); printf("%d\n",sum(x1,y1)%2); } } printf("\n"); } return 0;}
0 0
- POJ 2155 Matrix 【树状数组 更新区间 求点】
- POJ 2155 Matrix (树状数组,区间更新转成点更新)
- POJ 2155 Matrix (二维树状数组,区间更新,点查找)
- poj 2155 Matrix 树状数组 区间更新单点求值
- POJ 2155 - Matrix 二维树状数组..区间更新..单点查询
- POJ 2155 Matrix 二维树状数组 区间更新,单点查询
- POJ 2155 Matrix(二维树状数组+数组数组区间更新+单点查询)
- 01变换 二维树状数组+区间更新,单点查询 poj 2155 Matrix
- POJ 2155 Matrix(二维树状数组+区间更新单点求和)
- POJ - 2155 Matrix (二维树状数组 + 区间修改 + 单点求值 或者 二维线段树 + 区间更新 + 单点求值)
- 树状数组点更新,区间更新理解
- 树状数组--改区间求点
- POJ 2155 Matrix(树状数组+单点更新)
- poj 2155 二维树状数组/区间更新单点查询
- POJ 2155 Matrix 树状数组
- 【树状数组】 POJ 2155 Matrix
- 【树状数组】POJ 2155 Matrix
- [树状数组] poj 2155 Matrix
- 机器学习:用初等数学解读逻辑回归
- 一个在线显示doc文本的实例
- appium简明教程(1)——appium和它的哲学世界
- Oracle之常用FAQ--SQL
- Android SwipeRefreshLayout:谷歌官方SDK包中的下拉刷新类似QQ的下拉刷新一样的
- POJ 2155 Matrix 【树状数组 更新区间 求点】
- 浅析Android系统中的Activity启动过程
- Oracle之常用FAQ--性能调整
- You've implemented -[<UIApplicationDelegate> application:didReceiveRemoteNotification:fetchCompletio
- Git,SoureTree密钥SSH的生成
- libxml2库解析xml文档举例
- 资源依赖 appt -I android.jar -I xxx.apk
- Linux内核中ioremap映射的透彻理解
- Junit基础学习