結果

問題 No.1240 Or Sum of Xor Pair
ユーザー uwiuwi
提出日時 2020-09-25 22:01:28
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,223 bytes
コンパイル時間 4,004 ms
コンパイル使用メモリ 92,164 KB
実行使用メモリ 59,644 KB
最終ジャッジ日時 2024-06-28 06:36:28
合計ジャッジ時間 28,780 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 487 ms
54,980 KB
testcase_01 AC 482 ms
55,064 KB
testcase_02 AC 611 ms
54,860 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 488 ms
55,288 KB
testcase_28 AC 494 ms
55,316 KB
testcase_29 AC 607 ms
55,800 KB
testcase_30 WA -
testcase_31 AC 526 ms
55,424 KB
testcase_32 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200925;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), X = ni();
		int[] a = na(n);
		int[][] b = new int[1<<9][1<<9];
		for(int v : a){
			b[v>>>9][v&511]++;
		}

		long ans = 0;

		for(int i = 0;i < 512;i++){
			int[] f = new int[512];
			long base = 0;
			for(int j = i+1;j < 512;j++){
				if((i^j) < X>>>9){
					long fsum = 0;
					for(int k = 0;k < 512;k++){
						f[k] += b[j][k];
						fsum += b[j][k];
					}
					base += (i|j)*fsum;
				}
				if((i^j) == X>>>9){
					tr(i, j, X);
					for(int l = 0;l < 512;l++){
						for(int k = 0;k < 512;k++){
							ans += (long)b[i][l] * b[j][k] * (i<<9|l|j<<9|k);
						}
					}
				}
			}
			long bsum = 0;
			for(int j = 0;j < 512;j++)bsum += b[i][j];
			base = base * bsum * (1<<9);
			ans += base;

			for(int j = 0;j < 512;j++){
				for(int k = 0;k < 512;k++){
					ans += (long)b[i][j] * f[k] * (j|k);
				}
			}
		}

		for(int i = 0;i < 512;i++){
			long ct = 0;
			for(int j = 0;j < 512;j++){
				for(int k = j+1;k < 512;k++){
					if((j^k) < X) {
						ans += (long) b[i][j] * b[i][k] * (j | k);
						ct += (long) b[i][j] * b[i][k];
					}
				}
				ans += (long) b[i][j] * (b[i][j]-1)/2 * j;
				ct += (long)b[i][j] * (b[i][j]-1)/2;
			}
			ans += ct * (i<<9);
		}

		out.println(ans);
}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new E().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0