题目链接:http://codeforces.com/contest/920/problem/F
题解:因为更新必须是单点更新,每个数变化的次数是一定的,当他变化成2时(需要特殊考虑1),则没必要继续更新,有限制,所以更新不是每次都要到单点。
#include <bits/stdc++.h>
using namespace std;
#define SZ(X) ((int)X.size())
#define pb push_back
#define RALL(X) X.rbegin(),X.rend()
#define ALL(X) X.begin(),X.end()
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
using ll = long long ;
using ld = long double ;
const int N = 3E5 + 7, M = 1E6 + 7;
ll A[N<<2],B[N<<2];
int mp[M];
void pushup(int rt)
{
A[rt] = A[rt<<1] + A[rt<<1|1];
B[rt] = B[rt<<1] + B[rt<<1|1];
}
void build(int l, int r, int rt)
{
if(l == r) {
scanf("%lld",&A[rt]) ;
if(A[rt] == 1) B[rt] ++;
return ;
}
int mid = (l + r) >> 1;
build(lson);
build(rson);
pushup(rt);
}
void update(int L, int R, int l, int r, int rt)
{
if(A[rt] + B[rt] == (r-l+1LL) * 2) return ;
if(l == r) {
A[rt] = mp[A[rt]];
return ;
}
int mid = (l + r) >> 1;
if(L <= mid) update(L,R,lson);
if(R > mid) update(L,R,rson);
pushup(rt);
}
ll query(int L, int R, int l, int r, int rt)
{
if(L <= l && r <= R) {
return A[rt];
}
ll ans = 0;
int mid = (l + r) >> 1;
if(L <= mid) ans += query(L,R,lson);
if(R > mid) ans += query(L,R,rson);
return ans;
}
int main()
{
for(int i = 1;i <= 1000000;i ++) {
for(int j = i;j <= 1000000;j += i) {
mp[j] ++;
}
}
int n, m;
scanf("%d%d",&n,&m) ;
build(1, n, 1);
while(m --) {
int opt;
int l, r;
scanf("%d%d%d",&opt,&l,&r);
if(opt == 1) {
update(l,r,1,n,1);
} else {
printf("%lld\n", query(l,r,1,n,1));
}
}
return 0;
}
/*
10 2
1 1 1 1 1 1 1 1 1 9
1 1 10
2 1 10
*/