Euler Function
[Link](题目详情 (pintia.cn))
题意
给你一个序列和两个操作。
0 l r w 让区间[l, r] 每个数都乘上一个 w
1 l r 计算区间[l, r]中每个数的欧拉函数的值的和 mod 998244353 的值,并输出。
题解
考虑线段树维护,区间乘法和区间求和。对于怎么维护一个区间内每个数乘w后的欧拉函数的值,利用到了欧拉函数的性质。
if (p是质数) {
if (i % p == 0) f[i * p] = f[i] * p
else f[i * p] = f[i] * (p - 1);
}
因为数据范围给的x,w是[1, 100],因此可以考虑先把[1, 100]内的所有的数质因数分解,对于一个区间乘法w,来说可以吧w拆成一系列质数的次方乘积,对于乘一个w等价于分别乘这些质数的次方,这样就可以用到上面的性质了。对于判断p是否是i的一个质因数,我们可以用一个bitset直接维护,当前区间有哪些质因数,对于有这个质因数的就直接做区间修改,也就是一个势能线段树。
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <set>
#include <queue>
#include <vector>
#include <map>
#include <bitset>
#include <unordered_map>
#include <cmath>
#include <stack>
#include <iomanip>
#include <deque>
#include <sstream>
#define x first
#define y second
using namespace std;
typedef long double ld;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef unsigned long long ULL;
const int N = 1e5 + 10, M = 2 * N, INF = 0x3f3f3f3f, mod = 998244353;
const double eps = 1e-8;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int h[N], e[M], ne[M], w[M], idx;
void add(int a, int b, int v = 0) {
e[idx] = b, w[idx] = v, ne[idx] = h[a], h[a] = idx ++;
}
int n, m, k;
bitset<30> st[105]; // 第i个数能否被第j个数整除
struct Node {
int l, r;
bitset<30> tg;
LL sum, lazy;
}tr[N << 2];
int a[N], primes[N], f[N], cnt[105][30]; // i质因数分解后,用cnt[i][j]个第j个质数
void get() {
int tot = 0;
for (int i = 2; i <= 100; i ++ ) {
bool flag = false;
for (int j = 2; j <= sqrt(i); j ++ )
if (i % j == 0) {
flag = true;
break;
}
if (!flag) primes[++tot] = i;
}
for (int i = 1; i <= 100; i ++ )
for (int j = 1; j <= 25; j ++ ) {
int tmp = i;
while (tmp % primes[j] == 0) {
cnt[i][j] ++;
tmp /= primes[j];
}
st[i][j] = cnt[i][j];
}
}
int phi(int n) {
int res = n;
for (int i = 2; i * i <= n; i ++ )
if (n % i == 0) {
res = res / i * (i - 1);
while(n % i == 0) n /= i;
}
if (n > 1) res = res / n * (n - 1);
return res;
}
void pushup(int u) {
tr[u].sum = (tr[u << 1].sum + tr[u << 1 | 1].sum) % mod;
tr[u].tg = (tr[u << 1].tg & tr[u << 1 | 1].tg); // 同时满足的性质
}
void pushdown(Node& t, LL lazy) {
t.lazy = t.lazy * lazy % mod;
t.sum = t.sum * lazy % mod;
}
void pushdown(int u) {
if (tr[u].lazy) {
pushdown(tr[u << 1], tr[u].lazy), pushdown(tr[u << 1 | 1], tr[u].lazy);
tr[u].lazy = 1;
}
}
void build(int u, int l, int r) {
tr[u].l = l, tr[u].r = r, tr[u].lazy = 1;
if (tr[u].l == tr[u].r) {
tr[u].sum = 1ll * f[a[l]];
tr[u].tg = st[a[l]];
return ;
}
int mid = l + r >> 1;
build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
pushup(u);
}
void modify(int u, int l, int r, int x, int y) {
if (l <= tr[u].l && tr[u].r <= r && tr[u].tg[x]) {
for (int i = 1; i <= y; i ++ ) {
tr[u].sum = tr[u].sum * primes[x] % mod;
tr[u].lazy = tr[u].lazy * primes[x] % mod;
}
return ;
}
if (tr[u].l == tr[u].r) { // 叶子结点且不包含这个质数
tr[u].sum = tr[u].sum * (primes[x] - 1) % mod;
tr[u].tg[x] = 1;
for (int i = 1; i <= y - 1; i ++ )
tr[u].sum = tr[u].sum * primes[x] % mod;
return ;
}
pushdown(u);
int mid = tr[u].l + tr[u].r >> 1;
if (l <= mid) modify(u << 1, l, r, x, y);
if (r > mid) modify(u << 1 | 1, l, r, x, y);
pushup(u);
}
LL query(int u, int l, int r) {
if (l <= tr[u].l && tr[u].r <= r) return tr[u].sum;
pushdown(u);
int mid = tr[u].l + tr[u].r >> 1;
LL res = 0;
if (l <= mid) res = query(u << 1, l, r);
if (r > mid) res += query(u << 1 | 1, l, r);
return res;
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
get();
f[1] = 1;
for (int i = 2; i <= 100; i ++ ) f[i] = phi(i);
cin >> n >> m;
for (int i = 1; i <= n; i ++ ) cin >> a[i];
build(1, 1, n);
int op, l, r, x;
while (m --) {
cin >> op;
if (op == 1) {
cin >> l >> r;
cout << query(1, l, r) % mod << endl;
}
else {
cin >> l >> r >> x;
for (int i = 1; i <= 25; i ++ )
if (cnt[x][i]) modify(1, l, r, i, cnt[x][i]);
}
}
return 0;
}