bzoj 2790: [Poi2012]Distance 线性筛+乱搞

题意

对于两个正整数a、b，这样定义函数d(a,b)：每次操作可以选择一个质数p，将a变成a*p或a/p，
如果选择变成a/p就要保证p是a的约数，d(a,b)表示将a变成b所需的最少操作次数。例如d(69,42)=3。
现在给出n个正整数A1,A2,…,An，对于每个i (1<=i<=n)，求最小的j(1<=j<=n)使得i≠j且d(Ai,Aj)最小。
$2<=n<=100000,Ai<=1000000$

分析

注意这里不是求最小的d(Ai,Aj)而是求最小的j。
设s[x]表示x质因数分解后的指数和，显然d(x,y)=s(x)+s(y)-s[gcd(x,y)]。
我们考虑枚举x的每个约数作为gcd，求出最小值。然后再更新一下以x的每个约数为gcd时的贡献即可。

代码

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;

const int N=1000005;
const int inf=1000000000;

int n,a[305],a1,top,s1[10],s2[10],ans[N],prime[N],s[N],low[N],f[N],A[N/10],tot,num[N],g[N],mn[N];
bool not_prime[N];
vector<int> vec[N];

int read()
{
    int x=0,f=1;char ch=getchar();
    while (ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}

void get_prime(int n)
{
    for (int i=2;i<=n;i++)
    {
        if (!not_prime[i]) prime[++tot]=i,s[i]=1,low[i]=i;
        for (int j=1;j<=tot&&i*prime[j]<=n;j++)
        {
            not_prime[i*prime[j]]=1;
            s[i*prime[j]]=s[i]+1;
            low[i*prime[j]]=prime[j];
            if (i%prime[j]==0) break;
        }
    }
}

void dfs(int x,int d)
{
    if (x>top) {a[++a1]=d;return;}
    for (int i=0,p=1;i<=s2[x];i++,p*=s1[x]) dfs(x+1,d*p);
}

void divi(int x)
{
    top=0;
    while (x>1)
    {
        int p=low[x];s1[++top]=p;s2[top]=0;
        while (x%p==0) x/=p,s2[top]++;
    }
}

int main()
{
    n=read();int mx=0;
    for (int i=1;i<=n;i++)
    {
        int x=read();mx=max(mx,x);
        vec[x].push_back(i);
        if (!num[x]) num[x]=i;
    }
    get_prime(mx);
    for (int i=1;i<=mx;i++) f[i]=g[i]=ans[i]=mn[i]=inf;
    for (int i=1;i<=mx;i++)
    {
        if (!num[i]) continue;
        divi(i);a1=0;dfs(1,1);
        for (int j=1;j<=a1;j++)
        {
            int w=f[a[j]]+s[i/a[j]];
            if (w<mn[i]) mn[i]=w,ans[i]=g[a[j]];
            else if (w==mn[i]) ans[i]=min(ans[i],g[a[j]]);
        }
        for (int j=1;j<=a1;j++)
        {
            int w=s[i/a[j]];
            if (w<f[a[j]]) f[a[j]]=w,g[a[j]]=num[i];
            else if (w==f[a[j]]) g[a[j]]=min(g[a[j]],num[i]);
        }
    }
    for (int i=1;i<=mx;i++) f[i]=g[i]=inf;
    for (int i=mx;i>=1;i--)
    {
        if (!num[i]) continue;
        divi(i);a1=0;dfs(1,1);
        for (int j=1;j<=a1;j++)
        {
            int w=f[a[j]]+s[i/a[j]];
            if (w<mn[i]) mn[i]=w,ans[i]=g[a[j]];
            else if (w==mn[i]) ans[i]=min(ans[i],g[a[j]]);
        }
        for (int j=1;j<=a1;j++)
        {
            int w=s[i/a[j]];
            if (w<f[a[j]]) f[a[j]]=w,g[a[j]]=num[i];
            else if (w==f[a[j]]) g[a[j]]=min(g[a[j]],num[i]);
        }
    }
    for (int i=1;i<=mx;i++)
    {
        if (vec[i].size()>1)
        {
            ans[i]=num[i];
            for (int j=1;j<vec[i].size();j++) A[vec[i][j]]=ans[i];
            A[vec[i][0]]=vec[i][1];
        }
        else if (vec[i].size()) A[vec[i][0]]=ans[i];
    }
    for (int i=1;i<=n;i++) printf("%d\n",A[i]);
    return 0;
}