#647906 (C++14) No.1456 Range Xor

• 問題: No.1456 Range Xor
• ユーザー: karinohito
• 提出日時: 2021-04-14 22:53:54
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 111 ms / 2,000 ms
• コード長: 1,919 bytes
• コンパイル時間: 1,070 ms
• コンパイル使用メモリ: 109,784 KB
• 実行使用メモリ: 8,832 KB
• 最終ジャッジ日時: 2024-06-30 21:43:24
• 合計ジャッジ時間: 5,795 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 46

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
//#include <atcoder/all>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<int>>;
vector<ll> ISP;
ll M = 1500005;
void PP(ll M) {
    ISP.assign(M + 1, -1);
    for (ll i = 2; i <= M; i++) {
        ISP[i] = i;
    }
    ISP[0] = -1;
    ISP[1] = -1;
    for (ll i = 2; i * i <= M; i++) {
        if (ISP[i] == i) {
            for (ll j = 2; i * j <= M; j++) {
                if (ISP[i * j] != i * j)continue;
                ISP[i * j] = i;
            }
        }
    }
}
vector<ll> Dk(70);
ll mod = 1e9 + 7;
void Ks(ll K) {
    rep(i, 70) {
        Dk[i] = 0;
    }
    Dk[0] = K;
    rep(i, 69) {
        Dk[i + 1] = Dk[i] * Dk[i];
        Dk[i + 1] %= mod;
    }
}
ll GG(ll Ps) {
    ll P = Ps;
    ll res = 1;
    rep(i, 70) {
        if (P % 2 != 0) {
            res *= Dk[i];
            res %= mod;
        }
        P /= 2;
    }
    return res;
}
int main() {
    ll N;
    ll K;
    cin >> N>>K;
    vll A(N);
    set<ll> B;
    B.insert(K);
    rep(i, N) {
        cin >> A[i];
        K = K ^ A[i];
        B.insert(K);
    }
    bool C = false;
    ll P = A[0];
    if (B.count(P))C = true;
    rep(i, N-1) {
        P = P ^ A[i + 1];
        if (B.count(P))C = true;
    }
    if (C)cout << "Yes" << endl;
    else cout << "No" << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX