[CF551E] GukiZ and GukiZiana

CF551E
卧槽,lzh最爱的分块!卧槽,lzh最爱的分块!卧槽,lzh最爱的分块!卧槽,lzh最爱的分块!
维护懒标,散块重构。

unordered_map<long long,int>

会 TLE

unordered_map<long long,bool>

会 AC

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<queue>
#include<stack>
#include<algorithm>
#include<set>
#include<map>
#include<ctime>
#include<vector>
#include<bitset>
#include<cstdlib>
#include<set>
#include<chrono>
#include<random>
#include<unordered_map>
using namespace std;
#define db double
#define ll long long
#define ull unsigned long long
#define ld long double
#define MP make_pair
typedef pair<ll,int> kk;
const int MAXN=5e5+5;
const int N=710;
const int INF=0x3f3f3f3f;
void read(int &x){
	x=0;int f=1;char s=getchar();
	while(s<'0'||s>'9'){
		if(s=='-') f=-1;s=getchar();
	}
	while(s>='0'&&s<='9'){
		x=(x<<3)+(x<<1)+(s^48);s=getchar();
	}
	x*=f;
}
void read1(ll &x){
	x=0;int f=1;char s=getchar();
	while(s<'0'||s>'9'){
		if(s=='-') f=-1;s=getchar();
	}
	while(s>='0'&&s<='9'){
		x=(x<<3)+(x<<1)+(s^48);s=getchar();
	}
	x*=f;
}
int n,L[N],R[N],Q,len,wz[MAXN];
ll a[MAXN],tag[N];
unordered_map<ll,bool> s1[N];
int main(){
	read(n);read(Q);
	len=sqrt(n);
	for(int i=1;i<=len;i++){
		L[i]=R[i-1]+1;R[i]=L[i]+len-1;
	}
	if(len*len<n){
		len++;
		L[len]=R[len-1]+1;R[len]=n;
	}
	for(int i=1;i<=len;i++){
		for(int j=L[i];j<=R[i];j++){
			wz[j]=i;read1(a[j]);s1[i][a[j]]=1;
		}
	}
	int op,l,r;ll x;
	while(Q--){
		read(op);
		if(op==1){
			read(l);read(r);read1(x);
			int xl=wz[l],xr=wz[r];
			if(xl==xr){
				for(int i=L[xl];i<=R[xl];i++){
					s1[xl].erase(a[i]);
				}
				for(int i=L[xl];i<=R[xl];i++){
					a[i]+=tag[xl];
					if(i>=l&&i<=r) a[i]+=x;
					if(!s1[xl].count(a[i])) s1[xl][a[i]]=1;
				}
				tag[xl]=0;continue;
			}
			for(int i=L[xl];i<=R[xl];i++){
				s1[xl].erase(a[i]);
			}
			for(int i=L[xl];i<=R[xl];i++){
				a[i]+=tag[xl];
				if(i>=l&&i<=r) a[i]+=x;
				if(!s1[xl].count(a[i])) s1[xl][a[i]]=1;
			}
			tag[xl]=0;
			for(int i=L[xr];i<=R[xr];i++){
				s1[xr].erase(a[i]);
			}
			for(int i=L[xr];i<=R[xr];i++){
				a[i]+=tag[xr];
				if(i>=l&&i<=r) a[i]+=x;
				if(!s1[xr].count(a[i])) s1[xr][a[i]]=1;
			}
			tag[xr]=0;
			for(int i=xl+1;i<xr;i++) tag[i]+=x;
			continue;
		}
		read1(x);
		int w1=0,w2=0;
		for(int i=1;i<=len;i++){
			if(w1) break;
			if(tag[i]==0){
				if(s1[i].count(x)){
					for(int j=L[i];j<=R[i];j++){
						if(a[j]==x){
							w1=j;break;
						}
					}
				}
			}
			else{
				if(s1[i].count(x-tag[i])){
					for(int j=L[i];j<=R[i];j++){
						if(a[j]==x-tag[i]){
							w1=j;break;
						}
					}
				}
			}
		}
		for(int i=len;i>=1;i--){
			if(w2) break;
			if(tag[i]==0){
				if(s1[i].count(x)){
					for(int j=R[i];j>=L[i];j--){
						if(a[j]==x){
							w2=j;break;
						}
					}
				}
			}
			else{
				if(s1[i].count(x-tag[i])){
					for(int j=R[i];j>=L[i];j--){
						if(a[j]==x-tag[i]){
							w2=j;break;
						}
					}
				}
			}
		}
		if(!w1) printf("-1\n");
		else printf("%d\n",w2-w1);
	}
}