Center Street

https://ac.nowcoder.com/acm/contest/877/I

题意：给1~n的点，i可以和他的倍数连边，长度（j-i）^2；问1到全部点的最短距离 ；

反思：一开始迪杰斯特拉最短路.....连边都会超时把....然后想的是找到的因子一个个比较O(nsqrt(n))也不行.....

最后就是每到i更新i的倍数了，log(n)......没开longlong也没注意到。。

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=5e5+9;
const int mod=1e9+7;

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

ll d[maxn];
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int n;
    cin>>n;
    for(int i=1;i<=n;i++) d[i]=1LL*(i-1)*(i-1);
    for(int i=1;i<=n;i++)
    {
        for(int j=i+i;j<=n;j+=i)
        {
            d[j]=min(d[j],d[i]+1LL*(j-i)*(j-i));
        }
    }
    for(int i=1;i<=n;i++)
    {
        if(i!=1)cout<<" ";
        cout<<d[i];
    }
    return 0;
}