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
| #include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int maxn=100100; const int modp=571373;
int n,m; int a[maxn];
namespace sgt{ struct segment_tree{ int l,r,multag,addtag; int sum; }t[maxn<<2]; #define lson i<<1,l,mid #define rson i<<1|1,mid+1,r #define ls (i<<1) #define rs (i<<1|1) void pushup(int i) { t[i].sum=(t[ls].sum+t[rs].sum)%modp; } void pushdown(int i) { t[ls].addtag=(1ll*t[ls].addtag*t[i].multag+t[i].addtag)%modp; t[rs].addtag=(1ll*t[rs].addtag*t[i].multag+t[i].addtag)%modp; t[ls].multag=(1ll*t[i].multag*t[ls].multag)%modp; t[rs].multag=(1ll*t[i].multag*t[rs].multag)%modp; t[ls].sum=(1ll*t[ls].sum*t[i].multag%modp+1ll*t[i].addtag*(t[ls].r-t[ls].l+1))%modp; t[rs].sum=(1ll*t[rs].sum*t[i].multag%modp+1ll*t[i].addtag*(t[rs].r-t[rs].l+1))%modp; t[i].addtag=0; t[i].multag=1; } void build_tree(int i,int l,int r) { t[i].l=l; t[i].r=r; t[i].multag=1; if(l==r) { t[i].sum=a[l]; t[i].multag=1; return ; } int mid=(l+r)>>1; build_tree(lson); build_tree(rson); pushup(i); } void change_mul_tree(int i,int l,int r,int x,int y,int k) { if(l!=r) pushdown(i); if(l>=x&&r<=y) { t[i].sum=(1ll*t[i].sum*k)%modp; t[i].multag=k%modp; return ; } pushdown(i); int mid=(l+r)>>1; if(x<=mid) change_mul_tree(lson,x,y,k); if(y>mid) change_mul_tree(rson,x,y,k); pushup(i); } void change_add_tree(int i,int l,int r,int x,int y,int k) { if(l!=r) pushdown(i); if(l>=x&&r<=y) { t[i].sum=(1ll*t[i].sum+1ll*k*(r-l+1))%modp; t[i].addtag=k%modp; return ; } pushdown(i); int mid=(l+r)>>1; if(x<=mid) change_add_tree(lson,x,y,k); if(y>mid) change_add_tree(rson,x,y,k); pushup(i); } int query_tree(int i,int l,int r,int x,int y) { int ans=0; if(l>=x&&r<=y) { return t[i].sum; } pushdown(i); int mid=(l+r)>>1; if(x<=mid) ans=(ans+query_tree(lson,x,y))%modp; if(y>mid) ans=(ans+query_tree(rson,x,y))%modp; return ans; } }
int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tmp; cin>>n>>m>>tmp; for(int i=1;i<=n;i++) cin>>a[i]; sgt::build_tree(1,1,n); for(int i=1;i<=m;i++) { int opt,t1,t2,t3; cin>>opt; if(opt==1) { cin>>t1>>t2>>t3; sgt::change_mul_tree(1,1,n,t1,t2,t3); } if(opt==2) { cin>>t1>>t2>>t3; sgt::change_add_tree(1,1,n,t1,t2,t3); } if(opt==3) { cin>>t1>>t2; cout<<sgt::query_tree(1,1,n,t1,t2)<<endl; } } return 0; }
|