#743722 (C++17) No.1863 Xor Sum 2...?

• 問題: No.1863 Xor Sum 2...?
• ユーザー: Be11T_
• 提出日時: 2022-03-05 00:25:03
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 30 ms / 2,000 ms
• コード長: 1,913 bytes
• コンパイル時間: 4,111 ms
• コンパイル使用メモリ: 252,328 KB
• 最終ジャッジ日時: 2025-01-28 06:58:18
• ジャッジサーバーID （参考情報）: judge3 / judge4

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

ソースコード

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
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, m, n) for(ll i = m; i <= n; i++)
#define rrep(i, m, n) for(ll i = m; i >= n; i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define SZ(a) ((ll)(a).size())
#define bit(n, k) ((n >> k) & 1)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const int dx[4] = { -1, 1, 0, 0 };
const int dy[4] = { 0, 0, 1, -1 };
const int inf = 1e9 + 1;
const ll INF = 1e18;
const double pi = acos(-1);
using Graph = vector<vector<ll>>;
using REV_PQ = priority_queue<ll, vector<ll>, greater<ll>>;
using PQ = priority_queue<ll>;
//typedef atcoder::modint998244353 mint;
typedef atcoder::modint1000000007 mint;
const int SIZE = 200010;
ll powll(ll n, ll x) {
    // return n ^ x;
    ll ret = 1;
    rep(i, x) ret *= n;
    return ret;
}
/*struct Edge { ll u, v, cost; };
bool comp(const Edge& e1, const Edge& e2) {
    return e1.cost < e2.cost;
}*/
void OutputYesNo(bool val) {
    if (val) cout << "Yes" << endl;
    else cout << "No" << endl;
}
void OutputTakahashiAoki(bool val) {
    if (val) cout << "Takahashi" << endl;
    else cout << "Aoki" << endl;
}
void OutPutInteger(ll x) { cout << x << endl; }
void OutPutString(string x) { cout << x << endl; }
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    vector<ll> a(n), b(n);
    rep(i, n) cin >> a[i];
    rep(i, n) cin >> b[i];
    int res = 0;
    rep(i, n){
        ll a_sum = 0;
        ll a_xor = 0;
        ll b_xor = 0;
        rep(j, 33) {
            if (i + j >= n) break;
            a_sum += a[i + j];
            a_xor ^= a[i + j];
            b_xor ^= b[i + j];
            if (a_sum - a_xor == b_xor) res++;
        }
    }
    OutPutInteger(res);
 }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX