codes/bitset.hpp at master · notimesea/codes · GitHub

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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
#include <bits/stdc++.h>

using ull = unsigned long long;
using namespace std;

struct Bitset
{
    vector<ull> data;
    int n;
    Bitset(const int _n)
    {
        n = (_n + 63) >> 6;
        data.assign(n, 0ull);
    }

    Bitset & operator=(const Bitset & r)
    {
        if (this == &r)
            return *this;
        n = r.n;
        data = r.data;
        return *this;
    }

    void set(int pos)
    {
        if (pos >= 0 && (pos >> 6) < n)
            data[pos >> 6] |= 1ull << (pos & 63);
    }

    void reset() {
        fill(data.begin(), data.end(), 0ull);
    }
    void reset(int pos)
    {
        if (pos >= 0 && (pos >> 6) < n)
            data[pos >> 6] &= ~(1ull << (pos & 63));
    }

    bool test(int pos)
    {
        if (pos >= 0 && (pos >> 6) < n)
            return (data[pos >> 6] >> (pos & 63)) & 1ull;
        else
            return false;
    }

    void operator|=(const Bitset & r)
    {
        for(int i = 0; i < n; ++i)
            data[i] |= r.data[i];
    }
    void operator&=(const Bitset & r)
    {
        for(int i = 0; i < n; ++i)
            data[i] &= r.data[i];
    }
    void operator^=(const Bitset & r)
    {
        for(int i = 0; i < n; ++i)
            data[i] ^= r.data[i];
    }

    void shr(int shift, const Bitset &r) {
        int delta = shift >> 6;
        if (delta >= n) {
            return;
        }
        shift &= 63;
        if (shift == 0) {
            for (int i = 0, j = delta; j < n; ++i, ++j) {
                data[j] |= r.data[i];
            }
            return;
        }
        int rs = 64 - shift;
        for(int j = 0, k = j + delta + 1; k < n; ++j, ++k)
            data[k] |= (r.data[j + 1] << shift) | (r.data[j] >> rs);

        data[delta] |= r.data[0] << shift;
    }

    void operator<<=(int shift)
    {
        int delta = shift >> 6;
        if (delta >= n)
        {
            fill(data.begin(), data.end(), 0ull);
            return;
        }
        shift &= 63;
        if (shift == 0)
        {
            memmove(data.data() + delta, data.data(), (n - delta) << 3);
            fill(data.begin(), data.begin() + delta, 0ull);
            return;
        }
        for(int i = n - 1; i >= delta + 1; --i)
            data[i] = (data[i - delta] << shift) | (data[i - delta - 1] >> (64 - shift));

        data[delta] = data[0] << shift;
        fill(data.begin(), data.begin() + delta, 0ull);
    }
    void operator>>=(int shift)
    {
        int delta = shift >> 6;
        if (delta >= n)
        {
            fill(data.begin(), data.end(), 0ull);
            return;
        }
        shift &= 63;
        if (shift == 0)
        {
            memmove(data.data(), data.data() + delta, (n - delta) << 3);
            fill(data.begin() + n - delta, data.end(), 0ull);
            return;
        }
        for(int i = 0; i < n - delta - 1; ++i)
            data[i] = (data[i + delta] >> shift) | (data[i + delta + 1] << (64 - shift));

        data[n - delta - 1] = data[n - 1] >> shift;
        fill(data.begin() + n - delta, data.end(), 0ull);
    }

    int set_of_bits(int * res) const
    {
        int size = 0;
        for(int i = 0; i < n; ++i)
        {
            if (!data[i])
                continue;
            ull temp = data[i];
            while(temp)
            {
                int pos = __builtin_ctzll(temp);
                res[size++] = pos + (i << 6);
                temp ^= 1ull << pos;
            }
        }
        return size;
    }
    inline void print()
    {
        for(int i = 0; i < n; ++i)
        {
            for(int j = 0; j < 64; ++j)
                cout << ((data[i] >> j) & 1ull);
        }
        cout << endl;
    }
    ~Bitset() = default;
};