AtCoder Typical Contest 001

Submission #6903311

Source codeソースコード

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);
		}
		
		return fft(nf,n,false);
	}
	
	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);
		}
		
		Complex[] ans = fft(nf,n,true);
		for(int i=0;i<n;i++){
			ans[i] = ans[i].divide(n);
		}

		return ans;
	}
	
	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;
	}
	
	//nは2冪
	static Complex[] fft(Complex[] f, int n, boolean inv){
		if(n == 1){
			return f;
		}
		
		int m = n/2;
		
		Complex[] f0 = new Complex[m];
		Complex[] f1 = new Complex[m];
		
		for(int i=0;i<m;i++){
			f0[i] = f[2*i];
			f1[i] = f[2*i+1];
		}
		
		f0 = fft(f0,m,inv);
		f1 = fft(f1,m,inv);
		
		Complex zeta = new Complex(Math.cos(2*Math.PI/n),Math.sin(2*Math.PI/n));
		if(inv){
			zeta = zeta.conjugate();
		}
		
		Complex pow_zeta = new Complex(1,0);
		
		for(int i=0;i<n;i++){
			f[i] = f0[i%m].sum(pow_zeta.multiply(f1[i%m]));
			pow_zeta = pow_zeta.multiply(zeta);
		}
		
		return f;
	}
	
	//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 sum(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 {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() {
		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();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		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();
			}
			b = readByte();
		}
	}
	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

Task問題 C - 高速フーリエ変換
User nameユーザ名 warachia
Created time投稿日時
Language言語 Java8 (OpenJDK 1.8.0)
Status状態 MLE
Score得点 0
Source lengthソースコード長 6672 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
Sample - 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
00_sample_01 AC 73 ms 19668 KB
01_00_01 AC 75 ms 20948 KB
01_01_19 AC 77 ms 23252 KB
01_02_31 AC 75 ms 22100 KB
01_03_22 AC 73 ms 19924 KB
01_04_31 AC 75 ms 20564 KB
01_05_40 AC 74 ms 21460 KB
01_06_15 AC 74 ms 23508 KB
01_07_39 AC 75 ms 25428 KB
01_08_28 AC 74 ms 20692 KB
01_09_30 AC 74 ms 18644 KB
01_10_23 AC 74 ms 20692 KB
01_11_33 AC 77 ms 23380 KB
01_12_11 AC 74 ms 21588 KB
01_13_28 AC 75 ms 20820 KB
01_14_41 AC 76 ms 20692 KB
01_15_26 AC 74 ms 25428 KB
01_16_49 AC 77 ms 21332 KB
01_17_34 AC 76 ms 19796 KB
01_18_02 AC 74 ms 21204 KB
01_19_33 AC 76 ms 23380 KB
01_20_29 AC 77 ms 22868 KB
02_00_51254 AC 590 ms 199820 KB
02_01_82431 MLE
02_02_17056 AC 474 ms 110516 KB
02_03_34866 AC 575 ms 197540 KB
02_04_6779 AC 254 ms 59696 KB
02_05_65534 AC 622 ms 203264 KB
02_06_65535 AC 645 ms 204668 KB
02_07_65536 MLE
02_08_65537 MLE
02_09_65538 MLE
02_10_100000 MLE