bzoj3529 Sdoi2014 数表

题面：bzoj3529

题意：求${\sum }_{i=1}^n{\sum }_{j=1}^m\sigma (gcd(i,j))$，$\sigma (gcd(i,j))\le a$。其中$\sigma (x)$表示$x$的约数和。

题解：先不管$a$的限制

$\begin{array}{rl}ans& =\sum _{i=1}^n\sum _{j=1}^m\sigma (gcd(i,j))\\ & =\sum _{d=1}^n\sigma (d)\sum _{i=1}^n\sum _{j=1}^m[gcd(i,j)=d]\\ & =\sum _{d=1}^n\sigma (d)\sum _{i=1}^{\frac{n}{d}}\mu (i)\lfloor \frac{n}{id}\rfloor \lfloor \frac{m}{id}\rfloor \end{array}$

令$T=id$，$ans={\sum }_{T=1}^n\lfloor \frac{n}{T}\rfloor \lfloor \frac{m}{T}\rfloor {\sum }_{d\mid T}\sigma (d)\mu (\frac{T}{d})$

先把$\sigma$和$\mu$筛出。现在考虑$a$的限制。

离线询问，把询问按照$a$排序。把所有的数按照$\sigma (i)$排序。

每次询问一个$a$，把所有的$\sigma (d)\le a$暴力计算$d$对$T$的贡献。

查询时需要计算${\sum }_{d\mid T}\sigma (d)\mu (\frac{T}{d})$关于$T$的前缀和，树状数组维护。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10 ;
int n ;
int prime[maxn], tot ;
int mu[maxn], sig[maxn], sumd[maxn], powd[maxn] ;
bool vis[maxn] ;
int p[maxn], ans[maxn], sum[maxn] ;
struct query {
    int id, n, m, a ;
    bool operator < (const query &x) const {
        return a < x.a ;
    }
}q[maxn] ;
void init () {
    sig[1] = p[1] = mu[1] = 1 ;
    for (int i = 2; i < maxn; i ++) {
        p[i] = i ;
        if (!vis[i]) {
            prime[++ tot] = i; mu[i] = -1 ;
            sig[i] = i + 1; sumd[i] = i + 1; powd[i] = i ;
        }
        for (int j = 1; j <= tot && i * prime[j] < maxn; j ++) {
            vis[i * prime[j]] = 1 ;
            if (i % prime[j] == 0) {
                powd[i * prime[j]] = powd[i] * prime[j] ;
                sumd[i * prime[j]] = sumd[i] + powd[i * prime[j]] ;
                sig[i * prime[j]] = sig[i] / sumd[i] * sumd[i * prime[j]] ;
                mu[i * prime[j]] = 0 ;
                break ;
            }
            powd[i * prime[j]] = prime[j] ;
            mu[i * prime[j]] = -mu[i] ;
            sig[i * prime[j]] = sig[i] * sig[prime[j]] ;
            sumd[i * prime[j]] = prime[j] + 1 ;
        }
    }
}
bool cmp (int a, int b) {return sig[a] < sig[b];}
inline int lowbit (int x) {return x & (-x);}
void add (int pos, int val) {
    while (pos <= n) {
        sum[pos] += val ;
        pos += lowbit (pos) ;
    }
}
int query (int pos) {
    int res = 0 ;
    while (pos) {
        res += sum[pos] ;
        pos -= lowbit (pos) ;
    }
    return res ;
}
int solve (int x, int y) {
    int cur, pre = 0, res = 0 ;
    for (int i = 1, j; i <= x; i = j + 1) {
        j = min (x / (x / i), y / (y / i)) ;
        cur = query (j) ;
        res += (x / i) * (y / i) * (cur - pre) ;
        pre = cur ;
    }
    return res ;
}
int main() {
    int T ;
    cin >> T ;
    for (int i = 1; i <= T; i ++) {
        q[i].id = i ;
        scanf("%d%d%d", &q[i].n, &q[i].m, &q[i].a) ;
        if (q[i].n > q[i].m) swap (q[i].n, q[i].m) ;
        n = max (n, q[i].n) ;
    }
    init () ;
    sort (q + 1, q + T + 1); sort (p + 1, p + n + 1, cmp) ;
    for (int i = 1, j = 1; i <= T; i ++) {
        for (; j <= n && sig[p[j]] <= q[i].a; j ++)
            for (int k = p[j]; k <= n; k += p[j])
                if (mu[k / p[j]]) add (k, sig[p[j]] * mu[k / p[j]]) ;
        ans[q[i].id] = solve (q[i].n, q[i].m) ;
    }
    for (int i = 1; i <= T; i ++) {
        if (ans[i] < 0) ans[i] += 2147483647, ans[i] ++ ;
        printf("%d\n", ans[i]) ;
    }
    return 0 ;
}