1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138
| #include<cmath> #include<vector> #include<cstdio> #include<cstring> #include<algorithm> using namespace std;
const int N=3e4;
int n,m,Vper,Nl,Nr,Vmod,Vlim; int Ia[N+3],Ecnt[N+3],Eans[N+3]; vector<int> Sra; struct QUERY{int Cl,Cr,id;}qry[N+3]; struct MATRIX{ int Vrol,Vcol; int Emat[3][3]; MATRIX operator *(const MATRIX &B)const &{ MATRIX Rr; Rr.Vrol=Vrol;Rr.Vcol=B.Vcol; for(int i=1;i<=Rr.Vrol;i++) for(int j=1;j<=Rr.Vcol;j++){ Rr.Emat[i][j]=0; for(int k=1;k<=Vcol;k++){ Rr.Emat[i][j]+=1ll*Emat[i][k]*B.Emat[k][j]%Vmod; if(Rr.Emat[i][j]>=Vmod) Rr.Emat[i][j]-=Vmod; } } return Rr; } MATRIX operator +(const MATRIX &B)const &{ MATRIX Rr; Rr.Vrol=Vrol;Rr.Vcol=Vcol; for(int i=1;i<=Rr.Vrol;i++) for(int j=1;j<=Rr.Vcol;j++){ Rr.Emat[i][j]=Emat[i][j]+B.Emat[i][j]; if(Rr.Emat[i][j]>=Vmod) Rr.Emat[i][j]-=Vmod; } return Rr; } }Mper,Mfeb[N+3]; struct SEGTREE{ int Tnum[N*4]; MATRIX Tmat[N*4]; inline void PushUp(int u){ Tnum[u]=Tnum[u<<1]+Tnum[u<<1|1]; Tmat[u]=Tmat[u<<1]+Mfeb[Tnum[u<<1]]*Tmat[u<<1|1]; } inline void Build(register int u,register int Vl,register int Vr){ Tmat[u].Vcol=1;Tmat[u].Vrol=2; if(Vl==Vr) return; register int Vm=(Vl+Vr)>>1; Build(u<<1,Vl,Vm); Build(u<<1|1,Vm+1,Vr); } inline void Modify(register int u,register int Vl,register int Vr,register int Upos,register int Utmp){ if(Vl==Vr){ Tmat[u].Emat[1][1]=(Utmp*Sra[Vl-1]%Vmod+Vmod)%Vmod; Tmat[u].Emat[2][1]=0; Tnum[u]=Utmp; return; } register int Vm=(Vl+Vr)>>1; if(Upos<=Vm) Modify(u<<1,Vl,Vm,Upos,Utmp); else Modify(u<<1|1,Vm+1,Vr,Upos,Utmp); PushUp(u); } }seg;
inline bool cmpQUERY(const QUERY Ca,const QUERY Cb){ register int Ba=Ca.Cl/Vper,Bb=Cb.Cl/Vper; if(Ba==Bb) if(Ba&1) return Ca.Cr<Cb.Cr; else return Ca.Cr>Cb.Cr; else return Ca.Cl<Cb.Cl; } inline void NAdd(register int Vv){ Ecnt[Ia[Vv]]++; if(Ecnt[Ia[Vv]]==1) seg.Modify(1,1,Vlim,Ia[Vv],1); } inline void NDelete(register int Vv){ Ecnt[Ia[Vv]]--; if(Ecnt[Ia[Vv]]==0) seg.Modify(1,1,Vlim,Ia[Vv],0); } void Process(){ Mper.Vcol=Mper.Vrol=2; Mper.Emat[1][1]=1;Mper.Emat[1][2]=1; Mper.Emat[2][1]=1;Mper.Emat[2][2]=0; Mfeb[0].Vcol=Mfeb[0].Vrol=2; Mfeb[0].Emat[1][1]=1;Mfeb[0].Emat[1][2]=0; Mfeb[0].Emat[2][1]=0;Mfeb[0].Emat[2][2]=1; for(register int i=1;i<=n;i++) Mfeb[i]=Mfeb[i-1]*Mper; } inline int fRead(){ register int Vx=0;char Cc=getchar(); while(Cc<'0' || '9'<Cc) Cc=getchar(); while('0'<=Cc && Cc<='9') Vx=(Vx<<3)+(Vx<<1)+Cc-'0',Cc=getchar(); return Vx; } int main(){ n=fRead();Vmod=fRead(); Process(); for(register int i=1;i<=n;i++){ Ia[i]=fRead(); Sra.push_back(Ia[i]); } m=fRead(); for(register int i=1;i<=m;i++){ qry[i].Cl=fRead();qry[i].Cr=fRead(); qry[i].id=i; } sort(Sra.begin(),Sra.end()); Sra.erase(unique(Sra.begin(),Sra.end()),Sra.end()); for(register int i=1;i<=n;i++) Ia[i]=lower_bound(Sra.begin(),Sra.end(),Ia[i])-Sra.begin()+1; Vper=ceil(sqrt(n)); sort(qry+1,qry+1+m,cmpQUERY); Vlim=Sra.size(); seg.Build(1,1,Vlim); Nl=1; for(register int i=1;i<=m;i++){ while(Nr<qry[i].Cr) NAdd(++Nr); while(Nr>qry[i].Cr) NDelete(Nr--); while(Nl<qry[i].Cl) NDelete(Nl++); while(Nl>qry[i].Cl) NAdd(--Nl); Eans[qry[i].id]=seg.Tmat[1].Emat[1][1]; } for(register int i=1;i<=m;i++) printf("%d\n",Eans[i]); return 0; }
|