【Loj 6281】区间开方 区间求和

Loj 6281
对于区间开方 我们很容易知道一个性质 2^31-1那么大的数开五次方以后也会变成1
所以我们对于开方操作 只要看那个区间是不是最大值为1了 如果最大值为1说明就不需要开方了
否则你就去暴力修改每个点
然后统计求和也是一样的统计方法

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#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>
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))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

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);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 50025;
int arr[MAX_N],sum[MAX_N],pos[MAX_N],block,n;
bool flag[MAX_N];
void work_sqrt(int x)
{
    if(flag[x]) return;
    flag[x] = true;
    sum[x] = 0;
    for(int i = (x-1)*block+1;i<=x*block;++i)
    {
        arr[i] = sqrt(arr[i]);sum[x]+=arr[i];
        if(arr[i]>1) flag[x] = false;
    }
}
void add(int x,int y)
{
    int st = pos[x] + 1,ed = pos[y] - 1;
    for(int i = x;i<=min(y,pos[x]*block);++i)
        sum[pos[x]]-=arr[i],arr[i] = sqrt(arr[i]),sum[pos[x]]+=arr[i];
    if(pos[x]!=pos[y])
        for(int i = (pos[y]-1)*block+1;i<=y;++i)
            sum[pos[y]]-=arr[i],arr[i] = sqrt(arr[i]),sum[pos[y]]+=arr[i];
    for(int i = st;i<=ed;++i)
        work_sqrt(i);
}
ll query(int x,int y)
{
    ll ans = 0;
    int st = pos[x] + 1,ed = pos[y] - 1;
    for(int i = x;i<=min(y,pos[x]*block);++i)
        ans+=arr[i];
    if(pos[x]!=pos[y])
        for(int i = (pos[y]-1)*block+1;i<=y;++i)
            ans+=arr[i];
    for(int i = st;i<=ed;++i)
        ans+=sum[i];
    return ans;
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int opt,x,y,v;scanf("%d",&n);
    block = sqrt(n);
    for(int i = 1;i<=n;++i)
    {
        scanf("%d",&arr[i]);
        pos[i] = (i-1)/block + 1;
        sum[pos[i]] += arr[i];
    }
    for(int i = 1;i<=n;++i)
    {
        scanf("%d%d%d%d",&opt,&x,&y,&v);
        if(opt==1) printf("%lld\n",query(x,y));
        else add(x,y);
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}