Paint The Wall hdu4391

分块思想, 分段hash

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <cctype>
#include <utility>   
#include <map>
#include <string>  
#include <climits> 
#include <set>
#include <string>    
#include <sstream>
#include <utility>   
#include <ctime>
#include <bitset>
//#pragma comment(linker, "/STACK:102400000,102400000")

using std::priority_queue;
using std::vector;
using std::swap;
using std::stack;
using std::sort;
using std::max;
using std::min;
using std::pair;
using std::map;
using std::string;
using std::cin;
using std::cout;
using std::set;
using std::queue;
using std::string;
using std::stringstream;
using std::make_pair;
using std::getline;
using std::greater;
using std::endl;
using std::multimap;
using std::deque;
using std::unique;
using std::lower_bound;
using std::random_shuffle;
using std::bitset;
using std::upper_bound;
using std::multiset;

typedef long long LL;
typedef unsigned long long ULL;
typedef unsigned UN;
typedef pair<int, int> PAIR;
typedef multimap<int, int> MMAP;
typedef LL TY;
typedef long double LF;

const int MAXN(1500010);
const int MAXM(50010);
const int MAXE(150010);
const int MAXK(6);
const int HSIZE(1313);
const int SIGMA_SIZE(4);
const int MAXH(20);
const int INFI((INT_MAX-1) >> 1);
const ULL BASE(31);
const LL LIM(1e13);
const int INV(-10000);
const int MOD(31313);
const double EPS(1e-7);
const LF PI(acos(-1.0));

template<typename T> inline void checkmax(T &a, T b){if(b > a) a = b;}
template<typename T> inline void checkmin(T &a, T b){if(b < a) a = b;}
template<typename T> inline T ABS(const T &a){return a < 0? -a: a;}

struct HASH_MAP
{
	int head[HSIZE];
	int state[510], value[510], next[510];
	int size;
	void init()
	{
		memset(head, -1, sizeof(head));
		size = 0;
	}
	void insert(int st, int va)
	{
		int h = st%HSIZE;
		for(int i = head[h]; ~i; i = next[i])
			if(state[i] == st)
			{
				value[i] += va;
				return;
			}
		state[size] = st;
		value[size] = va;
		next[size] = head[h];
		head[h] = size++; 
	}
	int query(int st)
	{
		int h = st%HSIZE;
		for(int i = head[h]; ~i; i = next[i])
			if(state[i] == st) return value[i];
		return 0;
	}
};

int flag[510], num[510];
HASH_MAP hm[510];
int c[100010];
int n, tn;

void push_down(int bc)
{
	if(flag[bc] != -1)
	{
		int temp = min(n, (bc+1)*tn);
		for(int i = bc*tn; i < temp; ++i) c[i] = flag[bc];
		hm[bc].init();
		hm[bc].insert(flag[bc], num[bc]);
		flag[bc] = -1;
	}
}

int main()
{
	int m;
	while(~scanf("%d%d", &n, &m))
	{
		for(int i = 0; i < n; ++i) scanf("%d", c+i);
		tn = sqrt((double)n)+0.5;
		int bc = 0;
		for(int i = 0; i < n; i += tn)
		{
			flag[bc] = -1;
			hm[bc].init();
			num[bc] = 0;
			for(int ti = i, j = 0; ti < n && j < tn; ++ti, ++j)
			{
				hm[bc].insert(c[ti], 1);
				++num[bc];
			}
			++bc;
		}
		int a, l, r, z;
		for(int i = 0; i < m; ++i)
		{
			scanf("%d%d%d%d", &a, &l, &r, &z);
			if(a == 1)
			{
				int lb = l/tn, rb = r/tn;
				push_down(lb);
				if(lb == rb)
				{
					for(int j = l; j <= r; ++j)
					{
						hm[lb].insert(c[j], -1);
						c[j] = z;
						hm[lb].insert(z, 1);
					}
				}
				else
				{
					int temp = (lb+1)*tn;
					for(int j = l; j < temp; ++j)
					{
						hm[lb].insert(c[j], -1);
						c[j] = z;
						hm[lb].insert(z, 1);
					}
					for(int j = lb+1; j < rb; ++j) flag[j] = z;
					push_down(rb);
					for(int j = rb*tn; j <= r; ++j)
					{
						hm[rb].insert(c[j], -1);
						c[j] = z;
						hm[rb].insert(z, 1);
					}
				}
			}
			else
			{
				int lb = l/tn, rb = r/tn;
				int ans = 0;
				push_down(lb);
				if(lb == rb)
				{
					for(int j = l; j <= r; ++j)
						if(c[j] == z) ++ans;
				}
				else
				{
					int temp = (lb+1)*tn;
					for(int j = l; j < temp; ++j)
						if(c[j] == z) ++ans;
					for(int j = lb+1; j < rb; ++j)
						if(flag[j] == -1) ans += hm[j].query(z);
						else if(flag[j] == z) ans += num[j];
					push_down(rb);
					for(int j = rb*tn; j <= r; ++j)
						if(c[j] == z) ++ans;
				}
				printf("%d\n", ans);
			}
		}
	}
	return 0;
}