結果

問題 No.1068 #いろいろな色 / Red and Blue and more various colors (Hard)
ユーザー 37zigen37zigen
提出日時 2020-06-11 19:39:03
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 4,654 bytes
コンパイル時間 2,944 ms
コンパイル使用メモリ 75,412 KB
実行使用メモリ 80,508 KB
最終ジャッジ日時 2023-09-06 08:30:20
合計ジャッジ時間 11,467 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
49,020 KB
testcase_01 AC 40 ms
49,044 KB
testcase_02 AC 41 ms
49,360 KB
testcase_03 AC 305 ms
57,732 KB
testcase_04 AC 249 ms
56,568 KB
testcase_05 AC 263 ms
57,244 KB
testcase_06 AC 207 ms
56,584 KB
testcase_07 AC 186 ms
56,780 KB
testcase_08 AC 249 ms
56,928 KB
testcase_09 AC 280 ms
57,136 KB
testcase_10 AC 163 ms
54,960 KB
testcase_11 AC 181 ms
56,528 KB
testcase_12 AC 149 ms
56,260 KB
testcase_13 TLE -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main {
	public static void main(String[] args) {
		new Main().run();
	}
	
	final long MOD=998244353;

	void run() {
		FastScanner sc=new FastScanner();
		int N=sc.nextInt();
		int Q=sc.nextInt();
		long[] A=new long[N];
		int[] B=new int[Q];
		ArrayDeque<long[]> dq=new ArrayDeque<>();
		for (int i=0;i<N;++i) {
			A[i]=sc.nextLong();
			dq.add(new long[] {A[i]-1,1});
		}
		for (int i=0;i<Q;++i) {
			B[i]=sc.nextInt();
		}
		while (dq.size()>=2) {
			long[] a=dq.pollFirst();
			long[] b=dq.pollFirst();
			dq.addLast(mul(a,b,MOD,3));
		}
		PrintWriter pw=new PrintWriter(System.out);
		long[] dp=dq.poll();
		for (int i=0;i<Q;++i) {
			pw.println(dp[B[i]]);
		}
		pw.close();
	}
	

	long[] mul(long[] a, long[] b, long MODULO, long root) {
		int n = Integer.highestOneBit(a.length + b.length) << 1;
		a = Arrays.copyOf(a, n);
		b = Arrays.copyOf(b, n);
		a = fft(a, false, MODULO, root);
		b = fft(b, false, MODULO, root);
		for (int i = 0; i < n; ++i)
			a[i] = a[i] * b[i] % MODULO;
		a = fft(a, true, MODULO, root);
		long inv = inv(n, MODULO);
		for (int i = 0; i < n; ++i) {
			a[i] = a[i] * inv % MODULO;
		}
		int p=a.length;
		while (p>10 && a[p-1]==0) --p;
		if (p!=a.length) a=Arrays.copyOf(a, p);
		return a;
	}

	long[] fft(long[] a, boolean inv, long MODULO, long root) {
		int n = a.length;
		int c = 0;
		for (int i = 1; i < n; ++i) {
			for (int j = n >> 1; j > (c ^= j); j >>= 1)
				;
			if (c > i) {
				long d = a[i];
				a[i] = a[c];
				a[c] = d;
			}
		}
		for (int i = 1; i < n; i *= 2) {
			long w = pow(root, (MODULO - 1) / (2 * i), MODULO);
			if (inv)
				w = inv(w, MODULO);
			for (int j = 0; j < n; j += 2 * i) {
				long wn = 1;
				for (int k = 0; k < i; ++k) {
					long u = a[j + k];
					long v = a[j + k + i] * wn % MODULO;
					a[j + k] = (u + v) % MODULO;
					a[j + k + i] = (u - v + MODULO) % MODULO;
					wn = wn * w % MODULO;
				}
			}
		}
		return a;
	}

	long pow(long a, long n, long MODULO) {
		long ret = 1;
		for (; n > 0; n >>= 1, a = a * a % MODULO) {
			if (n % 2 == 1)
				ret = ret * a % MODULO;
		}
		return ret;
	}
	
	long inv(long a, long mod) {
		long b = mod;
		long p = 1, q = 0;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
		}
		return p < 0 ? p + mod : p;
	}
	
	void tr(Object...o) {System.out.println(Arrays.deepToString(o));}
}

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 double nextDouble() { return Double.parseDouble(next());}
}
0