結果

問題 No.931 Multiplicative Convolution
ユーザー fgwiebfaoish
提出日時 2020-11-04 15:06:09
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 701 ms / 2,000 ms
コード長 7,019 bytes
コンパイル時間 3,224 ms
コンパイル使用メモリ 117,444 KB
実行使用メモリ 47,868 KB
最終ジャッジ日時 2024-07-22 09:57:10
合計ジャッジ時間 10,843 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 14
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

using System;
using System.Collections.Generic;
using System.Collections;
using System.Collections.Specialized;
using System.Linq;
using System.Text;
using System.IO;
using System.Reflection;
using static System.Math;
using System.Numerics;
static class Program{
const int mod=998244353;
static void Main(){
Sc sc=new Sc();
var p=sc.I;
var a=sc.Ia2;
var b=sc.Ia2;
if(p==2){
Console.WriteLine(a[1]*(Mint)b[1]);
return;
}
long g=Prm(p),f=g;
var h=new int[p];
for(int i = 1;i<p;i++,f=f*g%p) {h[f]=i;}
var c=new int[p+1];
var d=new int[p+1];
for(int i = 1;i<p;i++) {
c[h[i]]=a[i];
d[h[i]]=b[i];
}
var z=Ex.Fft(c,d);
var ans=new Mint[p-1];
for(int i = 0;i<z.Length;i++) {ans[Fp(g,i,p)%p-1]+=z[i];}
Console.WriteLine("{0}",string.Join(" ",ans));
}
static long Fp(long x,long e,int mod){
long r=1;
while(e>0){
if((e&1)>0){r*=x;r%=mod;}
x=(x*x)%mod;
e>>=1;
}
return r;
}
static int Prm(int p){
var pf=new Pf(p-1);
var li=new List<int>();
pf.Get((k,v)=>{li.Add((p-1)/(int)k);});
int a=2;
f:
for(int i = 0;i<li.Count;i++) {
if(Fp(a,li[i])==1){a++;goto f;}
}
return a;
long Fp(long x,long e){
long r=1;
while(e>0){
if((e&1)>0){r*=x;r%=p;}
x=x*x%p;
e>>=1;
}
return r;
}
}
}
public struct Mint{
const int mod=998244353;
private long d;
public Mint(long d){this.d=d;}
public static implicit operator Mint(long d){return new Mint(d%mod);}
public static explicit operator long(Mint d){return d.d;}
public override string ToString(){return d.ToString();}
public static Mint operator+(Mint a,long b){a.d=(a.d+b)%mod;return a;}
public static Mint operator+(Mint a,Mint b){a.d=(a.d+b.d)%mod;return a;}
public static Mint operator-(Mint a,long b){a.d=(mod+a.d-b)%mod;return a;}
public static Mint operator-(Mint a,Mint b){a.d=(mod+a.d-b.d)%mod;return a;}
public static Mint operator*(Mint a,long b){a.d=(a.d*b)%mod;return a;}
public static Mint operator*(Mint a,Mint b){a.d=(a.d*b.d)%mod;return a;}
public static Mint operator/(Mint a,long b){a.d=(a.d*Mi(b))%mod;return a;}
public static Mint operator/(Mint a,Mint b){a.d=(a.d*Mi(b.d))%mod;return a;}
public static bool operator==(Mint a,long b){return (long)a==b;}
public static bool operator!=(Mint a,long b){return (long)a!=b;}
public override bool Equals(object obj){return false;}
public override int GetHashCode(){return 0;}
public static long Mi(long a){
a=(a+mod)%mod;
long b=mod,u=1,v=0;
while(b>0){
long t=a/b;
a-=t*b;(a,b)=(b,a);
u-=t*v;(u,v)=(v,u);
}
u%=mod;
if(u<0){u+=mod;}
return u%mod;
}
}
public class Pf{
public Dictionary<long,int> hs=new Dictionary<long,int>();
public Pf(long n){
if(n%2==0){
int p=0;
while((n&1)==0){n>>=1;p++;}
hs.Add(2,p);
}
var q=(int)Sqrt(n)+1;
for(int i=3;n!=1&&i<q;i+=2){
if(n%i==0){
int p=0;
while(n%i==0){n/=i;p++;}
q=(int)Sqrt(n)+1;
hs.Add(i,p);
}
}
if(n!=1){hs.Add(n,1);}
}
public void Get(Action<long,int> f){
foreach(var e in hs){f(e.Key,e.Value);}
}
}
static class Ex{
private static long[] ga1=new long[24],ga2=new long[24];
private const int mod=998244353;
public static int[] Fft(int[] a,int[] b){
int m=1,p=0;
while(m<a.Length+b.Length){m<<=1;p++;}
long[] aa=new long[m],ba=new long[m],c=new long[m];
var d=new int[a.Length+b.Length-1];
for(int i = 0;i<a.Length;i++) {aa[i]=a[i];}
for(int i = 0;i<b.Length;i++) {ba[i]=b[i];}
ga1[23]=15311432;
ga2[23]=469870224;
for(int i = 22;i>0;i--) {
ga1[i]=ga1[i+1]*ga1[i+1]%mod;
ga2[i]=ga2[i+1]*ga2[i+1]%mod;
}
Dft(aa,p);
Dft(ba,p);
for(int i = 0;i<m;i++) {c[i]=aa[i]*ba[i]%mod;}
Idft(c,p);
var y=Mi(c.Length);
for(int i = 0;i<d.Length;i++) {d[i]=(int)(c[i]*y%mod);}
return d;
}
public static void Dft(long[] a,int h){
for(int i=0;i<a.Length;i++) {
int j=0;
for (int k=0;k<h;k++){j|=(i>>k&1)<<(h-1-k);}
if(i<j){(a[i],a[j])=(a[j],a[i]);}
}
for(int b=1,p=1;b<a.Length;b<<=1,p++) {
long w=1,f=ga1[p];
for (int j = 0;j<b;j++,w=w*f%mod) {
for (int k = 0;k<a.Length;k+=b<<1) {
long s=a[j+k],t=a[j+k+b]*w%mod;
a[j+k]=(s+t)%mod;
a[j+k+b]=(mod+s-t)%mod;
}
}
}
}
public static void Idft(long[] a,int h){
for(int i=0;i<a.Length;i++) {
int j=0;
for (int k=0;k<h;k++){j|=(i>>k&1)<<(h-1-k);}
if(i<j){(a[i],a[j])=(a[j],a[i]);}
}
for(int b=1,p=1;b<a.Length;b<<=1,p++) {
long w=1,f=ga2[p];
for (int j = 0;j<b;j++,w=w*f%mod) {
for (int k = 0;k<a.Length;k+=b<<1) {
long s=a[j+k],t=a[j+k+b]*w%mod;
a[j+k]=(s+t)%mod;
a[j+k+b]=(mod+s-t)%mod;
}
}
}
}
private static int Mi(int a){
a=(a+mod)%mod;
int b=mod,u=1,v=0;
while(b>0){
int t=a/b;
a-=t*b;(a,b)=(b,a);
u-=t*v;(u,v)=(v,u);
}
u%=mod;
if(u<0){u+=mod;}
return u%mod;
}
}
public class Sc{
public int I{get{return int.Parse(Console.ReadLine());}}
public long L{get{return long.Parse(Console.ReadLine());}}
public double D{get{return double.Parse(Console.ReadLine());}}
public string S{get{return Console.ReadLine();}}
public int[] Ia{get{return Array.ConvertAll(Console.ReadLine().Split(),int.Parse);}}
public long[] La{get{return Array.ConvertAll(Console.ReadLine().Split(),long.Parse);}}
public double[] Da{get{return Array.ConvertAll(Console.ReadLine().Split(),double.Parse);}}
public string[] Sa{get{return Console.ReadLine().Split();}}
public object[] Oa{get{return Console.ReadLine().Split();}}
public int[] Ia2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),int.Parse);}}
public int[] Ia3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),int.Parse);}
public int[] Ia3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split
        (),int.Parse);}
public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}}
public long[] La3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),long.Parse);}
public long[] La3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split
        (),long.Parse);}
public double[] Da2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),double.Parse);}}
public double[] Da3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),double.Parse);}
public double[] Da3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split
        (),double.Parse);}
public T[] Arr<T>(int n,Func<T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f();}return a;}
public T[] Arr<T>(int n,Func<int,T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i);}return a;}
public T[] Arr<T>(int n,Func<string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(Console.ReadLine().Split());}return a;}
public T[] Arr<T>(int n,Func<int,string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i,Console.ReadLine().Split());}return a;}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0