Submission #1778828
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
struct NumberTheoreticTransform
{
int mod;
int primitiveroot;
NumberTheoreticTransform(int mod, int root) : mod(mod), primitiveroot(root) {}
inline int mod_pow(int x, int n)
{
int ret = 1;
while(n > 0) {
if(n & 1) ret = mul(ret, x);
x = mul(x, x);
n >>= 1;
}
return ret;
}
inline int inverse(int x)
{
return (mod_pow(x, mod - 2));
}
inline int add(unsigned x, int y)
{
x += y;
if(x >= mod) x -= mod;
return (x);
}
inline int mul(int a, int b)
{
unsigned long long x = (long long) a * b;
unsigned xh = (unsigned) (x >> 32), xl = (unsigned) x, d, m;
asm("divl %4; \n\t" : "=a" (d), "=d" (m) : "d" (xh), "a" (xl), "r" (mod));
return (m);
}
void DiscreteFourierTransform(vector< int > &F, bool rev)
{
const int N = (int) F.size();
for(int i = 0, j = 1; j + 1 < N; j++) {
for(int k = N >> 1; k > (i ^= k); k >>= 1);
if(i > j) swap(F[i], F[j]);
}
int w, wn, s, t;
for(int i = 1; i < N; i <<= 1) {
w = mod_pow(primitiveroot, (mod - 1) / (i * 2));
if(rev) w = inverse(w);
for(int j = 0; j < N; j += i * 2) {
wn = 1;
for(int k = 0; k < i; k++) {
s = F[j + k], t = mul(F[j + k + i], wn);
F[j + k] = add(s, t), F[j + k + i] = add(s, mod - t);
wn = mul(wn, w);
}
}
}
if(rev) {
int temp = inverse(N);
for(int i = 0; i < N; i++) F[i] = mul(F[i], temp);
}
}
vector< int > Multiply(const vector< int > &A, const vector< int > &B)
{
int sz = 1;
while(sz < A.size() + B.size() - 1) sz <<= 1;
vector< int > F(sz), G(sz);
for(int i = 0; i < A.size(); i++) F[i] = A[i];
for(int i = 0; i < B.size(); i++) G[i] = B[i];
DiscreteFourierTransform(F, false);
DiscreteFourierTransform(G, false);
for(int i = 0; i < sz; i++) F[i] = mul(F[i], G[i]);
DiscreteFourierTransform(F, true);
F.resize(A.size() + B.size() - 1);
return (F);
}
};
// http://math314.hateblo.jp/entry/2015/05/07/014908
inline int add(unsigned x, int y, int mod)
{
x += y;
if(x >= mod) x -= mod;
return (x);
}
inline int mul(int a, int b, int mod)
{
unsigned long long x = (long long) a * b;
unsigned xh = (unsigned) (x >> 32), xl = (unsigned) x, d, m;
asm("divl %4; \n\t" : "=a" (d), "=d" (m) : "d" (xh), "a" (xl), "r" (mod));
return (m);
}
inline int mod_pow(int x, int n, int mod)
{
int ret = 1;
while(n > 0) {
if(n & 1) ret = mul(ret, x, mod);
x = mul(x, x, mod);
n >>= 1;
}
return ret;
}
inline int inverse(int x, int mod)
{
return (mod_pow(x, mod - 2, mod));
}
vector< int > AnyModNTTMultiply(vector< int > a, vector< int > b, int mod)
{
for(auto &x : a) x %= mod;
for(auto &x : b) x %= mod;
NumberTheoreticTransform ntt1(167772161, 3);
NumberTheoreticTransform ntt2(469762049, 3);
NumberTheoreticTransform ntt3(1224736769, 3);
auto x = ntt1.Multiply(a, b);
auto y = ntt2.Multiply(a, b);
auto z = ntt3.Multiply(a, b);
const int m1 = ntt1.mod, m2 = ntt2.mod, m3 = ntt3.mod;
const int m1_inv_m2 = inverse(m1, m2);
const int m12_inv_m3 = inverse(mul(m1, m2, m3), m3);
const int m12_mod = mul(m1, m2, mod);
vector< int > ret(x.size());
for(int i = 0; i < x.size(); i++) {
int v1 = mul(add(y[i], m2 - x[i], m2), m1_inv_m2, m2);
int v2 = mul(add(z[i], m3 - add(x[i], mul(m1, v1, m3), m3), m3), m12_inv_m3, m3);
ret[i] = add(x[i], add(mul(m1, v1, mod), mul(m12_mod, v2, mod), mod), mod);
}
return ret;
}
int main()
{
int N;
scanf("%d", &N);
vector< int > A(N + 1), B(N + 1);
for(int i = 0; i < N; i++) scanf("%d %d", &A[i + 1], &B[i + 1]);
auto C = AnyModNTTMultiply(A, B, 1e9 + 7);
for(int i = 1; i <= 2 * N; i++) printf("%d\n", C[i]);
}
Submission Info
Submission Time |
|
Task |
C - 高速フーリエ変換 |
User |
ei13333 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
3966 Byte |
Status |
AC |
Exec Time |
317 ms |
Memory |
5992 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:143:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &N);
^
./Main.cpp:145:66: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(int i = 0; i < N; i++) scanf("%d %d", &A[i + 1], &B[i + 1]);
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
00_sample_01 |
All |
00_sample_01, 01_00_01, 01_01_19, 01_02_31, 01_03_22, 01_04_31, 01_05_40, 01_06_15, 01_07_39, 01_08_28, 01_09_30, 01_10_23, 01_11_33, 01_12_11, 01_13_28, 01_14_41, 01_15_26, 01_16_49, 01_17_34, 01_18_02, 01_19_33, 01_20_29, 02_00_51254, 02_01_82431, 02_02_17056, 02_03_34866, 02_04_6779, 02_05_65534, 02_06_65535, 02_07_65536, 02_08_65537, 02_09_65538, 02_10_100000 |
Case Name |
Status |
Exec Time |
Memory |
00_sample_01 |
AC |
1 ms |
256 KB |
01_00_01 |
AC |
1 ms |
256 KB |
01_01_19 |
AC |
1 ms |
256 KB |
01_02_31 |
AC |
1 ms |
256 KB |
01_03_22 |
AC |
1 ms |
256 KB |
01_04_31 |
AC |
1 ms |
256 KB |
01_05_40 |
AC |
1 ms |
256 KB |
01_06_15 |
AC |
1 ms |
256 KB |
01_07_39 |
AC |
1 ms |
256 KB |
01_08_28 |
AC |
1 ms |
256 KB |
01_09_30 |
AC |
1 ms |
256 KB |
01_10_23 |
AC |
1 ms |
256 KB |
01_11_33 |
AC |
1 ms |
256 KB |
01_12_11 |
AC |
1 ms |
256 KB |
01_13_28 |
AC |
1 ms |
256 KB |
01_14_41 |
AC |
1 ms |
256 KB |
01_15_26 |
AC |
1 ms |
256 KB |
01_16_49 |
AC |
1 ms |
256 KB |
01_17_34 |
AC |
1 ms |
256 KB |
01_18_02 |
AC |
1 ms |
256 KB |
01_19_33 |
AC |
1 ms |
256 KB |
01_20_29 |
AC |
1 ms |
256 KB |
02_00_51254 |
AC |
153 ms |
3068 KB |
02_01_82431 |
AC |
311 ms |
5628 KB |
02_02_17056 |
AC |
69 ms |
1532 KB |
02_03_34866 |
AC |
146 ms |
2812 KB |
02_04_6779 |
AC |
17 ms |
768 KB |
02_05_65534 |
AC |
157 ms |
3440 KB |
02_06_65535 |
AC |
158 ms |
3440 KB |
02_07_65536 |
AC |
305 ms |
5372 KB |
02_08_65537 |
AC |
304 ms |
5372 KB |
02_09_65538 |
AC |
305 ms |
5372 KB |
02_10_100000 |
AC |
317 ms |
5992 KB |