H题:Convolution
原题链接:https://ac.nowcoder.com/acm/contest/11255/H
题目大意
思路
先对条件进行变换。
l
c
m
(
x
,
y
)
=
Π
i
p
i
m
a
x
(
a
i
,
b
i
)
lcm(x,y)=\Pi_{i}p_i^{max(a_i,b_i)}
lcm(x,y)=Πipimax(ai,bi)
g
c
d
(
x
,
y
)
=
Π
i
p
i
m
i
n
(
a
i
,
b
i
)
gcd(x,y)=\Pi_{i}p_i^{min(a_i,b_i)}
gcd(x,y)=Πipimin(ai,bi)
∣
a
i
−
b
i
∣
=
m
a
x
(
a
i
,
b
i
)
−
m
i
n
(
a
i
,
b
i
)
|a_i-b_i|=max(a_i,b_i)-min(a_i,b_i)
∣ai−bi∣=max(ai,bi)−min(ai,bi)
=
>
x
⊗
y
=
l
c
m
(
x
,
y
)
g
c
d
(
x
,
y
)
=
x
y
g
c
d
2
(
x
,
y
)
=>x\otimes y=\frac{lcm(x,y)}{gcd(x,y)}=\frac{xy}{gcd^2(x,y)}
=>x⊗y=gcd(x,y)lcm(x,y)=gcd2(x,y)xy
对于序列b
b
i
=
∑
1
≤
j
,
k
≤
n
,
j
⊗
k
=
i
a
j
k
c
b_i=\sum_{1\leq j,k\leq n,j\otimes k=i}a_jk^c
bi=1≤j,k≤n,j⊗k=i∑ajkc
设
g
=
g
c
d
(
j
,
k
)
,
x
=
j
g
,
y
=
k
g
g=gcd(j,k),x=\frac{j}{g},y=\frac{k}{g}
g=gcd(j,k),x=gj,y=gk可以化简为
b
i
=
∑
1
≤
x
,
y
≤
n
,
x
y
=
i
a
x
g
(
y
g
)
c
b_i=\sum_{1\leq x,y\leq n,xy=i}a_{xg}{(yg)}^c
bi=1≤x,y≤n,xy=i∑axg(yg)c
=
>
b
i
=
∑
1
≤
x
,
y
≤
n
,
x
y
=
i
y
c
a
x
g
g
c
=>b_i=\sum_{1\leq x,y\leq n,xy=i}y^ca_{xg}{g}^c
=>bi=1≤x,y≤n,xy=i∑ycaxggc
放个dp数组预处理
a
x
g
g
c
a_{xg}g^c
axggc然后循环计算
b
i
b_i
bi的值。最后所有
b
i
b_i
bi Xor求答案。
时间复杂度
O
(
n
l
o
g
n
)
O(n\ log\ n)
O(n log n)
注:快速幂的值要预处理,否则也会超时。
代码实现
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=998244353;
const int N=1e6+7;
ll n,C,a[N],b[N],ans;
ll dp[N],p[N];
ll gcd(ll a,ll b){
if(a%b==0) return b;
return gcd(b,a%b);
}
ll fmx(ll x,ll y)
{
ll ret=1;
while(y)
{
if(y&1) ret=ret*x%mod;
x=x*x%mod;
y>>=1;
}
return ret;
}
int main()
{
scanf("%lld%lld",&n,&C);
for(int i=1;i<=n;i++)
scanf("%lld",&a[i]);
for(int x=1;x<=n;x++){
p[x]=fmx(x,C);
}
for(int i=1;i<=n;i++){
for(int j=1;i*j<=n;j++)
dp[j]=(dp[j-1]+p[j]*a[i*j])%mod;
for(int j=1;i*j<=n;j++)
if(gcd(i,j)==1)
b[i*j]=(b[i*j]+dp[min(n/i,n/j)]*p[j]%mod)%mod;
}
for(int i=1;i<=n;i++)
ans^=b[i];
printf("%lld\n",ans);
return 0;
}