【Lightoj 1080 Binary Simulation + 树状数组】

Binary Simulation

Description
Given a binary number, we are about to do some operations on the number. Two types of operations can be here.

‘I i j’ which means invert the bit from i to j (inclusive)
‘Q i’ answer whether the ith bit is 0 or 1

The MSB (most significant bit) is the first bit (i.e. i=1). The binary number can contain leading zeroes.

Input
Input starts with an integer T (≤ 10), denoting the number of test cases.

Each case starts with a line containing a binary integer having length n (1 ≤ n ≤ 105). The next line will contain an integer q (1 ≤ q ≤ 50000) denoting the number of queries. Each query will be either in the form ‘I i j’ where i, j are integers and 1 ≤ i ≤ j ≤ n. Or the query will be in the form ‘Q i’ where i is an integer and 1 ≤ i ≤ n.

Output
For each case, print the case number in a single line. Then for each query ‘Q i’ you have to print 1 or 0 depending on the ith bit.

Sample Input
2
0011001100
6
I 1 10
I 2 7
Q 2
Q 1
Q 7
Q 5
1011110111
6
I 1 10
I 2 7
Q 2
Q 1
Q 7
Q 5
Sample Output
Case 1:
0
1
1
0
Case 2:
0
0
0
1
Hint
Dataset is huge, use faster i/o methods.

Problem Setter: Jane Alam Jan
Developed and Maintained by
JANE ALAM JAN
Copyright © 2012
LightOJ, Jane Alam Jan

#include<cstdio>
#include<cstring>
int pa[100011],pl;
char st[100011],ch[3];
int lowbit(int x)
{
    return x & (-x);
}
void inset(int x,int y)
{
    while(x <= pl){
        pa[x] += y;
        x += lowbit(x);
    }
}
int query(int x)
{
    int ans = 0;
    while(x){
        ans += pa[x];
        x -= lowbit(x);
    }
    return ans;
}
int main()
{
    int T,nl = 0,N,a,b;
    scanf("%d",&T);
    while(T--)
    {
        memset(pa,0,sizeof(pa));
        st[0] = '2';
        scanf("%s",st + 1);
        pl = strlen(st + 1);
        scanf("%d",&N);
        printf("Case %d:\n",++nl);
        while(N--)
        {
            scanf("%s",ch);
            if(ch[0] == 'I'){
                scanf("%d%d",&a,&b);
                inset(a,1);
                inset(b+1,-1);
            }
            else{
                scanf("%d",&a);
                int ml = query(a);
                if(ml %2 == 1){
                    if(st[a] == '1') // 如果变得次数是奇数次
                        printf("0\n");
                    else
                        printf("1\n");
                }
                else
                    printf("%c\n",st[a]); // 如果变得次数是偶数次
            }
        }
    }
    return 0;
}