The 2020 ICPC Asia Macau Regional Contest A. Accelerator（分治+NTT）

#include<bits/stdc++.h>using namespace std;
using ll=long long;const int N=300010;
const int P=998244353;
const int G=3,Gi=332748118;
const int mod=998244353;int qmi(int a,int b)
{int v=1;while(b){if(b&1) v=1ll*v*a%P;a=1ll*a*a%P;b>>=1;}return v;
}
int rev[N];
void NTT(int *a,int n,int inv)
{for(int i=0;i<n;i++) if(i<rev[i]) swap(a[i],a[rev[i]]);for(int mid=1;mid<n;mid<<=1){int Wn=qmi((inv==1)?G:Gi,(P-1)/(mid<<1));for(int i=0;i<n;i+=(mid<<1)){int w=1;for(int j=0;j<mid;j++,w=1ll*w*Wn%P){int x=a[i+j],y=1ll*w*a[i+j+mid]%P;a[i+j]=(x+y)%P;a[i+j+mid]=(x-y+P)%P;}}}if(inv==-1) {int invn=qmi(n,P-2);for(int i=0;i<n;i++) a[i]=1ll*a[i]*invn%P;}
}
//=======================================================
int fact[N],infact[N];
void init()
{fact[0]=1;for(int i=1;i<=100000;i++) fact[i]=1ll*i*fact[i-1]%mod;infact[100000]=qmi(fact[100000],mod-2);for(int i=99999;i;i--) infact[i]=1ll*infact[i+1]*(i+1)%mod;
}
int n,A[N],B[N],C[N];
int Mul(int *a,int *b,int n,int m,int *ans)
{int bit=0,num=1;while(num<n+m+1) num<<=1,bit++;for(int i=0;i<num;i++) rev[i]=(rev[i>>1]>>1)|((i&1)<<(bit-1));for(int i=0;i<=n;i++) A[i]=a[i];for(int i=0;i<=m;i++) B[i]=b[i];for(int i=n+1;i<num;i++) A[i]=0;for(int i=m+1;i<num;i++) B[i]=0;NTT(A,num,1);NTT(B,num,1);for(int i=0;i<num;i++) C[i]=1ll*A[i]*B[i]%mod;NTT(C,num,-1);for(int i=0;i<=n+m;i++) ans[i]=C[i];return n+m;
}int pool[N<<1],tot;
struct Node
{int *p,n;void init(int x){this->n=1;p=pool+tot;for(int i=0;i<=n;i++) p[i]=0;p[0]=x;p[1]=1;tot+=n+1;}void mul(const Node&o){n=Mul(p,o.p,n,o.n,p);}
};
Node solve(int l,int r)
{Node ans;if(l==r){int x;cin>>x;ans.init(x);return ans;}int mid=l+r>>1;ans=solve(l,mid);ans.mul(solve(mid+1,r));return ans;
}
int main()
{ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);init();int Tc;cin>>Tc;while(Tc--){cin>>n;Node res=solve(1,n);ll ans=0;for(int i=1;i<=n;i++)ans=(ans+1ll*res.p[n-i]*fact[i]%mod*fact[n-i]%mod)%mod;ans=ans*infact[n]%mod;printf("%lld\n",ans);}return 0;}

The 2020 ICPC Asia Macau Regional Contest A. Accelerator（分治+NTT）相关推荐

并查集 ---- 扩展域并查集判二分图 + 循环模拟字典树 The 2020 ICPC Asia Macau Regional Contest C. Club Assignment (详解)
题目链接题目大意: 有n个数,现在要把他们拆分成两个集合,假设S为集合,有如下定义: f(S)={min(x⊕y)∣x,y∈S,andx!=y}f(S)=\{min(x\oplus y)|x,y\i ...
The 2020 ICPC Asia Macau Regional Contest J. Jewel Grab（数颜色+链表）
J. Jewel Grab Tartarus _Wallace_ 转化询问:对于一个询问 [s,k],找到一个最长的区间 [s,t],满足区间中出现次数超过一次的元素,的出现次数减一,的和,不超过 k ...
The 2020 ICPC Asia Macau Regional Contest
文章目录前言 D.Artifacts F. Fixing Networks L. Random Permutation 总结前言 vp D.Artifacts 题意:阅读理解,字符串中提取出来对应 ...
The 2020 ICPC Asia Shenyang Regional Programming Contest I题 Rise of Shadows（数论）
题目链接The 2020 ICPC Asia Shenyang Regional Programming Contest 题目大意: 一天内有H小时,每小时M分钟,时针分针以恒定速率旋转. 现在若时针 ...
The 2020 ICPC Asia Yinchuan Regional Programming Contest
The 2020 ICPC Asia Yinchuan Regional Programming Contest A 开三个vector数组存储x,y,z轴上的点,unique+erase去重 #in ...
The 2019 ICPC Asia Shanghai Regional Contest
The 2019 ICPC Asia Shanghai Regional Contest 题号题目知识点 A Mr. Panda and Dominoes B Prefix Code C Maze ...
2018 ICPC Asia Jakarta Regional Contest
2018 ICPC Asia Jakarta Regional Contest 题号题目知识点难度 A Edit Distance B Rotating Gear C Smart Thief D ...
【题目记录】——The 2021 ICPC Asia Jinan Regional Contest
文章目录 C Optimal Strategy 组合数 H Game Coin K Search For Mafuyu 欧拉序列题目集地址 The 2021 ICPC Asia Jinan Regi ...
2019-2020 ICPC Asia Xuzhou Regional Contest【徐州现场赛】
题目: 209-2020 ICPC Asia Xuzhou Regional Onsite Contest E. Multiply 题意: 找到最大的 i 使得 z*x^i 是 y! 的因子分析: ...

The 2020 ICPC Asia Macau Regional Contest A. Accelerator（分治+NTT）

A. Accelerator

The 2020 ICPC Asia Macau Regional Contest A. Accelerator（分治+NTT）相关推荐

最新文章

热门文章