結果
| 問題 | No.1072 A Nice XOR Pair |
| ユーザー |
 Oland
|
| 提出日時 | 2020-06-05 21:36:13 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
AC
|
| 実行時間 | 423 ms / 2,000 ms |
| コード長 | 8,226 bytes |
| コンパイル時間 | 2,464 ms |
| コンパイル使用メモリ | 77,440 KB |
| 実行使用メモリ | 67,220 KB |
| 最終ジャッジ日時 | 2023-08-22 14:35:14 |
| 合計ジャッジ時間 | 5,365 ms |
|
ジャッジサーバーID （参考情報） |
judge13 / judge11 |
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 43 ms
49,504 KB |
| testcase_01 | AC | 43 ms
49,656 KB |
| testcase_02 | AC | 43 ms
49,436 KB |
| testcase_03 | AC | 43 ms
49,396 KB |
| testcase_04 | AC | 42 ms
49,420 KB |
| testcase_05 | AC | 43 ms
49,372 KB |
| testcase_06 | AC | 81 ms
52,584 KB |
| testcase_07 | AC | 423 ms
67,220 KB |
| testcase_08 | AC | 272 ms
56,192 KB |
| testcase_09 | AC | 224 ms
55,664 KB |
| testcase_10 | AC | 270 ms
56,432 KB |
| testcase_11 | AC | 279 ms
60,620 KB |
| testcase_12 | AC | 325 ms
63,192 KB |
ソースコード
import java.io.*;
import java.math.BigDecimal;
import java.util.*;
@SuppressWarnings("unused")
public class Main {
FastScanner in;
PrintWriter out;
final static int MOD = (int)1e9+7;
void solve(){
int N = in.nextInt(), X = in.nextInt();
int[] A = in.nextIntArray(N);
Counter<Integer> counter = new Counter<>();
long ans = 0;
for(int i = 0; i < N; i++){
ans += counter.get(A[i] ^ X);
counter.add(A[i]);
}
out.println(ans);
}
class Counter<T>{
HashMap<T, Long> map;
List<Map.Entry<T, Long>> listEntries;
long num = 0;
public Counter(){
map = new HashMap<T, Long>();
}
public long add(T e){
map.put(e, map.getOrDefault(e, 0L) + 1);
num++;
return map.get(e);
}
public long add(T e, long n){
map.put(e, map.getOrDefault(e, 0L) + n);
num += n;
return map.get(e);
}
public long get(T e){
return map.getOrDefault(e, 0L);
}
//要素eが集合に含まれない<=>mapにeのマッピングは存在しない
public boolean remove(T e){
if(!map.containsKey(e)) return false;
long c = map.get(e);
if(c == 1) map.remove(e);
else map.put(e, c - 1);
num--;
return true;
}
public boolean remove(T e, int n){
if(map.getOrDefault(e, 0L) < n) return false;
long c = map.get(e);
if(c == n) map.remove(e);
else map.put(e, c - n);
num -= n;
return true;
}
public boolean delete(T e){
if(!map.containsKey(e)) return false;
num -= map.get(e);
map.remove(e);
return true;
}
public boolean containsKey(T e){
return map.containsKey(e);
}
}
public static void main(String[] args) {
new Main().m();
}
private void m() {
in = new FastScanner(System.in);
out = new PrintWriter(System.out);
/*
try {
String path = "input.txt";
out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
}catch (IOException e){
e.printStackTrace();
}
*/
solve();
out.flush();
in.close();
out.close();
}
static class FastScanner {
private Reader input;
public FastScanner() {this(System.in);}
public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
public void close() {
try {
this.input.close();
} catch (IOException e) {
e.printStackTrace();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public long nextLong() {
try {
int sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
long ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) return ret * sign;
ret *= 10;
ret += b - '0';
}
} catch (IOException e) {
e.printStackTrace();
return -1;
}
}
public double nextDouble() {
try {
double sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
double ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) break;
ret *= 10;
ret += b - '0';
}
if (b != '.') return sign * ret;
double div = 1;
b = input.read();
while ('0' <= b && b <= '9') {
ret *= 10;
ret += b - '0';
div *= 10;
b = input.read();
}
return sign * ret / div;
} catch (IOException e) {
e.printStackTrace();
return Double.NaN;
}
}
public char nextChar() {
try {
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
return (char) b;
} catch (IOException e) {
e.printStackTrace();
return 0;
}
}
public String nextStr() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
while (b != -1 && !Character.isWhitespace(b)) {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public String nextLine() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (b != -1 && b != '\n') {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public int[] nextIntArray(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt();
}
return res;
}
public int[] nextIntArrayDec(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt() - 1;
}
return res;
}
public int[] nextIntArray1Index(int n) {
int[] res = new int[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextInt();
}
return res;
}
public long[] nextLongArray(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong();
}
return res;
}
public long[] nextLongArrayDec(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong() - 1;
}
return res;
}
public long[] nextLongArray1Index(int n) {
long[] res = new long[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextLong();
}
return res;
}
public double[] nextDoubleArray(int n) {
double[] res = new double[n];
for (int i = 0; i < n; i++) {
res[i] = nextDouble();
}
return res;
}
}
}