Contest Duration: ~ (local time) (90 minutes) Back to Home

Submission #6907604

Source Code Expand

Copy
```import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
import java.math.BigInteger;

public class Main implements Runnable {

//static int mod = 1000000007;

public static void main(String[] args) {
new Thread(null, new Main(), "", 1024 * 1024 * 1024).start();
}

public void run() {
PrintWriter out = new PrintWriter(System.out);
FastScanner sc = new FastScanner();

int n = sc.nextInt();

long[] a = new long[n];
long[] b = new long[n];

for(int i=0;i<n;i++){
a[i] = sc.nextLong();
b[i] = sc.nextLong();
}

long[] ans = FastFourierTransform.multiply(a, b);

out.println(0);
for(int i=0;i<ans.length;i++){
out.println(Math.round(ans[i]));
}

out.flush();
}

static void test(int[] a){
for(int i=0;i<a.length-1;i++){
System.out.print(a[i]);
System.out.print(" ");
}
System.out.println(a[a.length-1]);
}
static void test(double[] a){
for(int i=0;i<a.length-1;i++){
System.out.print(a[i]);
System.out.print(" ");
}
System.out.println(a[a.length-1]);
}

}

class FastFourierTransform {

static Complex[] dft(Complex[] f, int n){
Complex[] nf = new Complex[n];
for(int i=0;i<f.length;i++){
nf[i] = f[i];
}
for(int i=f.length;i<n;i++){
nf[i] = new Complex(0,0);
}

fft(nf,false);
return nf;
}

static Complex[] invdft(Complex[] f, int n){
Complex[] nf = new Complex[n];
for(int i=0;i<f.length;i++){
nf[i] = f[i];
}
for(int i=f.length;i<n;i++){
nf[i] = new Complex(0,0);
}

fft(nf,true);

return nf;
}

static Complex[] multiply(Complex[] g, Complex[] h){
int n = up2Pow(g.length + h.length + 1);

Complex[] gg = dft(g,n);
Complex[] hh = dft(h,n);

Complex[] ff = new Complex[n];
for(int i=0;i<n;i++){
ff[i] = gg[i].multiply(hh[i]);
}

return invdft(ff,n);
}

static long[] multiply(long[] a, long[] b){
Complex[] x = new Complex[a.length];
Complex[] y = new Complex[b.length];

for(int i=0;i<a.length;i++){
x[i] = new Complex(a[i],0);
}

for(int i=0;i<b.length;i++){
y[i] = new Complex(b[i],0);
}

Complex[] tmp = FastFourierTransform.multiply(x, y);

long[] ans = new long[a.length + b.length - 1];

for(int i=0;i<a.length + b.length - 1;i++){
ans[i] = Math.round(tmp[i].real);
}

return ans;
}

static void fft(Complex[] f, boolean inv){
int n = f.length; //2冪

//添字のバタフライ
for(int i=1,j=0; i<n; i++){
int m = n>>1;
for(; j>=m; m>>=1){
j -= m;
}
j+=m;
if(i<j){
Complex tmp = new Complex(f[i].real, f[i].img);
f[i] = f[j];
f[j] = tmp;
}
}

for(int len = 2;len<=n; len <<= 1){
int h = len>>1;
double theta = 2*Math.PI / len;
if(inv){
theta = -theta;
}

Complex z = new Complex(Math.cos(theta), Math.sin(theta));

for(int i=0;i<n;i+=len){
Complex w = new Complex(1,0);

for(int j=0;j<h;j++){
Complex u = new Complex(f[i+j].real,f[i+j].img);
Complex v = w.multiply(f[i+j+h]);
f[i+j] = u.plus(v);
f[i+j+h] = u.minus(v);
w = w.multiply(z);
}
}
}

if(inv){
for(int i=0;i<n;i++){
f[i] = f[i].divide(n);
}
}
}

//n以上の最小の2ベキ
static int up2Pow(int n){

if(n <= 0){
return 0;
}
if ((n&(n-1)) == 0){ //このときはn自身が2ベキ
return n;
}

int ret = 1;

while(n > 0){
ret<<=1;
n>>=1;
}

return ret;
}

}

class Complex {
double real;
double img;

public Complex(double real, double img){
this.real = real;
this.img = img;
}

Complex plus(Complex y){
return new Complex(this.real+y.real, this.img+y.img);
}

Complex minus(Complex y){
return new Complex(this.real - y.real, this.img - y.img);
}

Complex multiply(Complex y){
return new Complex(this.real*y.real - this.img*y.img, this.real*y.img + this.img*y.real);
}

//共役
Complex conjugate(){
return new Complex(this.real, -this.img);
}

Complex divide(double y){
return new Complex(this.real/y, this.img/y);
}
}

class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
if (hasNextByte())
return buffer[ptr++];
else
return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[ptr]))
ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext())
throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
}
return sb.toString();
}
public long nextLong() {
if (!hasNext())
throw new NoSuchElementException();
long n = 0;
boolean minus = false;
if (b == '-') {
minus = true;
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
throw new NumberFormatException();
return (int) nl;
}
public int[] nextintArray(int n){
int[] a = new int[n];
for(int i=0;i<n;i++){
a[i] = nextInt();
}
return a;
}
public long[] nextlongArray(int n){
long[] a = new long[n];
for(int i=0;i<n;i++){
a[i] = nextLong();
}
return a;
}
public Integer[] nextIntegerArray(int n){
Integer[] a = new Integer[n];
for(int i=0;i<n;i++){
a[i] = nextInt();
}
return a;
}
public int[][] nextintMatrix(int h, int w){
int[][] mat = new int[h][w];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
mat[i][j] = nextInt();
}
}
return mat;
}
public double nextDouble() {
return Double.parseDouble(next());
}
}```

#### Submission Info

Submission Time 2019-08-15 00:29:49+0900 C - 高速フーリエ変換 warachia Java8 (OpenJDK 1.8.0) 0 6974 Byte MLE 919 ms 275592 KB

#### Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 00_sample_01
All 0 / 100 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 70 ms 20564 KB
01_00_01 72 ms 21076 KB
01_01_19 72 ms 23380 KB
01_02_31 72 ms 20052 KB
01_03_22 73 ms 23636 KB
01_04_31 72 ms 21076 KB
01_05_40 72 ms 23508 KB
01_06_15 71 ms 20436 KB
01_07_39 72 ms 20052 KB
01_08_28 73 ms 23124 KB
01_09_30 72 ms 20948 KB
01_10_23 73 ms 20820 KB
01_11_33 72 ms 20948 KB
01_12_11 73 ms 20948 KB
01_13_28 74 ms 23124 KB
01_14_41 75 ms 23380 KB
01_15_26 73 ms 20180 KB
01_16_49 76 ms 21588 KB
01_17_34 73 ms 21460 KB
01_18_02 71 ms 20564 KB
01_19_33 71 ms 19924 KB
01_20_29 74 ms 20436 KB
02_00_51254 421 ms 197600 KB
02_01_82431 916 ms 270156 KB
02_02_17056 255 ms 109308 KB
02_03_34866 394 ms 194664 KB
02_04_6779 167 ms 54848 KB
02_05_65534 450 ms 199208 KB
02_06_65535 443 ms 197676 KB
02_07_65536 901 ms 273188 KB
02_08_65537 907 ms 275592 KB
02_09_65538 893 ms 271192 KB
02_10_100000 919 ms 275284 KB