TLE70求调

#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const int N=3e6+3;
int B,mu[N],smu[N],smumu[N];
unordered_map <ll,ll> mpmu;
vector <int> prime;
bool not_p[N];
inline void init()
{
    not_p[1]=mu[1]=smu[1]=smumu[1]=1;
    for(int i=2;i<=B;++i)
    {
        if(!not_p[i])
        {
            prime.push_back(i);
            mu[i]=-1;
        }
        smu[i]=smu[i-1]+mu[i],smumu[i]=smumu[i-1]+mu[i]*mu[i];
        for(int p:prime)
        {
            if(p*i>B) break;
            not_p[i*p]=1;
            if(i%p==0)
            {
                mu[i*p]=0;
                break;
            }
            mu[i*p]=-mu[i];
        }
    }
}
ll summu(ll n)
{
    if(n<=B) return smu[n];
    if(mpmu.count(n)) return mpmu[n];
    ll l=2,r,ret=1;
    while(l<=n)
    {
        r=n/(n/l);
        ret-=summu(n/l)*(r-l+1);
        l=r+1;
    }
    return mpmu[n]=ret;
}
inline ll summumu(ll n)
{
    if(n<=B) return smumu[n];
    ll t,mx=sqrt(n),l=1,r,ret=0;
    while(l<=mx)
    {
        t=n/(l*l);
        r=sqrt(n/t);
        ret+=(summu(r)-summu(l-1))*t;
        l=r+1;
    }
    return ret;
}
inline ll solve(ll n,ll m)
{
    ll l=1,r,ret=0,mx=min(n,m),tn,tm;
    while(l<=mx)
    {
        tn=sqrt(n/l),tm=sqrt(m/l);
        r=min(n/tn/tn,m/tm/tm);
        ret+=(summumu(r)-summumu(l-1))*tn*tm;
        l=r+1;
    }
    return ret;
}
int main()
{
    ll n,m;
    scanf("%llu%llu",&n,&m);
    B=pow(max(n,m),0.4);
    init();
    printf("%llu\n",solve(n,m));
    return 0;
}