firiexp's Library
This documentation is automatically generated by online-judge-tools/verification-helper
test/yosupo_aplusb_dynamic_bitset.test.cpp
- View this file on GitHub
- Last update: 2026-03-22 13:44:11+09:00
- Problem: https://judge.yosupo.jp/problem/aplusb
Depends on
Code
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#include <algorithm>
#include <cassert>
#include <random>
#include <vector>
using namespace std;
#include <cstdio>
#include <cstring>
#include <string>
#include <type_traits>
#include "../util/fastio.cpp"
#include "../datastructure/dynamic_bitset.cpp"
vector<int> to_vec(const DynamicBitset &bs) {
vector<int> res(bs.size());
for (int i = 0; i < bs.size(); ++i) res[i] = bs.test(i);
return res;
}
int brute_find_first(const vector<int> &a) {
for (int i = 0; i < (int)a.size(); ++i) if (a[i]) return i;
return -1;
}
int brute_find_last(const vector<int> &a) {
for (int i = (int)a.size() - 1; i >= 0; --i) if (a[i]) return i;
return -1;
}
int brute_find_next(const vector<int> &a, int k) {
for (int i = k + 1; i < (int)a.size(); ++i) if (a[i]) return i;
return -1;
}
int brute_find_prev(const vector<int> &a, int k) {
for (int i = k - 1; i >= 0; --i) if (a[i]) return i;
return -1;
}
vector<int> shifted_left(const vector<int> &a, int s) {
vector<int> res(a.size());
if (s >= (int)a.size()) return res;
for (int i = 0; i + s < (int)a.size(); ++i) res[i + s] = a[i];
return res;
}
vector<int> shifted_right(const vector<int> &a, int s) {
vector<int> res(a.size());
if (s >= (int)a.size()) return res;
for (int i = s; i < (int)a.size(); ++i) res[i - s] = a[i];
return res;
}
void verify_state(const DynamicBitset &bs, const vector<int> &a) {
assert(bs.size() == (int)a.size());
assert(bs.empty() == a.empty());
assert(to_vec(bs) == a);
int cnt = 0;
for (int x : a) cnt += x;
assert(bs.count() == cnt);
assert(bs.any() == (cnt != 0));
assert(bs.none() == (cnt == 0));
assert(bs.all() == (cnt == (int)a.size()));
assert(bs.find_first() == brute_find_first(a));
assert(bs.find_last() == brute_find_last(a));
for (int i = 0; i <= (int)a.size(); ++i) {
assert(bs.find_next(i - 1) == brute_find_next(a, i - 1));
assert(bs.find_prev(i) == brute_find_prev(a, i));
}
}
void deterministic_check() {
vector<int> sizes = {0, 1, 2, 63, 64, 65, 127, 128, 129};
for (int n : sizes) {
DynamicBitset zero(n), one(n, true);
verify_state(zero, vector<int>(n, 0));
verify_state(one, vector<int>(n, 1));
vector<int> base(n);
for (int i = 0; i < n; ++i) base[i] = (i % 3) == 1;
DynamicBitset bs(n);
for (int i = 0; i < n; ++i) if (base[i]) bs.set(i);
verify_state(bs, base);
DynamicBitset flipped = bs;
flipped.flip();
vector<int> flip_base = base;
for (int &x : flip_base) x ^= 1;
verify_state(flipped, flip_base);
vector<int> shifts = {0, 1, 2, 31, 32, 63, 64, 65, max(0, n - 1), n, n + 7};
for (int s : shifts) {
DynamicBitset left = bs;
left <<= s;
verify_state(left, shifted_left(base, s));
DynamicBitset right = bs;
right >>= s;
verify_state(right, shifted_right(base, s));
}
DynamicBitset all(n, true);
DynamicBitset mix = bs;
DynamicBitset x = mix & all;
verify_state(x, base);
DynamicBitset y = mix | all;
verify_state(y, vector<int>(n, 1));
DynamicBitset z = mix ^ all;
vector<int> xor_base = base;
for (int &v : xor_base) v ^= 1;
verify_state(z, xor_base);
}
}
void random_check() {
mt19937 rng(0);
for (int tc = 0; tc < 400; ++tc) {
int n = rng() % 260;
DynamicBitset bs(n), other(n);
vector<int> a(n, 0), b(n, 0);
for (int step = 0; step < 200; ++step) {
int op = rng() % 12;
if (op == 0 && n > 0) {
int k = rng() % n;
bs.set(k);
a[k] = 1;
} else if (op == 1 && n > 0) {
int k = rng() % n;
bs.reset(k);
a[k] = 0;
} else if (op == 2 && n > 0) {
int k = rng() % n;
bs.flip(k);
a[k] ^= 1;
} else if (op == 3 && n > 0) {
int k = rng() % n;
int x = rng() & 1;
bs.assign(k, x);
a[k] = x;
} else if (op == 4) {
bs.reset();
fill(a.begin(), a.end(), 0);
} else if (op == 5) {
bs.set();
fill(a.begin(), a.end(), 1);
} else if (op == 6) {
bs.flip();
for (int &x : a) x ^= 1;
} else if (op == 7) {
for (int i = 0; i < n; ++i) {
int x = (rng() >> (i & 7)) & 1;
other.assign(i, x);
b[i] = x;
}
} else if (op == 8) {
DynamicBitset cur = bs;
cur &= other;
vector<int> expect(n);
for (int i = 0; i < n; ++i) expect[i] = a[i] & b[i];
verify_state(cur, expect);
} else if (op == 9) {
DynamicBitset cur = bs;
cur |= other;
vector<int> expect(n);
for (int i = 0; i < n; ++i) expect[i] = a[i] | b[i];
verify_state(cur, expect);
} else if (op == 10) {
DynamicBitset cur = bs;
cur ^= other;
vector<int> expect(n);
for (int i = 0; i < n; ++i) expect[i] = a[i] ^ b[i];
verify_state(cur, expect);
} else {
int s = n == 0 ? 0 : rng() % (n + 8);
if (rng() & 1) {
bs <<= s;
a = shifted_left(a, s);
} else {
bs >>= s;
a = shifted_right(a, s);
}
}
verify_state(bs, a);
verify_state(other, b);
}
}
}
int main() {
deterministic_check();
random_check();
Scanner sc;
Printer pr;
int a, b;
sc.read(a, b);
pr.println(a + b);
return 0;
}#line 1 "test/yosupo_aplusb_dynamic_bitset.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#include <algorithm>
#include <cassert>
#include <random>
#include <vector>
using namespace std;
#include <cstdio>
#include <cstring>
#include <string>
#include <type_traits>
#line 1 "util/fastio.cpp"
using namespace std;
extern "C" int fileno(FILE *);
extern "C" int isatty(int);
template<class T, class = void>
struct is_fastio_range : false_type {};
template<class T>
struct is_fastio_range<T, void_t<decltype(declval<T &>().begin()), decltype(declval<T &>().end())>> : true_type {};
template<class T, class = void>
struct has_fastio_value : false_type {};
template<class T>
struct has_fastio_value<T, void_t<decltype(declval<const T &>().value())>> : true_type {};
struct FastIoDigitTable {
char num[40000];
constexpr FastIoDigitTable() : num() {
for (int i = 0; i < 10000; ++i) {
int x = i;
for (int j = 3; j >= 0; --j) {
num[i * 4 + j] = char('0' + x % 10);
x /= 10;
}
}
}
};
struct Scanner {
static constexpr int BUFSIZE = 1 << 17;
static constexpr int OFFSET = 64;
char buf[BUFSIZE + 1];
int idx, size;
bool interactive;
Scanner() : idx(0), size(0), interactive(isatty(fileno(stdin))) {}
inline void load() {
int len = size - idx;
memmove(buf, buf + idx, len);
if (interactive) {
if (fgets(buf + len, BUFSIZE + 1 - len, stdin)) size = len + (int)strlen(buf + len);
else size = len;
} else {
size = len + (int)fread(buf + len, 1, BUFSIZE - len, stdin);
}
idx = 0;
buf[size] = 0;
}
inline void ensure() {
if (idx + OFFSET > size) load();
}
inline void ensure_interactive() {
if (idx == size) load();
}
inline char skip() {
if (interactive) {
ensure_interactive();
while (buf[idx] && buf[idx] <= ' ') {
++idx;
ensure_interactive();
}
return buf[idx++];
}
ensure();
while (buf[idx] && buf[idx] <= ' ') {
++idx;
ensure();
}
return buf[idx++];
}
template<class T, typename enable_if<is_integral<T>::value, int>::type = 0>
void read(T &x) {
if (interactive) {
char c = skip();
bool neg = false;
if constexpr (is_signed<T>::value) {
if (c == '-') {
neg = true;
ensure_interactive();
c = buf[idx++];
}
}
x = 0;
while (c >= '0') {
x = x * 10 + (c & 15);
ensure_interactive();
c = buf[idx++];
}
if constexpr (is_signed<T>::value) {
if (neg) x = -x;
}
return;
}
char c = skip();
bool neg = false;
if constexpr (is_signed<T>::value) {
if (c == '-') {
neg = true;
c = buf[idx++];
}
}
x = 0;
while (c >= '0') {
x = x * 10 + (c & 15);
c = buf[idx++];
}
if constexpr (is_signed<T>::value) {
if (neg) x = -x;
}
}
template<class T, typename enable_if<!is_integral<T>::value && !is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value && has_fastio_value<T>::value, int>::type = 0>
void read(T &x) {
long long v;
read(v);
x = T(v);
}
template<class Head, class Next, class... Tail>
void read(Head &head, Next &next, Tail &...tail) {
read(head);
read(next, tail...);
}
template<class T, class U>
void read(pair<T, U> &p) {
read(p.first, p.second);
}
template<class T, typename enable_if<is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value, int>::type = 0>
void read(T &a) {
for (auto &x : a) read(x);
}
void read(char &c) {
c = skip();
}
void read(string &s) {
s.clear();
if (interactive) {
ensure_interactive();
while (buf[idx] && buf[idx] <= ' ') {
++idx;
ensure_interactive();
}
while (true) {
int start = idx;
while (idx < size && buf[idx] > ' ') ++idx;
s.append(buf + start, idx - start);
if (idx < size) break;
load();
if (size == 0) break;
}
if (idx < size) ++idx;
return;
}
ensure();
while (buf[idx] && buf[idx] <= ' ') {
++idx;
ensure();
}
while (true) {
int start = idx;
while (idx < size && buf[idx] > ' ') ++idx;
s.append(buf + start, idx - start);
if (idx < size) break;
load();
}
if (idx < size) ++idx;
}
};
struct Printer {
static constexpr int BUFSIZE = 1 << 17;
static constexpr int OFFSET = 64;
char buf[BUFSIZE];
int idx;
bool interactive;
inline static constexpr FastIoDigitTable table{};
Printer() : idx(0), interactive(isatty(fileno(stdout))) {}
~Printer() { flush(); }
inline void flush() {
if (idx) {
fwrite(buf, 1, idx, stdout);
idx = 0;
}
}
inline void pc(char c) {
if (idx > BUFSIZE - OFFSET) flush();
buf[idx++] = c;
if (interactive && c == '\n') flush();
}
inline void print_range(const char *s, size_t n) {
size_t pos = 0;
while (pos < n) {
if (idx == BUFSIZE) flush();
size_t chunk = min(n - pos, (size_t)(BUFSIZE - idx));
memcpy(buf + idx, s + pos, chunk);
idx += (int)chunk;
pos += chunk;
}
}
void print(const char *s) {
print_range(s, strlen(s));
}
void print(const string &s) {
print_range(s.data(), s.size());
}
void print(char c) {
pc(c);
}
void print(bool b) {
pc(char('0' + (b ? 1 : 0)));
}
template<class T, typename enable_if<is_integral<T>::value && !is_same<T, bool>::value, int>::type = 0>
void print(T x) {
if (idx > BUFSIZE - 100) flush();
using U = typename make_unsigned<T>::type;
U y;
if constexpr (is_signed<T>::value) {
if (x < 0) {
buf[idx++] = '-';
y = U(0) - static_cast<U>(x);
} else {
y = static_cast<U>(x);
}
} else {
y = x;
}
if (y == 0) {
buf[idx++] = '0';
return;
}
static constexpr int TMP_SIZE = sizeof(U) * 10 / 4;
char tmp[TMP_SIZE];
int pos = TMP_SIZE;
while (y >= 10000) {
pos -= 4;
memcpy(tmp + pos, table.num + (y % 10000) * 4, 4);
y /= 10000;
}
if (y >= 1000) {
memcpy(buf + idx, table.num + (y << 2), 4);
idx += 4;
} else if (y >= 100) {
memcpy(buf + idx, table.num + (y << 2) + 1, 3);
idx += 3;
} else if (y >= 10) {
unsigned q = (unsigned(y) * 205) >> 11;
buf[idx] = char('0' + q);
buf[idx + 1] = char('0' + (unsigned(y) - q * 10));
idx += 2;
} else {
buf[idx++] = char('0' + y);
}
memcpy(buf + idx, tmp + pos, TMP_SIZE - pos);
idx += TMP_SIZE - pos;
}
template<class T, typename enable_if<!is_integral<T>::value && !is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value && has_fastio_value<T>::value, int>::type = 0>
void print(const T &x) {
print(x.value());
}
template<class T, typename enable_if<is_fastio_range<T>::value && !is_same<typename decay<T>::type, string>::value, int>::type = 0>
void print(const T &a) {
bool first = true;
for (auto &&x : a) {
if (!first) pc(' ');
first = false;
print(x);
}
}
template<class T>
void println(const T &x) {
print(x);
pc('\n');
}
template<class Head, class... Tail>
void println(const Head &head, const Tail &...tail) {
print(head);
((pc(' '), print(tail)), ...);
pc('\n');
}
void println() {
pc('\n');
}
};
template<class T>
Scanner &operator>>(Scanner &in, T &x) {
in.read(x);
return in;
}
template<class T>
Printer &operator<<(Printer &out, const T &x) {
out.print(x);
return out;
}
/**
* @brief 高速入出力(Fast IO)
*/
#line 1 "datastructure/dynamic_bitset.cpp"
#if defined(__x86_64__) || defined(_M_X64)
#include <immintrin.h>
#endif
using namespace std;
namespace dynamic_bitset_detail {
using Word = unsigned long long;
constexpr int avx2_threshold_words = 8;
#if defined(__x86_64__) || defined(_M_X64)
__attribute__((target("avx2"))) inline void and_assign_avx2(Word *dst, const Word *src, int m) {
int i = 0;
for (; i + 4 <= m; i += 4) {
__m256i x = _mm256_loadu_si256((const __m256i *)(dst + i));
__m256i y = _mm256_loadu_si256((const __m256i *)(src + i));
_mm256_storeu_si256((__m256i *)(dst + i), _mm256_and_si256(x, y));
}
for (; i < m; ++i) dst[i] &= src[i];
}
__attribute__((target("avx2"))) inline void or_assign_avx2(Word *dst, const Word *src, int m) {
int i = 0;
for (; i + 4 <= m; i += 4) {
__m256i x = _mm256_loadu_si256((const __m256i *)(dst + i));
__m256i y = _mm256_loadu_si256((const __m256i *)(src + i));
_mm256_storeu_si256((__m256i *)(dst + i), _mm256_or_si256(x, y));
}
for (; i < m; ++i) dst[i] |= src[i];
}
__attribute__((target("avx2"))) inline void xor_assign_avx2(Word *dst, const Word *src, int m) {
int i = 0;
for (; i + 4 <= m; i += 4) {
__m256i x = _mm256_loadu_si256((const __m256i *)(dst + i));
__m256i y = _mm256_loadu_si256((const __m256i *)(src + i));
_mm256_storeu_si256((__m256i *)(dst + i), _mm256_xor_si256(x, y));
}
for (; i < m; ++i) dst[i] ^= src[i];
}
__attribute__((target("avx2"))) inline bool any_avx2(const Word *src, int m) {
__m256i acc = _mm256_setzero_si256();
int i = 0;
for (; i + 4 <= m; i += 4) {
acc = _mm256_or_si256(acc, _mm256_loadu_si256((const __m256i *)(src + i)));
}
if (!_mm256_testz_si256(acc, acc)) return true;
for (; i < m; ++i) {
if (src[i]) return true;
}
return false;
}
__attribute__((target("avx2"))) inline bool all_full_words_avx2(const Word *src, int m) {
const __m256i ones = _mm256_set1_epi64x(-1);
int i = 0;
for (; i + 4 <= m; i += 4) {
__m256i x = _mm256_loadu_si256((const __m256i *)(src + i));
__m256i eq = _mm256_cmpeq_epi64(x, ones);
if (_mm256_movemask_epi8(eq) != -1) return false;
}
for (; i < m; ++i) {
if (src[i] != ~0ULL) return false;
}
return true;
}
inline bool has_avx2() {
static const bool cached = __builtin_cpu_supports("avx2");
return cached;
}
#endif
} // namespace dynamic_bitset_detail
class DynamicBitset {
static constexpr int B = 64;
using Word = unsigned long long;
int n;
vector<Word> a;
static int popcount(Word x) {
return __builtin_popcountll(x);
}
static int ctz(Word x) {
return __builtin_ctzll(x);
}
static int clz(Word x) {
return __builtin_clzll(x);
}
Word tail_mask() const {
int rem = n & (B - 1);
return rem ? ((1ULL << rem) - 1) : ~0ULL;
}
void normalize() {
if (!a.empty()) a.back() &= tail_mask();
}
public:
DynamicBitset() : n(0) {}
explicit DynamicBitset(int n, bool x = false) : n(n), a((n + B - 1) >> 6, x ? ~0ULL : 0ULL) {
normalize();
}
int size() const { return n; }
bool empty() const { return n == 0; }
void reset() {
fill(a.begin(), a.end(), 0);
}
void set() {
fill(a.begin(), a.end(), ~0ULL);
normalize();
}
void flip() {
Word *p = a.data();
int m = (int)a.size();
for (int i = 0; i < m; ++i) p[i] = ~p[i];
normalize();
}
bool test(int k) const {
return (a[k >> 6] >> (k & 63)) & 1ULL;
}
void set(int k) {
a[k >> 6] |= 1ULL << (k & 63);
}
void reset(int k) {
a[k >> 6] &= ~(1ULL << (k & 63));
}
void flip(int k) {
a[k >> 6] ^= 1ULL << (k & 63);
}
void assign(int k, bool x) {
if (x) set(k);
else reset(k);
}
bool any() const {
int m = (int)a.size();
const Word *p = a.data();
#if defined(__x86_64__) || defined(_M_X64)
if (m >= dynamic_bitset_detail::avx2_threshold_words && dynamic_bitset_detail::has_avx2()) {
return dynamic_bitset_detail::any_avx2(p, m);
}
#endif
for (int i = 0; i < m; ++i) {
if (p[i]) return true;
}
return false;
}
bool none() const { return !any(); }
bool all() const {
int m = (int)a.size();
if (m == 0) return true;
const Word *p = a.data();
#if defined(__x86_64__) || defined(_M_X64)
if (m > 1 + dynamic_bitset_detail::avx2_threshold_words && dynamic_bitset_detail::has_avx2()) {
if (!dynamic_bitset_detail::all_full_words_avx2(p, m - 1)) return false;
} else
#endif
{
for (int i = 0; i + 1 < m; ++i) {
if (p[i] != ~0ULL) return false;
}
}
return p[m - 1] == tail_mask();
}
int count() const {
const Word *p = a.data();
int m = (int)a.size();
int res = 0;
int i = 0;
for (; i + 4 <= m; i += 4) {
res += popcount(p[i + 0]) + popcount(p[i + 1]) + popcount(p[i + 2]) + popcount(p[i + 3]);
}
for (; i < m; ++i) res += popcount(p[i]);
return res;
}
int find_first() const {
int m = (int)a.size();
const Word *p = a.data();
for (int i = 0; i < m; ++i) {
if (p[i]) return (i << 6) + ctz(p[i]);
}
return -1;
}
int find_last() const {
const Word *p = a.data();
for (int i = (int)a.size() - 1; i >= 0; --i) {
if (p[i]) return (i << 6) + (B - 1 - clz(p[i]));
}
return -1;
}
int find_next(int k) const {
++k;
if (k >= n) return -1;
const Word *p = a.data();
int i = k >> 6;
Word x = p[i] & (~0ULL << (k & 63));
if (x) return (i << 6) + ctz(x);
int m = (int)a.size();
for (++i; i < m; ++i) {
if (p[i]) return (i << 6) + ctz(p[i]);
}
return -1;
}
int find_prev(int k) const {
--k;
if (k < 0) return -1;
const Word *p = a.data();
int i = k >> 6;
int rem = k & 63;
Word mask = rem == B - 1 ? ~0ULL : ((1ULL << (rem + 1)) - 1);
Word x = p[i] & mask;
if (x) return (i << 6) + (B - 1 - clz(x));
for (--i; i >= 0; --i) {
if (p[i]) return (i << 6) + (B - 1 - clz(p[i]));
}
return -1;
}
DynamicBitset &operator&=(const DynamicBitset &r) {
Word *p = a.data();
const Word *q = r.a.data();
int m = (int)a.size();
#if defined(__x86_64__) || defined(_M_X64)
if (m >= dynamic_bitset_detail::avx2_threshold_words && dynamic_bitset_detail::has_avx2()) {
dynamic_bitset_detail::and_assign_avx2(p, q, m);
return *this;
}
#endif
for (int i = 0; i < m; ++i) p[i] &= q[i];
return *this;
}
DynamicBitset &operator|=(const DynamicBitset &r) {
Word *p = a.data();
const Word *q = r.a.data();
int m = (int)a.size();
#if defined(__x86_64__) || defined(_M_X64)
if (m >= dynamic_bitset_detail::avx2_threshold_words && dynamic_bitset_detail::has_avx2()) {
dynamic_bitset_detail::or_assign_avx2(p, q, m);
return *this;
}
#endif
for (int i = 0; i < m; ++i) p[i] |= q[i];
return *this;
}
DynamicBitset &operator^=(const DynamicBitset &r) {
Word *p = a.data();
const Word *q = r.a.data();
int m = (int)a.size();
#if defined(__x86_64__) || defined(_M_X64)
if (m >= dynamic_bitset_detail::avx2_threshold_words && dynamic_bitset_detail::has_avx2()) {
dynamic_bitset_detail::xor_assign_avx2(p, q, m);
normalize();
return *this;
}
#endif
for (int i = 0; i < m; ++i) p[i] ^= q[i];
normalize();
return *this;
}
friend DynamicBitset operator&(DynamicBitset l, const DynamicBitset &r) { return l &= r; }
friend DynamicBitset operator|(DynamicBitset l, const DynamicBitset &r) { return l |= r; }
friend DynamicBitset operator^(DynamicBitset l, const DynamicBitset &r) { return l ^= r; }
DynamicBitset &operator<<=(int s) {
if (s <= 0 || n == 0) return *this;
if (s >= n) {
reset();
return *this;
}
if (s == 1) {
Word carry = 0;
for (int i = 0; i < (int)a.size(); ++i) {
Word next = a[i] >> (B - 1);
a[i] = (a[i] << 1) | carry;
carry = next;
}
normalize();
return *this;
}
int m = (int)a.size();
int block = s >> 6;
int rem = s & 63;
if (rem == 0) {
memmove(a.data() + block, a.data(), sizeof(Word) * (m - block));
} else {
for (int i = m - 1; i > block; --i) {
a[i] = (a[i - block] << rem) | (a[i - block - 1] >> (B - rem));
}
a[block] = a[0] << rem;
}
fill(a.begin(), a.begin() + block, 0);
normalize();
return *this;
}
DynamicBitset &operator>>=(int s) {
if (s <= 0 || n == 0) return *this;
if (s >= n) {
reset();
return *this;
}
if (s == 1) {
int m = (int)a.size();
for (int i = 0; i < m; ++i) {
Word next = i + 1 < m ? (a[i + 1] << (B - 1)) : 0;
a[i] = (a[i] >> 1) | next;
}
normalize();
return *this;
}
int m = (int)a.size();
int block = s >> 6;
int rem = s & 63;
if (rem == 0) {
memmove(a.data(), a.data() + block, sizeof(Word) * (m - block));
} else {
int last = m - block - 1;
for (int i = 0; i < last; ++i) {
a[i] = (a[i + block] >> rem) | (a[i + block + 1] << (B - rem));
}
a[last] = a[m - 1] >> rem;
}
fill(a.begin() + (m - block), a.end(), 0);
normalize();
return *this;
}
friend DynamicBitset operator<<(DynamicBitset l, int s) { return l <<= s; }
friend DynamicBitset operator>>(DynamicBitset l, int s) { return l >>= s; }
};
/**
* @brief 動的bitset(Dynamic Bitset)
*/
#line 16 "test/yosupo_aplusb_dynamic_bitset.test.cpp"
vector<int> to_vec(const DynamicBitset &bs) {
vector<int> res(bs.size());
for (int i = 0; i < bs.size(); ++i) res[i] = bs.test(i);
return res;
}
int brute_find_first(const vector<int> &a) {
for (int i = 0; i < (int)a.size(); ++i) if (a[i]) return i;
return -1;
}
int brute_find_last(const vector<int> &a) {
for (int i = (int)a.size() - 1; i >= 0; --i) if (a[i]) return i;
return -1;
}
int brute_find_next(const vector<int> &a, int k) {
for (int i = k + 1; i < (int)a.size(); ++i) if (a[i]) return i;
return -1;
}
int brute_find_prev(const vector<int> &a, int k) {
for (int i = k - 1; i >= 0; --i) if (a[i]) return i;
return -1;
}
vector<int> shifted_left(const vector<int> &a, int s) {
vector<int> res(a.size());
if (s >= (int)a.size()) return res;
for (int i = 0; i + s < (int)a.size(); ++i) res[i + s] = a[i];
return res;
}
vector<int> shifted_right(const vector<int> &a, int s) {
vector<int> res(a.size());
if (s >= (int)a.size()) return res;
for (int i = s; i < (int)a.size(); ++i) res[i - s] = a[i];
return res;
}
void verify_state(const DynamicBitset &bs, const vector<int> &a) {
assert(bs.size() == (int)a.size());
assert(bs.empty() == a.empty());
assert(to_vec(bs) == a);
int cnt = 0;
for (int x : a) cnt += x;
assert(bs.count() == cnt);
assert(bs.any() == (cnt != 0));
assert(bs.none() == (cnt == 0));
assert(bs.all() == (cnt == (int)a.size()));
assert(bs.find_first() == brute_find_first(a));
assert(bs.find_last() == brute_find_last(a));
for (int i = 0; i <= (int)a.size(); ++i) {
assert(bs.find_next(i - 1) == brute_find_next(a, i - 1));
assert(bs.find_prev(i) == brute_find_prev(a, i));
}
}
void deterministic_check() {
vector<int> sizes = {0, 1, 2, 63, 64, 65, 127, 128, 129};
for (int n : sizes) {
DynamicBitset zero(n), one(n, true);
verify_state(zero, vector<int>(n, 0));
verify_state(one, vector<int>(n, 1));
vector<int> base(n);
for (int i = 0; i < n; ++i) base[i] = (i % 3) == 1;
DynamicBitset bs(n);
for (int i = 0; i < n; ++i) if (base[i]) bs.set(i);
verify_state(bs, base);
DynamicBitset flipped = bs;
flipped.flip();
vector<int> flip_base = base;
for (int &x : flip_base) x ^= 1;
verify_state(flipped, flip_base);
vector<int> shifts = {0, 1, 2, 31, 32, 63, 64, 65, max(0, n - 1), n, n + 7};
for (int s : shifts) {
DynamicBitset left = bs;
left <<= s;
verify_state(left, shifted_left(base, s));
DynamicBitset right = bs;
right >>= s;
verify_state(right, shifted_right(base, s));
}
DynamicBitset all(n, true);
DynamicBitset mix = bs;
DynamicBitset x = mix & all;
verify_state(x, base);
DynamicBitset y = mix | all;
verify_state(y, vector<int>(n, 1));
DynamicBitset z = mix ^ all;
vector<int> xor_base = base;
for (int &v : xor_base) v ^= 1;
verify_state(z, xor_base);
}
}
void random_check() {
mt19937 rng(0);
for (int tc = 0; tc < 400; ++tc) {
int n = rng() % 260;
DynamicBitset bs(n), other(n);
vector<int> a(n, 0), b(n, 0);
for (int step = 0; step < 200; ++step) {
int op = rng() % 12;
if (op == 0 && n > 0) {
int k = rng() % n;
bs.set(k);
a[k] = 1;
} else if (op == 1 && n > 0) {
int k = rng() % n;
bs.reset(k);
a[k] = 0;
} else if (op == 2 && n > 0) {
int k = rng() % n;
bs.flip(k);
a[k] ^= 1;
} else if (op == 3 && n > 0) {
int k = rng() % n;
int x = rng() & 1;
bs.assign(k, x);
a[k] = x;
} else if (op == 4) {
bs.reset();
fill(a.begin(), a.end(), 0);
} else if (op == 5) {
bs.set();
fill(a.begin(), a.end(), 1);
} else if (op == 6) {
bs.flip();
for (int &x : a) x ^= 1;
} else if (op == 7) {
for (int i = 0; i < n; ++i) {
int x = (rng() >> (i & 7)) & 1;
other.assign(i, x);
b[i] = x;
}
} else if (op == 8) {
DynamicBitset cur = bs;
cur &= other;
vector<int> expect(n);
for (int i = 0; i < n; ++i) expect[i] = a[i] & b[i];
verify_state(cur, expect);
} else if (op == 9) {
DynamicBitset cur = bs;
cur |= other;
vector<int> expect(n);
for (int i = 0; i < n; ++i) expect[i] = a[i] | b[i];
verify_state(cur, expect);
} else if (op == 10) {
DynamicBitset cur = bs;
cur ^= other;
vector<int> expect(n);
for (int i = 0; i < n; ++i) expect[i] = a[i] ^ b[i];
verify_state(cur, expect);
} else {
int s = n == 0 ? 0 : rng() % (n + 8);
if (rng() & 1) {
bs <<= s;
a = shifted_left(a, s);
} else {
bs >>= s;
a = shifted_right(a, s);
}
}
verify_state(bs, a);
verify_state(other, b);
}
}
}
int main() {
deterministic_check();
random_check();
Scanner sc;
Printer pr;
int a, b;
sc.read(a, b);
pr.println(a + b);
return 0;
}