空间这么小…然后就莫队了(不知道三维kd-tree能不能过)
本来想打BIT,结果发现过不了的样子,因为修改比较多,询问比较少,所以可以考虑平衡复杂度,用分块维护(单次修改O(1),询问O(
n√
))
code:
#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<complex>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
void read(int &x)
{
char c;
while(!((c=getchar())>='0'&&c<='9'));
x=c-'0';
while((c=getchar())>='0'&&c<='9') x=(x<<3)+(x<<1)+c-'0';
}
const int maxn = 101000;
const int maxm = 1001000;
struct qu
{
int a,b,l,r,id;
}q[maxm]; int ans[maxm];
int n,m,val[maxn];
int id[maxn],L[maxn],N;
int s[maxn];
bool cmp(qu x,qu y){return id[x.l]==id[y.l]?x.r<y.r:id[x.l]<id[y.l];}
int v[maxn];
void solve()
{
int l=1,r=0;
int j=1;
for(int i=1;i<=id[n];i++)
{
while(id[q[j].l]==i&&j<=m)
{
while(r<q[j].r) { r++;if(!v[val[r]])s[id[val[r]]]++; v[val[r]]++; }
while(l>q[j].l) { l--;if(!v[val[l]])s[id[val[l]]]++; v[val[l]]++; }
while(r>q[j].r) { if(v[val[r]]==1)s[id[val[r]]]--;v[val[r]]--;r--; }
while(l<q[j].l) { if(v[val[l]]==1)s[id[val[l]]]--;v[val[l]]--;l++; }
int re=0;
int fl=id[q[j].a],fr=id[q[j].b];
if(fl==fr)
{
for(int k=q[j].a;k<=q[j].b;k++)
if(v[k]) re++;
}
else
{
for(int k=q[j].a;k<L[fl+1];k++)
if(v[k]) re++;
for(int k=fl+1;k<fr;k++) re+=s[k];
for(int k=L[fr];k<=q[j].b;k++)
if(v[k]) re++;
}
ans[q[j].id]=re;
j++;
}
}
}
int main()
{
read(n); read(m); N=sqrt(n);
for(int i=1;i<=n;i++) id[i]=(i-1)/N+1;
for(int i=1;i<=id[n];i++) L[i]=(i-1)*N+1;
L[id[n]+1]=n+1;
for(int i=1;i<=n;i++) read(val[i]);
for(int i=1;i<=m;i++)
{
int a,b,x,y;
read(x); read(y); read(a); read(b);
q[i].a=a;q[i].b=b;
q[i].l=x;q[i].r=y;
q[i].id=i;
}
sort(q+1,q+m+1,cmp);
solve();
for(int i=1;i<=m;i++) printf("%d\n",ans[i]);
return 0;
}