HDU5634 Rikka with Phi 线段树

// HDU5634 Rikka with Phi 线段树
// 思路：操作1的时候，判断一下当前区间是不是每个数都相等，在每个数相等的区间上操作。相当于lazy，不必更新到底。


#include <bits/stdc++.h>
using namespace std;
#define clc(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
const int N = 300010; 
const int MOD = 1e9+7;
#define LL long long
double const pi = acos(-1);
void fre() {
    freopen("in.txt","r",stdin);
}
// inline int r() {
//     int x=0,f=1;char ch=getchar();
//     while(ch>'9'||ch<'0') {if(ch=='-') f=-1;ch=getchar();}
//     while(ch>='0'&&ch<='9') { x=x*10+ch-'0';ch=getchar();}return x*f;
// }
const int MAXM=1e7+10;
LL euler[10000010];
int a[N];
void Geteuler()  
{  
    memset(euler, 0, sizeof(euler));  
    euler[1] = 1;  
    for(LL i = 2; i < MAXM; i++) if(!euler[i])  
        for(LL j = i; j < MAXM; j += i){  
            if(!euler[j]) euler[j] = j;  
            euler[j] = euler[j] / i * (i-1);  
        }  
}

struct tree{
    int l,r;
    LL sum,lazy;
}t[N<<2];

void pushup(int rt){
    t[rt].sum=t[rt<<1].sum+t[rt<<1|1].sum;
    if(t[rt<<1].lazy==t[rt<<1|1].lazy) t[rt].lazy=t[rt<<1].lazy;
    else t[rt].lazy=0;
}

void pushdown(int rt){
    if(t[rt].lazy){
        t[rt<<1].lazy=t[rt<<1|1].lazy=t[rt].lazy;
        t[rt<<1].sum=(t[rt<<1].r-t[rt<<1].l+1)*t[rt<<1].lazy;
        t[rt<<1|1].sum=(t[rt<<1|1].r-t[rt<<1|1].l+1)*t[rt<<1|1].lazy;
        t[rt].lazy=0;
    }
}
void build(int rt,int x,int y){
    t[rt].l=x;
    t[rt].r=y;
    if(x==y){
        t[rt].sum=a[x];
        t[rt].lazy=a[x];
        return;
    }
    int mid=(x+y)>>1;
    build(rt<<1,x,mid);
    build(rt<<1|1,mid+1,y);
    pushup(rt);
}

void update1(int rt,int x,int y){
    if(t[rt].lazy&&t[rt].l==x&&t[rt].r==y){
        t[rt].sum=(t[rt].r-t[rt].l+1)*euler[t[rt].lazy];
        t[rt].lazy=euler[t[rt].lazy];
        return;
    }
    pushdown(rt);
    int mid=(t[rt].l+t[rt].r)>>1;
    if(y<=mid) update1(rt<<1,x,y);
    else if(x>mid) update1(rt<<1|1,x,y);
    else {
        update1(rt<<1,x,mid);
        update1(rt<<1|1,mid+1,y);
    }
    pushup(rt);
}

void update2(int rt,int x,int y,int z){
    if(t[rt].l==x&&t[rt].r==y){
        t[rt].lazy=z;
        t[rt].sum=1LL*z*(t[rt].r-t[rt].l+1);
        return;
    }
    pushdown(rt);
    int mid=(t[rt].l+t[rt].r)>>1;
    if(y<=mid) update2(rt<<1,x,y,z);
    else if(x>mid) update2(rt<<1|1,x,y,z);
    else {
        update2(rt<<1,x,mid,z);
        update2(rt<<1|1,mid+1,y,z);
    }
    pushup(rt);
}

LL  query(int rt,int x,int y){
    if(t[rt].l==x&&t[rt].r==y){
        return t[rt].sum;
    }
    pushdown(rt);
    int mid=(t[rt].l+t[rt].r)>>1;
    if(y<=mid) return query(rt<<1,x,y);
    else if(x>mid) return query(rt<<1|1,x,y);
    else{
        return query(rt<<1,x,mid)+query(rt<<1|1,mid+1,y);
    }
}
int main(){
    // fre();
    Geteuler(); 
    int T;
    scanf("%d",&T);
    while(T--){
        int n,m;
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++) scanf("%d",&a[i]);
        build(1,1,n);
        while(m--){
            int op,x,y,z;
            scanf("%d%d%d",&op,&x,&y);
            if(op==1) update1(1,x,y);
            else if(op==2) {
                scanf("%d",&z);
                update2(1,x,y,z);
            }
            else {
                // cout<<"sdf"<<endl;
                LL ans=query(1,x,y);
                printf("%I64d
",ans);
            }
        }
    }
    return 0;
}