LightOJ 1080 - Binary Simulation （树状数组）

1080 - Binary Simulation

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 64 MB

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 i^th 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 ≤ 10⁵). 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 i^th bit.

Sample Input	Output for 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	Case 1: 0 1 1 0 Case 2: 0 0 0 1

Note

Dataset is huge, use faster i/o methods.

---

PROBLEM SETTER: JANE ALAM JAN

每次需要查找该点被更新了几次。用树状数组记录区间更新。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char s[1100000];
int n,bit[1100000];
int lowbit(int x)
{
	return x&(-x);
}
void add(int x,int val)
{
	while(x<=n)
	{
		bit[x]+=val;
		x+=lowbit(x);
	}
}
int sum(int x)
{
	int ans=0;
	while(x)
	{
		ans+=bit[x];
		x-=lowbit(x);
	}
	return ans;
}
void updata(int l,int r)
{
	add(l,1);
	add(r+1,-1);
}
int main()
{
	int t,i,j,m,a,b;
	char str[10];
	int cnt=1;
	scanf("%d",&t);
	while(t--)
	{
		memset(bit,0,sizeof(bit));
		scanf("%s",s);
		n=strlen(s);
		scanf("%d",&m);
		printf("Case %d:\n",cnt++);
		for(i=0;i<m;i++)
		{
			scanf("%s",str);
			if(str[0]=='I')
			{
				scanf("%d%d",&a,&b);
				updata(a,b);
			}
			else
			{
				scanf("%d",&a);
				if(sum(a)%2==0)
				{
					printf("%c\n",s[a-1]);
				}
				else
				{
					if(s[a-1]=='0')
					printf("1\n");
					else
					printf("0\n");
				}
			}
		}
	}
	return 0;
}