矩阵求逆,在线的异或是上一次答案,不是异或和。
#include<bits/stdc++.h>
#define cs const
#define re register
cs int N=1e6+10,mod=998244353;
int a[N],ans,n,m,type,op,l,r;
inline int gi(){
int x=0;char ch=getchar();
while(!isdigit(ch)) ch=getchar();
while(isdigit(ch)) x=x*10+ch-'0',ch=getchar();
return x;
}
inline int decode(){return type?gi()^ans:gi();}
inline int add(int x,int y){return x+y>=mod?x+y-mod:x+y;}
inline int dec(int x,int y){return x-y<0?x-y+mod:x-y;}
inline int mul(int x,int y){return 1ll*x*y%mod;}
inline void print(int x){if(x>9) print(x/10);putchar(x%10+'0');}
struct matrix{
int a[2][2];
matrix(){memset(a,0,sizeof(a));}
inline void init(int x){a[0][0]=x,a[0][1]=a[1][0]=1,a[1][1]=0;}
inline void I_init(int x){a[0][0]=0,a[0][1]=a[1][0]=1,a[1][1]=mod-x;}
}I[N],f[N],now;
inline matrix operator*(cs matrix &a,cs matrix &b){
matrix c;
for(int i=0;i<2;++i)
for(int k=0;k<2;++k)
for(int j=0;j<2;++j)
c.a[i][j]=add(c.a[i][j],mul(a.a[i][k],b.a[k][j]));
return c;
}
signed main(){
n=gi(),m=gi(),type=gi(),f[0].a[0][0]=f[0].a[1][1]=1,I[0].a[0][0]=I[0].a[1][1]=1;
for(int i=1;i<=n;++i) a[i]=gi(),f[i].init(a[i]),I[i].I_init(a[i]),f[i]=f[i-1]*f[i],I[i]=I[i]*I[i-1];
while(m--){
op=gi();
if(op==1) a[++n]=decode(),f[n].init(a[n]),I[n].I_init(a[n]),f[n]=f[n-1]*f[n],I[n]=I[n]*I[n-1];
if(op==2){
l=decode(),r=decode(),now=I[l-1]*f[r];int p=now.a[0][0],q=now.a[1][0];
ans=(p^q),print(p),putchar(' '),print(q),putchar('\n');
}
}
}