結果

問題 No.206 数の積集合を求めるクエリ
ユーザー ぴろずぴろず
提出日時 2015-05-08 23:15:10
言語 Java21
(openjdk 21)
結果
AC  
実行時間 884 ms / 7,000 ms
コード長 4,765 bytes
コンパイル時間 2,421 ms
コンパイル使用メモリ 77,576 KB
実行使用メモリ 48,380 KB
最終ジャッジ日時 2024-07-05 20:18:14
合計ジャッジ時間 11,860 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
36,800 KB
testcase_01 AC 50 ms
36,724 KB
testcase_02 AC 51 ms
36,864 KB
testcase_03 AC 50 ms
36,444 KB
testcase_04 AC 51 ms
36,688 KB
testcase_05 AC 52 ms
36,396 KB
testcase_06 AC 54 ms
36,704 KB
testcase_07 AC 53 ms
36,880 KB
testcase_08 AC 55 ms
36,552 KB
testcase_09 AC 56 ms
36,724 KB
testcase_10 AC 62 ms
37,180 KB
testcase_11 AC 93 ms
37,944 KB
testcase_12 AC 146 ms
39,160 KB
testcase_13 AC 113 ms
38,656 KB
testcase_14 AC 136 ms
39,168 KB
testcase_15 AC 130 ms
39,076 KB
testcase_16 AC 129 ms
38,940 KB
testcase_17 AC 106 ms
38,480 KB
testcase_18 AC 98 ms
38,436 KB
testcase_19 AC 104 ms
38,796 KB
testcase_20 AC 96 ms
38,540 KB
testcase_21 AC 89 ms
38,328 KB
testcase_22 AC 100 ms
38,728 KB
testcase_23 AC 108 ms
38,564 KB
testcase_24 AC 884 ms
48,288 KB
testcase_25 AC 826 ms
47,768 KB
testcase_26 AC 804 ms
48,380 KB
testcase_27 AC 544 ms
45,360 KB
testcase_28 AC 752 ms
47,476 KB
testcase_29 AC 745 ms
47,568 KB
testcase_30 AC 769 ms
46,768 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no206;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {
	static IO io = new IO();
	static final int MAX = 2 * 100000 / 64 + 5;
	public static void main(String[] args) {
		int l = io.nextInt();
		int m = io.nextInt();
		int n = io.nextInt();
		long[] a = new long[MAX];
		long[] b = new long[MAX];
		for(int i=0;i<l;i++) {
			setBit(a,io.nextInt());
		}
		for(int i=0;i<m;i++) {
			setBit(b,io.nextInt());
		}
//		print(a);
//		print(b);
		int q = io.nextInt();
		for(int i=0;i<q;i++) {
			io.println(andBitCount(a,b));
			shiftLeft(b);
//			print(b);
		}
		io.flush();
	}
	public static void setBit(long[] a,int i) {
		a[i/64] |= 1L << (long)(i % 64);
	}
	public static void shiftLeft(long[] a) {
		long e = 0;
		for(int i=0;i<MAX;i++) {
			long ne = a[i] >>> 63L;
			a[i] = (a[i] << 1) | e;
			e = ne;
		}
	}
	public static int andBitCount(long[] a,long[] b) {
		int count = 0;
		for(int i=0;i<MAX;i++) {
			count += Long.bitCount(a[i] & b[i]);
		}
		return count;
	}
	public static void print(long[] a) {
		for(int i=0;i<5;i++) {
			for(int j=0;j<64;j++) {
				System.out.print((a[i] >> j) & 1);
			}
		}
		System.out.println();
	}
}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	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;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(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 char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(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 char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	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 double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0