結果
問題 | No.206 数の積集合を求めるクエリ |
ユーザー | 37zigen |
提出日時 | 2017-02-17 02:39:20 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,357 ms / 7,000 ms |
コード長 | 2,581 bytes |
コンパイル時間 | 2,154 ms |
コンパイル使用メモリ | 74,388 KB |
実行使用メモリ | 101,960 KB |
最終ジャッジ日時 | 2023-08-29 05:53:25 |
合計ジャッジ時間 | 24,376 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 124 ms
55,816 KB |
testcase_01 | AC | 122 ms
55,580 KB |
testcase_02 | AC | 124 ms
55,812 KB |
testcase_03 | AC | 123 ms
55,556 KB |
testcase_04 | AC | 126 ms
55,824 KB |
testcase_05 | AC | 139 ms
55,752 KB |
testcase_06 | AC | 227 ms
59,212 KB |
testcase_07 | AC | 220 ms
59,236 KB |
testcase_08 | AC | 231 ms
59,280 KB |
testcase_09 | AC | 236 ms
59,340 KB |
testcase_10 | AC | 123 ms
55,548 KB |
testcase_11 | AC | 138 ms
55,852 KB |
testcase_12 | AC | 262 ms
60,452 KB |
testcase_13 | AC | 254 ms
59,468 KB |
testcase_14 | AC | 250 ms
60,236 KB |
testcase_15 | AC | 229 ms
59,272 KB |
testcase_16 | AC | 243 ms
59,776 KB |
testcase_17 | AC | 1,215 ms
95,484 KB |
testcase_18 | AC | 1,073 ms
95,380 KB |
testcase_19 | AC | 1,040 ms
101,448 KB |
testcase_20 | AC | 1,024 ms
94,864 KB |
testcase_21 | AC | 1,047 ms
101,960 KB |
testcase_22 | AC | 1,166 ms
96,168 KB |
testcase_23 | AC | 1,174 ms
91,340 KB |
testcase_24 | AC | 1,357 ms
96,976 KB |
testcase_25 | AC | 1,345 ms
96,196 KB |
testcase_26 | AC | 1,167 ms
96,528 KB |
testcase_27 | AC | 1,215 ms
96,520 KB |
testcase_28 | AC | 1,267 ms
94,560 KB |
testcase_29 | AC | 1,300 ms
94,220 KB |
testcase_30 | AC | 1,320 ms
97,560 KB |
ソースコード
import java.io.PrintWriter; import java.util.Scanner; class Main { static int L, M, N, Q; static int[] A, B; public static void main(String[] args) { Scanner sc = new Scanner(System.in); PrintWriter pw=new PrintWriter(System.out); L = sc.nextInt(); M = sc.nextInt(); N = sc.nextInt(); int[] A = new int[N + 1]; int[] B = new int[N + 1]; for (int i = 0; i < L; ++i) { A[sc.nextInt()] = 1; } for (int i = 0; i < M; ++i) { B[N - sc.nextInt()] = 1; } Q = sc.nextInt(); Complex[] mul = mul(A, B); for (int i = 0; i < Q; ++i) { pw.println(Math.round(mul[N+i].re)); } pw.close(); } static Complex[] mul(int[] a, int[] b) { int n = 1; while (n < a.length + b.length) n *= 2; Complex[] ac = new Complex[n]; Complex[] bc = new Complex[n]; for (int i = 0; i < n; ++i) { ac[i] = new Complex(0, 0); bc[i] = new Complex(0, 0); } for (int i = 0; i < a.length; ++i) { ac[i].re = a[i]; } for (int i = 0; i < b.length; ++i) { bc[i].re = b[i]; } ac = fft(ac, false); bc = fft(bc, false); for (int i = 0; i < ac.length; ++i) { ac[i] = ac[i].mul(bc[i]); } ac = fft(ac, true); for (int i = 0; i < ac.length; ++i) { ac[i].re /= n; ac[i].co /= n; } return ac; } static Complex[] fft(Complex[] a, boolean rev) { int n = a.length; if (n == 1) return a; int c = 0; for (int i = 1; i < n; ++i) { int j; for (j = n >> 1; j > (c ^= j); j >>= 1) ; if (c > i) { Complex tmp = a[c]; a[c] = a[i]; a[i] = tmp; } } for (int d = 1; d < n; d <<= 1) { for (int j = 0; j < d; ++j) { Complex mul = exp(2 * Math.PI / (2 * d) * (rev ? -1 : 1) * j); for (int pos = 0; pos < n; pos += 2 * d) { double ure = a[pos + j].re; double uco = a[pos + j].co; double vre = a[pos + j + d].re * mul.re - a[pos + j + d].co * mul.co; double vco = a[pos + j + d].co * mul.re + a[pos + j + d].re * mul.co; a[pos + j].re = ure + vre; a[pos + j].co = uco + vco; a[pos + j + d].re = ure - vre; a[pos + j + d].co = uco - vco; } } } return a; } static class Complex { double re, co; public Complex(double re, double co) { this.re = re; this.co = co; } Complex add(Complex o) { return new Complex(re + o.re, co + o.co); } Complex subtract(Complex o) { return new Complex(re - o.re, co - o.co); } Complex mul(Complex o) { return new Complex(re * o.re - co * o.co, re * o.co + o.re * co); } } static Complex exp(double theta) { return new Complex(Math.cos(theta), Math.sin(theta)); } }