codeforces 920 F. SUM and REPLACE 线段树

920 F

题意 定义D数组为一个数的约数个数

2操作求 l 到 r的区间和 1操作把里面值赋值成他们D数组

我们知道一旦你区间maxx 是 2 或者 1 那么就不用更新了 因为D(1） = 1 D(2) = 2

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
#include <random>
#include <ctime>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
//inv[1]=1;
//for(int i=2; i<M; ++i) inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
//for(int i=0; i<LIM; ++i) coef[i]=1ll*(P[i]-1)*inv[P[i]]%mod;
const int MAX_N = 300025;
vector<int >vt[1000025];
int maxx[MAX_N<<2],tmp[1000025];
long long s[MAX_N<<2];
void init()
{
    for(int i = 1;i<1000005;i++)
    {
        for(int j = i;j<1000005;j+=i)
        {
                tmp[j]++;
        }
    }
}
void up(int rt)
{
    maxx[rt] = max(maxx[rt<<1],maxx[rt<<1|1]);
    s[rt] = s[rt<<1]+s[rt<<1|1];
}
void build(int rt,int l,int r)
{
    if(l==r)
    {
        int v;
        scanf("%d",&v);
        maxx[rt] = s[rt] = v;
        return ;
    }
    int mid =(l+r)>>1;
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    up(rt);
}
void update(int rt,int l,int r,int x,int y)
{
    if(l==r)
    {
        maxx[rt] = s[rt] = tmp[s[rt]];
        return ;
    }
    int mid = (l+r)>>1;
    if(x<=mid&&maxx[rt<<1]>2) update(rt<<1,l,mid,x,y);
    if(mid<y&&maxx[rt<<1|1]>2) update(rt<<1|1,mid+1,r,x,y);
    up(rt);
}
int query(int rt,int l,int r,int x,int y)
{
    if(x<=l&&r<=y)
    {
        return maxx[rt];
    }
    int mid = (l+r)>>1,maxx1 = 0,maxx2 = 0;
    if(x<=mid) maxx1 = query(rt<<1,l,mid,x,y);
    if(mid<y) maxx2 = query(rt<<1|1,mid+1,r,x,y);
    return max(maxx1,maxx2);
}
long long query_(int rt,int l,int r,int x,int y)
{
    if(x<=l&&r<=y)
    {
        return s[rt];
    }
    long long res = 0;
    int mid = (l+r)>>1;
    if(x<=mid) res+=query_(rt<<1,l,mid,x,y);
    if(mid<y) res+=query_(rt<<1|1,mid+1,r,x,y);
    return res;
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,m,opt,x,y;
    init();
    scanf("%d%d",&n,&m);
    build(1,1,n);
    while(m--)
    {
        scanf("%d%d%d",&opt,&x,&y);
        if(opt==1)
        {
            int maxx_ = query(1,1,n,x,y);
            if(maxx_<=2) continue;
            else update(1,1,n,x,y);
        }
        else
        {
            printf("%lld\n",query_(1,1,n,x,y));
        }
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}