#960764 (C++23) No.2672 Subset Xor Sum

• 問題: No.2672 Subset Xor Sum
• ユーザー: じなぺ
• 提出日時: 2024-03-15 22:55:35
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 78 ms / 2,000 ms
• コード長: 1,795 bytes
• コンパイル時間: 2,986 ms
• コンパイル使用メモリ: 246,968 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-09-30 04:24:52
• 合計ジャッジ時間: 5,580 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
sample	AC * 2
other	AC * 66

ソースコード

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
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
//using mint = modint998244353;
//多倍長整数//
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
//using Bint = mp::cpp_int;
const int INF = 1e9;
const int MOD = 998244353;
const long long LINF = 4e18;
using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vvvvi = vector<vector<vector<vector<int>>>>;
using vvl = vector<vector<long long>>;
using vvvl = vector<vector<vector<long long>>>;
using vvvvl = vector<vector<vector<vector<long long>>>>;
using vvc = vector<vector<char>>;
using vvb = vector<vector<bool>>;
using vvvb = vector<vector<vector<bool>>>;
using vvvvb = vector<vector<vector<vector<bool>>>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define dump(x)  cout << #x << " = " << (x) << endl;
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define ALL(obj) (obj).begin(),(obj).end()
char dp[8192];
char ndp[8192];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vi a(n);
    rep(i,n) cin >> a[i];
    vi cnt(13);
    rep(i,n){
        rep(j,13){
            if(a[i] & (1<<j)) cnt[j]++;
        }
    }
    bool ok = true;
    rep(i,13) if(cnt[i]%2 != 0) ok = false;
    if(ok == false){
        cout << "No\n";
        return 0;
    }
    dp[0] = 1;
    rep(i,n){
        rep(j,8192){
            if(dp[0] == 2){
                cout << "Yes" << endl;
                return 0;
            }
            ndp[j] = 0;
        }
        rep(j,8192){
            if(dp[j] == 0) continue;
            if(dp[j] == 1){
                ndp[j] = 1;
                ndp[j^a[i]] = 2;
            }else{
                ndp[j] = 2;
                ndp[j^a[i]] = 2;
            }
        }
        swap(dp,ndp);
    }
    cout << "No" << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX