結果
問題 | No.206 数の積集合を求めるクエリ |
ユーザー | tenten |
提出日時 | 2023-01-27 09:30:11 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 6,480 ms / 7,000 ms |
コード長 | 3,259 bytes |
コンパイル時間 | 2,535 ms |
コンパイル使用メモリ | 89,736 KB |
実行使用メモリ | 47,296 KB |
最終ジャッジ日時 | 2024-06-27 21:33:42 |
合計ジャッジ時間 | 44,359 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
37,096 KB |
testcase_01 | AC | 50 ms
37,080 KB |
testcase_02 | AC | 51 ms
37,072 KB |
testcase_03 | AC | 52 ms
37,152 KB |
testcase_04 | AC | 51 ms
37,096 KB |
testcase_05 | AC | 54 ms
37,260 KB |
testcase_06 | AC | 86 ms
38,616 KB |
testcase_07 | AC | 83 ms
38,332 KB |
testcase_08 | AC | 91 ms
38,744 KB |
testcase_09 | AC | 81 ms
38,560 KB |
testcase_10 | AC | 51 ms
36,808 KB |
testcase_11 | AC | 52 ms
36,988 KB |
testcase_12 | AC | 118 ms
39,416 KB |
testcase_13 | AC | 102 ms
38,792 KB |
testcase_14 | AC | 109 ms
38,748 KB |
testcase_15 | AC | 104 ms
38,724 KB |
testcase_16 | AC | 95 ms
38,904 KB |
testcase_17 | AC | 266 ms
45,784 KB |
testcase_18 | AC | 209 ms
44,488 KB |
testcase_19 | AC | 277 ms
45,524 KB |
testcase_20 | AC | 214 ms
44,504 KB |
testcase_21 | AC | 234 ms
45,524 KB |
testcase_22 | AC | 211 ms
44,692 KB |
testcase_23 | AC | 260 ms
45,740 KB |
testcase_24 | AC | 6,282 ms
47,296 KB |
testcase_25 | AC | 6,208 ms
46,664 KB |
testcase_26 | AC | 6,480 ms
45,688 KB |
testcase_27 | AC | 3,238 ms
46,096 KB |
testcase_28 | AC | 5,508 ms
46,148 KB |
testcase_29 | AC | 5,955 ms
46,448 KB |
testcase_30 | AC | 3,445 ms
46,724 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int l = sc.nextInt(); int m = sc.nextInt(); int n = sc.nextInt(); BitArray a = new BitArray(n); for (int i = 0; i < l; i++) { a.setBit(sc.nextInt() - 1); } BitArray b = new BitArray(n); for (int i = 0; i < m; i++) { b.setBit(sc.nextInt() - 1); } int q = sc.nextInt(); StringBuilder sb = new StringBuilder(); for (int i = 0; i < q; i++) { sb.append(a.getAndCount(b)).append("\n"); a.shift(); } System.out.print(sb); } static class BitArray { long[] arr; int size; int counter = 0; public BitArray(int x) { size = (x + 60 - 1) / 60; arr = new long[size]; } public BitArray(int size, long[] arr) { this.size = size; this.arr = arr; } public void setBit(int x) { arr[x / 60] |= (1L << (x % 60)); } public void shift() { long add = 0; for (int i = size - 1; i >= 0; i--) { arr[i] += (add << 60); add = arr[i] % 2; arr[i] >>= 1; } counter++; if (counter >= 60) { size--; counter = 0; } } public long getAndCount(BitArray x) { long count = 0; for (int i = 0; i < size; i++) { count += pitCount(arr[i] & x.arr[i]); } return count; } private long pitCount(long x) { long count = 0; while (x > 0) { count += x % 2; x >>= 1; } return count; } } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }