2016江苏省赛H题(莫比乌斯反演+分块求和)

最新推荐文章于 2022-06-29 18:24:06 发布

孤鸿子_

最新推荐文章于 2022-06-29 18:24:06 发布

阅读量1k

点赞数

分类专栏：算法&数据结构文章标签：欧拉函数莫比乌斯分块求和

本文链接：https://blog.csdn.net/dylan_frank/article/details/70947993

版权

算法&数据结构专栏收录该内容

227 篇文章 1 订阅

订阅专栏

题目描述

就是让你计算这个东西

\sum i = 1 n \sum j = 1 m i 2 * j 2 g c d (i, j) n, m \leq 1 e 6

$\sum_{i = 1}^n\sum_{j=1}^mi^2*j^2gcd(i,j)\\ n,m\le 1e6$

分析

和经典的这个公式很像 $\sum_{i = 1}^n\sum_{j=1}^mgcd(i,j)$ 只需做一些简单的转化.

\sum i = 1 n \sum j = 1 m i 2 * j 2 g c d (i, j) = \sum i = 1 n \sum j = 1 m i 2 * j 2 \sum d ∣ g c d (i, j) ϕ (d) = \sum i = 1 n \sum j = 1 m i 2 * j 2 \sum d ∣ i, d ∣ j ϕ (d) = \sum d = 1 n ϕ (d) \sum d ∣ i i 2 \sum d ∣ j j 2 (3) = \sum d = 1 n ϕ (d) \sum k = 1 n / d (k * d) 2 \sum k = 1 m / d (k * d) 2 = \sum d = 1 n ϕ (d) * d 4 \sum k = 1 n / d k 2 \sum k = 1 m / d k 2 = \sum d = 1 n ϕ (d) * d 4 n / d * ( n / d + 1 ) * ( 2 * ( n / d ) + 1 ) 6 m / d * ( m / d + 1 ) * ( 2 * ( m / d ) + 1 ) 6

$\begin{align} \sum_{i = 1}^n\sum_{j=1}^mi^2*j^2gcd(i,j)&=\sum_{i = 1}^n\sum_{j=1}^mi^2*j^2\sum_{d\mid gcd(i,j)}\phi(d)\\ &=\sum_{i = 1}^n\sum_{j=1}^mi^2*j^2\sum_{d\mid i,d\mid j}\phi(d)\\ &=\sum_{d = 1}^n\phi(d)\sum_{d\mid i}i^2\sum_{d\mid j}j^2\ \ \ \ \ \ \ (3)\\ &=\sum_{d = 1}^n\phi(d)\sum_{k=1}^{n/d}(k*d)^2\sum_{k=1}^{m/d}(k*d)^2\\ &=\sum_{d = 1}^n\phi(d)*d^4\sum_{k=1}^{n/d}k^2\sum_{k=1}^{m/d}k^2\\ &=\sum_{d = 1}^n\phi(d)*d^4\frac{n/d*(n/d+1)*(2*(n/d)+1)}{6}\frac{m/d*(m/d+1)*(2*(m/d)+1)}{6} \end{align}$
比赛的时候只想到了第三步以为

O(nlgn) $O(nlgn)$ 的复杂度已经够了哪知道交上去各种T,回去睡了一晚上之后就发现了平方和用公式计算这样就简单许多了.然后由于它是关于

n/d $n/d$ 的公式显然可以用分块求和将复杂度降低到

O(n−−√+m−−√) $O(\sqrt n+\sqrt m)$

AC code


#include <cstdio>
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include<cmath>
#include <cstring>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define INF64 0x3f3f3f3f3f3f3f3f
using namespace std;
const int MOD = 1e9+7;
const int MAX_P = 2e4+10;
const int maxn =1e6+10;
const int MAX_V = 5e5+10;
const int maxv = 1e6+10;
typedef long long LL;
typedef long double DB;
typedef pair<int,int> Pair;

int n,m;

LL phi[maxn],prime[maxn],cnt;
void phi_table() {
    memset(prime,0,sizeof(prime));
    cnt =0;
    phi[1] = 1;
    for(int i=2 ; i<maxn ; ++i)
    {
        if(!prime[i]){
            prime[cnt++] = i;
            phi[i] = i-1;
        }
        for(int j =0 ; j< cnt && i*prime[j] < maxn ; ++j){
            prime[i*prime[j]] = 1;
            if(i % prime[j])phi[i*prime[j]] = phi[i]*(prime[j]-1);
            else{
                phi[i*prime[j]] = phi[i]*prime[j];
                break;
            }
        }
    }
}
LL f1[maxn],f2[maxn];

LL sum[maxn];

int main() {
    phi_table();
    // for(int d = 1 ; d<= 100 ; ++d)
    // std::cout << phi[d] << '\n';
    int T;
    int kase =0;
    scanf("%d",&T );
    sum[0] = 0;
    for(LL i=1 ; i<maxn ; ++i){
        sum[i] = sum[i-1]+(phi[i]*i*i %MOD )*(i*i%MOD)%MOD;
        sum[i]%=MOD;
    }
    while (T--) {


        scanf("%d%d",&n,&m );
        if(n>m)swap(n,m);
        LL ans =0;
        for(LL d =1 ,last =1 ; d<=n ; d = last+1){
            LL a = (LL)(n/d)*(n/d+1)/2*(2*(n/d)+1)/3 % MOD;
            LL b = (LL)(m/d)*(m/d+1)/2*(2*(m/d)+1)/3 % MOD;
            last = min(n/(n/d),m/(m/d));
            ans+=((sum[last]-sum[d-1]+MOD)%MOD) *(a*b % MOD) % MOD;
            ans%=MOD;
        }
        printf("Case #%d: %d\n",++kase,(int)ans );
    }

    #ifdef LOCAL_DEFINE
        cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif
    return 0;
}