poj 2155 Matrix

最新推荐文章于 2019-07-17 16:03:33 发布

阿龙的圈子

最新推荐文章于 2019-07-17 16:03:33 发布

阅读量393

点赞数

分类专栏：树状数组文章标签： ACM

本文链接：https://blog.csdn.net/DoJintian/article/details/48862761

版权

树状数组专栏收录该内容

7 篇文章 0 订阅

订阅专栏

Matrix

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 21721		Accepted: 8120

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

Source

POJ Monthly,Lou Tiancheng

[Submit] [Go Back] [Status] [Discuss]

Home Page Go Back To top

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;
#define N 1000 + 10

int sum[N][N];

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

int n, q;

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

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

int main()
{
    int _T;
    scanf("%d", &_T);
    while(_T--)
    {
        for(int i = 0; i <= n; i++)
            for(int j = 0; j <= n; j++)
                sum[i][j] = 0;
        scanf("%d%d", &n, &q);
        int x1, x2, y1, y2;
        char op;
        while(q--)
        {
            scanf(" %c%d%d", &op, &x1, &y1);
            if(op == 'C')
            {
                scanf("%d%d", &x2, &y2);
                update(x1, y1);
                update(x1, y2 + 1);
                update(x2 + 1, y1);
                update(x2 + 1, y2 + 1);
            }
            else
            {
                printf("%d\n", get_sum(x1, y1) & 1);
            }
        }
        puts("");
    }
    return 0;
}