代码

# include <cstdio>
# include <iostream>
# include <bitset>

using namespace std;

const int MAX_N = 1e6 + 1000;

bitset<MAX_N> operator + (bitset<MAX_N> &x, bitset<MAX_N> &y)
{
	bitset<MAX_N> zz;
	
	int jin = 0;
	int i;
	for(i = 0; i < MAX_N; ++i)
	{
		int ps = x[i] + y[i] + jin;
		if(ps > 1)
		{
			zz[i] = ps - 2;
			jin = 1;
		}
		else
		{
			zz[i] = ps;
			jin = 0;
		}
	}
	return zz;
}

void add(bitset<MAX_N> &x, bitset<30> y, int z)
{
	int jin = 0;
	int i;
	for(i = 0; i < 30; ++i)
	{
		int ps = x[i + z] + y[i] + jin;
		if(ps > 1)
		{
			x[i + z] = ps - 2;
			jin = 1;
		}
		else
		{
			x[i + z] = ps;
			jin = 0;
		}
	}
}

bitset<MAX_N> operator + (bitset<MAX_N>& x, size_t z)
{
	bitset<MAX_N> y(z);
	return x + y;
}

//ostream & operator << (ostream &os, bitset<MAX_N> x)
//{
//	int res;
//	for(i = 0; i < MAX_N; ++i)
//	{
//		if(x[i])
//			res = i;
//	}
//	
//	for(i = 0; i < )
//}

bitset<MAX_N> x;

int main()
{
	int N, ttt, yy, uu;
	scanf("%d %d %d %d", &N, &ttt, &yy, &uu);
	
	while(N--)
	{
		int op, a, b;
		scanf("%d", &op);
		if(op == 1)
		{
			scanf("%d %d", &a, &b);
			bitset<30> y(a);
			add(x, y, b);
		}
		else
		{
			scanf("%d", &a);
			cout << x[a] << "\n";
		}
	}
	
	return 0;
}

评测结果