重心拉格朗日插值法 (板子)

拉格朗日的作用

就是给你 n+1 个点，让你构造出一个 n 次函数，使得这个函数的图像经过坐标轴上的 n+1 个点。

重心拉格朗日插值法

优化到O(n)

O(n*n)
#include<iostream>
#include<cstdio>
#define ll long long
using namespace std;
const int M=2111;
const ll mod=998244353;
#ifndef Judge
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
#endif
char buf[1<<21],*p1=buf,*p2=buf;
inline ll read(){
    ll x=0,f=1; char c=getchar();
    for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
    for(;isdigit(c);c=getchar()) x=x*10+c-'0'; return x*f;
} int n; ll k,K,ans,x[M],y[M];
inline void AMOD(ll& a,ll& b){ a+=b; if(a>=mod) a%=mod; }
inline ll quick_pow(ll x,ll p,ll ans=1){
    while(p){
        if(p&1) ans=ans*x%mod;
        x=x*x%mod,p>>=1;
    } return ans;
}
int main(){
    n=read(),K=read();
    for(int i=1;i<=n;++i) x[i]=read(),y[i]=read();
    for(int i=1,j;i<=n;++i){ k=1;
        for(j=1;j<=n;++j) if(i!=j)
            k=k*(x[i]+mod-x[j])%mod;
        k=quick_pow(k,mod-2);
        for(j=1;j<=n;++j) if(i!=j)
            k=k*(K+mod-x[j])%mod;
        k=k*y[i]%mod,AMOD(ans,k);
    } return printf("%lld\n",ans),0;
}

O(n)
#include<iostream>
#include<cstdio>
#define ll long long
using namespace std;
const int M=2111;
const ll mod=998244353;
#ifndef Judge
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
#endif
char buf[1<<21],*p1=buf,*p2=buf;
inline ll read(){
    ll x=0,f=1; char c=getchar();
    for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
    for(;isdigit(c);c=getchar()) x=x*10+c-'0'; return x*f;
} ll n,K,ans,x[M],y[M],s1[M],s2[M],ifac[M];
inline void ADD(ll& a,ll b){ a+=b; if(a>=mod) a%=mod; }
int main(){ n=read()-1,K=read(),s2[n+1]=ifac[0]=ifac[1]=1;
    for(int i=0;i<=n;++i) x[i]=read(),y[i]=read(); s1[0]=(K-x[i])%mod;
    for(int i=1;i<=n;++i) s1[i]=s1[i-1]*(K-x[i])%mod;
    for(int i=n;i>=1;--i) s2[i]=s2[i+1]*(K-x[i])%mod;
    for(int i=2;i<=n;++i) ifac[i]=(mod-mod/i)*ifac[mod%i]%mod;
    for(int i=2;i<=n;++i) ifac[i]=ifac[i]*ifac[i-1]%mod;
    for(int i=0;i<=n;++i)
        ADD(ans,1ll*y[i]*(i?s1[i-1]:1)%mod*s2[i+1]%mod*
            ifac[i]%mod*((n-i&1)?-1:1)*ifac[n-i]%mod);
    return !printf("%lld\n",(ans+mod)%mod);
}

封装一波函数…

ll lagrange(ll n,ll *x,ll *y,ll xi){ ll ans=0;
    s1[0]=(xi-x[0])mod,s2[n+1]=ifac[0]=ifac[1]=1;
    for(int i=1;i<=n;++i) s1[i]=s1[i-1]*(xi-x[i])%mod;
    for(int i=n;i>=0;--i) s2[i]=s2[i+1]*(xi-x[i])%mod;
    for(int i=2;i<=n;++i) ifac[i]=(mod-mod/i)*ifac[mod%i]%mod;
    for(int i=2;i<=n;++i) ifac[i]=ifac[i]*ifac[i-1]%mod;
    for(int i=0;i<=n;++i)
        ADD(ans,1ll*y[i]*(i?s1[i-1]:1)%mod*s2[i+1]%mod*
            ifac[i]%mod*((n-i&1)?-1:1)*ifac[n-i]%mod);
    return (ans+mod)%mod;
}