結果
問題 | No.2672 Subset Xor Sum |
ユーザー |
|
提出日時 | 2024-03-15 22:41:23 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 84 ms / 2,000 ms |
コード長 | 4,788 bytes |
コンパイル時間 | 1,155 ms |
コンパイル使用メモリ | 131,384 KB |
最終ジャッジ日時 | 2025-02-20 05:40:34 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 66 |
ソースコード
// #define LOCAL#define _USE_MATH_DEFINES#include <array>#include <cassert>#include <cstdio>#include <cstring>#include <iostream>#include <iomanip>#include <string>#include <sstream>#include <vector>#include <queue>#include <stack>#include <list>#include <set>#include <map>#include <unordered_set>#include <unordered_map>#include <algorithm>#include <complex>#include <cmath>#include <numeric>#include <bitset>#include <functional>#include <random>#include <ctime>using namespace std;template <typename A, typename B>ostream& operator <<(ostream& out, const pair<A, B>& a) {out << "(" << a.first << "," << a.second << ")";return out;}template <typename T, size_t N>ostream& operator <<(ostream& out, const array<T, N>& a) {out << "["; bool first = true;for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";return out;}template <typename T>ostream& operator <<(ostream& out, const vector<T>& a) {out << "["; bool first = true;for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";return out;}template <typename T, class Cmp>ostream& operator <<(ostream& out, const set<T, Cmp>& a) {out << "{"; bool first = true;for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";return out;}template <typename T, class Cmp>ostream& operator <<(ostream& out, const multiset<T, Cmp>& a) {out << "{"; bool first = true;for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";return out;}template <typename U, typename T, class Cmp>ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {out << "{"; bool first = true;for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";return out;}#ifdef LOCAL#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)#else#define trace(...) 42#endiftemplate <typename Arg1>void __f(const char* name, Arg1&& arg1){cerr << name << ": " << arg1 << endl;}template <typename Arg1, typename... Args>void __f(const char* names, Arg1&& arg1, Args&&... args){const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << ": " << arg1 << " |";__f(comma + 1, args...);}template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }template <class T, class... D> auto vect(const T& v, int n, D... m) {return vector<decltype(vect(v, m...))>(n, vect(v, m...));}using int64 = long long;using int128 = __int128_t;using ii = pair<int, int>;#define SZ(x) (int)((x).size())template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;const int MOD = 1e9 + 7;// const int MOD = 998244353;mt19937_64 mrand(random_device{}());int64 rnd(int64 x) { return mrand() % x; }constexpr inline int lg2(int64 x) { return x == 0 ? -1 : sizeof(int64) * 8 - 1 - __builtin_clzll(x); }constexpr inline int64 p2ceil(int64 x) { return 1LL << (lg2(x - 1) + 1); }template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }inline void add_mod(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }inline void sub_mod(int& x, int y) { x += MOD - y; if (x >= MOD) x -= MOD; }inline int mod(int x) { return x >= MOD ? x - MOD : x; }struct fast_ios {fast_ios() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);};} fast_ios_;template<size_t N> int find_first(const bitset<N>& x) {#ifdef LOCALint k; for (k = 0; k < N && !x[k]; ++k); return k;#elsereturn x._Find_first();#endif}const int K = 13;void add(vector<bitset<K>>& a, bitset<K> x) {for (int i = 0; i < a.size(); ++i) {auto& v = a[i];int kx = find_first(x);int kv = find_first(v);if (kx <= kv) {if (v[kx]) {x ^= v;} else {v ^= x;x ^= v;}}}if (x != 0) a.push_back(x);}bool contain(const vector<bitset<K>>& a, bitset<K> x) {int i, j;for (i = 0; i < K && !x[i]; ++i);for (auto& v : a) {for (j = 0; j < K && !v[j]; ++j);if (j < i) continue;if (j > i) return false;x = x ^ v;for (; i < K && !x[i]; ++i);if (i == K) break;}return i == K;}int main() {int n;cin >> n;vector<bitset<K>> a;int sum = 0;for (int i = 0; i < n; ++i) {int x;cin >> x;sum ^= x;add(a, x);}cout << (sum == 0 && SZ(a) < n - 1 ? "Yes" : "No") << '\n';return 0;}