結果

問題 No.1072 A Nice XOR Pair
ユーザー fairy_lettucefairy_lettuce
提出日時 2020-06-05 21:26:20
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 4,642 bytes
コンパイル時間 917 ms
コンパイル使用メモリ 108,800 KB
実行使用メモリ 29,056 KB
最終ジャッジ日時 2024-05-09 19:55:58
合計ジャッジ時間 3,264 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 23 ms
18,816 KB
testcase_01 AC 22 ms
19,072 KB
testcase_02 AC 22 ms
18,816 KB
testcase_03 AC 23 ms
18,944 KB
testcase_04 WA -
testcase_05 AC 22 ms
19,072 KB
testcase_06 AC 25 ms
19,328 KB
testcase_07 AC 240 ms
29,056 KB
testcase_08 AC 215 ms
28,928 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 229 ms
28,928 KB
testcase_12 AC 247 ms
28,928 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace AtCoder.Contest.C
{
	static class Program
	{
		public static void Main(string[] args)
		{
			var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
			Console.SetOut(sw);

			var cin = new Scanner();

			int n = cin.NextInt();
			long x = cin.NextLong();
			var a = cin.ArrayLong(n).ToList();
			a.Sort();
			var b = new List<long>();
            for (int i = 0; i < n; i++)
            {
				b.Add(a[i] ^ x);
            }
			
			long ans = 0;

            for (int i = 0; i < n; i++)
            {
				ans += a.UpperBound(b[i]) - a.LowerBound(b[i]);
            }
            Console.WriteLine(ans / 2);

			Console.Out.Flush();
		}
	}

	static class BinarySearch
	{
		public static int UpperBound<T>(T[] array, T value) => UpperBound(array, 0, array.Length - 1, value, Comparer<T>.Default);

		public static int UpperBound<T>(T[] array, T value, Comparer<T> comparer) => UpperBound(array, 0, array.Length - 1, value, comparer);

		public static int UpperBound<T>(T[] array, int index, int length, T value) => UpperBound(array, index, length, value, Comparer<T>.Default);

		public static int UpperBound<T>(T[] array, int index, int length, T value, Comparer<T> comparer)
		{
			var l = index;
			var r = l + length - 1;
			while (l <= r)
			{
				var mid = l + (r - l) / 2;
				var res = comparer.Compare(array[mid], value);
				if (res <= 0) l = mid + 1;
				else r = mid - 1;
			}
			return l;
		}

		public static int UpperBound<T>(this List<T> list, T item) => list.UpperBound(0, list.Count, item, Comparer<T>.Default);

		public static int UpperBound<T>(this List<T> list, T item, Comparer<T> comparer) => list.UpperBound(0, list.Count, item, comparer);

		public static int UpperBound<T>(this List<T> list, int index, int count, T item, Comparer<T> comparer)
		{
			var l = index;
			var r = l + count - 1;
			while (l <= r)
			{
				var mid = l + (r - l) / 2;
				var res = comparer.Compare(list[mid], item);
				if (res <= 0) l = mid + 1;
				else r = mid - 1;
			}
			return l;
		}

		public static int LowerBound<T>(T[] array, T value) => LowerBound(array, 0, array.Length - 1, value, Comparer<T>.Default);

		public static int LowerBound<T>(T[] array, T value, Comparer<T> comparer) => LowerBound(array, 0, array.Length - 1, value, comparer);

		public static int LowerBound<T>(T[] array, int index, int length, T value) => LowerBound(array, index, length, value, Comparer<T>.Default);

		public static int LowerBound<T>(T[] array, int index, int length, T value, Comparer<T> comparer)
		{
			var l = index;
			var r = l + length - 1;
			while (l <= r)
			{
				var mid = l + (r - l) / 2;
				var res = comparer.Compare(array[mid], value);
				if (res == -1) l = mid + 1;
				else r = mid - 1;
			}
			return l;
		}

		public static int LowerBound<T>(this List<T> list, T item) => list.LowerBound(0, list.Count, item, Comparer<T>.Default);

		public static int LowerBound<T>(this List<T> list, T item, Comparer<T> comparer) => list.LowerBound(0, list.Count, item, comparer);

		public static int LowerBound<T>(this List<T> list, int index, int count, T item, Comparer<T> comparer)
		{
			var l = index;
			var r = l + count - 1;
			while (l <= r)
			{
				var mid = l + (r - l) / 2;
				var res = comparer.Compare(list[mid], item);
				if (res == -1) l = mid + 1;
				else r = mid - 1;
			}
			return l;
		}
	}

	class Scanner
	{
		string[] s;
		int i;

		char[] cs = new char[] { ' ' };

		public Scanner()
		{
			s = new string[0];
			i = 0;
		}

		public string Next()
		{
			if (i < s.Length) return s[i++];
			string st = Console.ReadLine();
			while (st == "") st = Console.ReadLine();
			s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
			if (s.Length == 0) return Next();
			i = 0;
			return s[i++];
		}

		public int NextInt()
		{
			return int.Parse(Next());
		}

		public int[] ArrayInt(int N, int add = 0)
		{
			int[] Array = new int[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = NextInt() + add;
			}
			return Array;
		}

		public long NextLong()
		{
			return long.Parse(Next());
		}

		public long[] ArrayLong(int N, long add = 0)
		{
			long[] Array = new long[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = NextLong() + add;
			}
			return Array;
		}

		public double NextDouble()
		{
			return double.Parse(Next());
		}

		public double[] ArrayDouble(int N, double add = 0)
		{
			double[] Array = new double[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = NextDouble() + add;
			}
			return Array;
		}
	}
}
0