线性基

定义

线性基即在异或域中，一组线性无关的基向量V(v1,v2...vn)。（可以想象成N维坐标下的坐标轴）

在原本的数域A1,A2...Am中，选择若干数值进行异或得到的结果都可以用基向量进行组合得到。

模板

struct LB {
    ll d[61], p[61];
    int cnt, mx;
    LB() {
        memset(d, 0, sizeof(d));
        memset(p, 0, sizeof(p));
        cnt = 0, mx = 61;
    }
    void init() {
        memset(d, 0, sizeof(d));
        memset(p, 0, sizeof(p));
    }
    bool add(ll val) {
        per(i, mx, 0) if (val & (1LL << i)) {
            if (!d[i]) {d[i] = val; break;}
            val ^= d[i];
        }
        return val > 0;
    }
    ll query_max() {
        ll ret = 0;
        per(i, mx, 0) if((ret ^ d[i]) > ret) ret ^= d[i];
        return ret;
    }
    ll query_min() {
        rep(i, 0, mx) if(d[i]) return d[i];
        return 0;
    }
    void rebuild() {    //消元，保存到p数组
        cnt = 0;
        rep(i, 0, mx) rep(j, 0, i) if(d[i] & (1LL << j)) d[i] ^= d[j];
        rep(i, 0, mx) if (d[i]) p[cnt++] = d[i];
    }
    ll query_kth(ll k) { //使用前需要rebuild
        ll ret = 0;
        if (k >= (1LL << cnt)) return -1;
        per(i, cnt, 0) if (k & (1LL << i)) ret ^= p[i];
        return ret;
    }
    ll find(ll x) { //找x是第几大的数,需保证x一定在
        ll ret = 0, c = 0;
        rep(i, 0, mx) if(d[i]) {
            if(x >> i & 1) ret += (1LL << c);
            c++;
        }
        return ret;
    }
    LB operator+(const LB & _A)const {  //合并
        LB ret = *this;
        per(i, mx, 0) if(_A.d[i]) ret.add(_A.d[i]);
        return ret;
    }
};

SGU - 275

最简单的线性基模板题，给出n个数，用其中一些数异或，要求得到的结果最大

#include <bits/stdc++.h>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define x first
#define y second
#define rep(i,a,b) for(int i=a;i<b;++i)
#define per(i,a,b) for(int i=a-1;i>=b;--i)
#define fuck(x) cout<<'['<<#x<<' '<<(x)<<']'
#define FIN freopen("in.txt","r",stdin);
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> PII;

const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fll;
const int mod = 1e9 + 7;
const int MX = 2e5 + 5;

struct LB {
    ll d[61], p[61];
    int cnt, mx;
    LB() {
        memset(d, 0, sizeof(d));
        memset(p, 0, sizeof(p));
        cnt = 0, mx = 61;
    }
    bool add(ll val) {
        per(i, mx, 0) if (val & (1LL << i)) {
            if (!d[i]) {d[i] = val; break;}
            val ^= d[i];
        }
        return val > 0;
    }
    ll query_max() {
        ll ret = 0;
        per(i, mx, 0) if((ret ^ d[i]) > ret) ret ^= d[i];
        return ret;
    }
    ll query_min() {
        rep(i, 0, mx) if(d[i]) return d[i];
        return 0;
    }
    void rebuild() {    //消元，保存到p数组
        per(i, mx, 0) per(j, i, 0) if (d[i] & (1ll << j)) d[i] ^= d[j];
        rep(i, 0, mx) if (d[i]) p[cnt++] = d[i];
    }
    ll kthquery(ll k) { //使用前需要rebuild
        int ret = 0;
        if (k >= (1LL << cnt)) return -1;
        per(i, mx, 0) if (k & (1LL << i)) ret ^= p[i];
        return ret;
    }
    LB operator+(const LB &_A)const {
        LB ret = *this;
        per(i, mx, 0) if(_A.d[i]) ret.add(_A.d[i]);
        return ret;
    }
};
ll a[105];
int main() {
    //FIN;
    int n; cin >> n;
    LB lb;
    rep(i, 0, n) {
        scanf("%lld", &a[i]);
        lb.add(a[i]);
    }
    cout << lb.query_max() << endl;
    return 0;
}

UVALive - 8512

西安区域赛A题，给出n个数和一个数K，每次查询一段区间[l,r]，问区间内任选一些数进行异或，得到的结果在与K或运算，问结果最大是多少。

题解：用线段树维护每段区间的线性基，合并的时候将线性基合并。

#include <bits/stdc++.h>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define x first
#define y second
#define rep(i,a,b) for(int i=a;i<b;++i)
#define per(i,a,b) for(int i=a-1;i>=b;--i)
#define fuck(x) cout<<'['<<#x<<' '<<(x)<<']'
#define FIN freopen("in.txt","r",stdin);
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> PII;

const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fll;
const int mod = 1e9 + 7;
const int MX = 1e4 + 5;

struct LB {
    int d[30], p[30];
    int cnt, mx;
    LB() {
        memset(d, 0, sizeof(d));
        memset(p, 0, sizeof(p));
        cnt = 0, mx = 30;
    }
    void init() {
        memset(d, 0, sizeof(d));
        memset(p, 0, sizeof(p));
    }
    bool add(int val) {
        per(i, mx, 0) if (val & (1 << i)) {
            if (!d[i]) {d[i] = val; break;}
            val ^= d[i];
        }
        return val > 0;
    }
    LB operator+(const LB & _A)const {  //合并
        LB ret = *this;
        per(i, mx, 0) if(_A.d[i]) ret.add(_A.d[i]);
        return ret;
    }

    int query(int x) {
        static int tmp[30];
        rep(i, 0, mx) tmp[i] = d[i] ^ (x & d[i]);
        init();
        rep(i, 0, mx) if(tmp[i]) add(tmp[i]);
        int ret = 0;
        per(i, mx, 0) if((ret ^ d[i]) > ret) ret ^= d[i];
        return ret | x;
    }
} t[MX << 2];

void PushUP(int rt) {
    t[rt] = t[rt << 1] + t[rt << 1 | 1];
}

void build(int l, int r, int rt) {
    t[rt].init();
    if(l == r) {
        int x;
        scanf("%d", &x);
        t[rt].add(x);
        return;
    }
    int m = (l + r) >> 1;
    build(lson), build(rson);
    PushUP(rt);
}
LB query(int L, int R, int l, int r, int rt) {
    if(L <= l && R >= r) return t[rt];
    int m = (l + r) >> 1;
    if(L <= m && R > m) return query(L, R, lson) + query(L, R, rson);
    if(L <= m) return query(L, R, lson);
    return query(L, R, rson);
}

int main() {
    //FIN;
    int T, n, q, k, l, r; cin >> T;
    while(T--) {
        cin >> n >> q >> k;
        build(1, n, 1);
        while(q--) {
            scanf("%d%d", &l, &r);
            LB q = query(l, r, 1, n, 1);
            printf("%d\n", q.query(k));
        }
    }
    return 0;
}

HDU-3949 

简单的线性基模板题，给出一个序列找序列的第k大，唯一的坑点就是可能会有0，需要特判一下

#include <bits/stdc++.h>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define x first
#define y second
#define rep(i,a,b) for(int i=a;i<b;++i)
#define per(i,a,b) for(int i=a-1;i>=b;--i)
#define fuck(x) cout<<'['<<#x<<' '<<(x)<<']'
#define FIN freopen("in.txt","r",stdin);
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> PII;

const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fll;
const int mod = 1e9 + 7;
const int MX = 2e5 + 5;

struct LB {
    ll d[61], p[61];
    int cnt, mx;
    LB() {
        memset(d, 0, sizeof(d));
        memset(p, 0, sizeof(p));
        cnt = 0, mx = 61;
    }
    void init() {
        memset(d, 0, sizeof(d));
        memset(p, 0, sizeof(p));
    }
    bool add(ll val) {
        per(i, mx, 0) if (val & (1LL << i)) {
            if (!d[i]) {d[i] = val; break;}
            val ^= d[i];
        }
        return val > 0;
    }
    ll query_max() {
        ll ret = 0;
        per(i, mx, 0) if((ret ^ d[i]) > ret) ret ^= d[i];
        return ret;
    }
    ll query_min() {
        rep(i, 0, mx) if(d[i]) return d[i];
        return 0;
    }
    void rebuild() {    //消元，保存到p数组
        cnt = 0;
        rep(i, 0, mx) rep(j, 0, i) if(d[i] & (1LL << j)) d[i] ^= d[j];
        rep(i, 0, mx) if (d[i]) p[cnt++] = d[i];
    }
    ll query_kth(ll k) { //使用前需要rebuild
        ll ret = 0;
        if (k >= (1LL << cnt)) return -1;
        per(i, cnt, 0) if (k & (1LL << i)) ret ^= p[i];
        return ret;
    }
    ll find(ll x) { //找x是第几大的数,需保证x一定在
        ll ret = 0, c = 0;
        rep(i, 0, mx) if(d[i]) {
            if(x >> i & 1) ret += (1LL << c);
            c++;
        }
        return ret;
    }
    LB operator+(const LB & _A)const {  //合并
        LB ret = *this;
        per(i, mx, 0) if(_A.d[i]) ret.add(_A.d[i]);
        return ret;
    }
};
int main() {
    //FIN;
    int T, n, m; cin >> T;
    rep(cas, 0, T) {
        scanf("%d", &n);
        LB lb; ll x;
        bool flag = 1;
        rep(i, 0, n) {
            scanf("%lld", &x);
            if(!lb.add(x)) flag = 0;
        }
        lb.rebuild();
        scanf("%d", &m);
        printf("Case #%d:\n", cas + 1);
        rep(i, 0, m) {
            ll k; scanf("%lld", &k);
            if(!flag) k--;
            printf("%lld\n", lb.query_kth(k));
        }
    }
    return 0;
}

BZOJ-2844

给出n个数，从这n个数中任选一个集合，将集合内的数异或，然后将所有结果排序，问X在这个序列中排第几位（一定存在X）

有一个定理：所有异或的结果中，每个数的出现次数相同，次数为2^(n-|B|),|B|为基向量的数量

根据这个定理，根据二进制拆分，就可以知道X在结果集中是第几大，然后乘上2^(n-|B|)即可。

#include <bits/stdc++.h>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define x first
#define y second
#define rep(i,a,b) for(int i=a;i<b;++i)
#define per(i,a,b) for(int i=a-1;i>=b;--i)
#define fuck(x) cout<<'['<<#x<<' '<<(x)<<']'
#define FIN freopen("in.txt","r",stdin);
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> PII;
 
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fll;
const int mod = 10086;
const int MX = 1e5 + 5;
 
struct LB {
    ll d[61], p[61];
    int cnt, mx;
    LB() {
        memset(d, 0, sizeof(d));
        memset(p, 0, sizeof(p));
        cnt = 0, mx = 61;
    }
    void init() {
        memset(d, 0, sizeof(d));
        memset(p, 0, sizeof(p));
    }
    bool add(ll val) {
        per(i, mx, 0) if (val & (1LL << i)) {
            if (!d[i]) {d[i] = val; break;}
            val ^= d[i];
        }
        return val > 0;
    }
    ll query_max() {
        ll ret = 0;
        per(i, mx, 0) if((ret ^ d[i]) > ret) ret ^= d[i];
        return ret;
    }
    ll query_min() {
        rep(i, 0, mx) if(d[i]) return d[i];
        return 0;
    }
    void rebuild() {    //消元，保存到p数组
        cnt = 0;
        rep(i, 0, mx) rep(j, 0, i) if(d[i] & (1LL << j)) d[i] ^= d[j];
        rep(i, 0, mx) if (d[i]) p[cnt++] = d[i];
    }
    ll query_kth(ll k) { //使用前需要rebuild
        ll ret = 0;
        if (k >= (1LL << cnt)) return -1;
        per(i, cnt, 0) if (k & (1LL << i)) ret ^= p[i];
        return ret;
    }
    ll find(ll x) { //找x是第几大的数
        //rep(i, 0, mx) if((x & (1LL << i)) && !d[i]) return -1;
        ll ret = 0, c = 0;
        rep(i, 0, mx) if(d[i]) {
            if(x >> i & 1) ret += (1LL << c);
            c++;
        }
        return ret;
    }
    LB operator+(const LB & _A)const {  //合并
        LB ret = *this;
        per(i, mx, 0) if(_A.d[i]) ret.add(_A.d[i]);
        return ret;
    }
};
int main() {
    //FIN;
    LB lb; ll x;
    int n; cin >> n;
    rep(i, 0, n) scanf("%lld", &x), lb.add(x);
    lb.rebuild();
    ll q; cin >> q;
    ll ans = lb.find(q);
    printf("%lld\n", (mul(ans, pow(2ll, n - lb.cnt)) + 1) % mod);
    return 0;
}

BZOJ-2115

一个有环图，问从1跑到n路径上权值异或起来最大值是多少。

考虑到在环上走一圈后仍然回到原点，因此可以选择将环上的值放在路径上，也可以选择不放在路径上，这样我们就可以使用线性基，把每个环上的异或值都插入线性基中，再与1->n路径上的异或值进行合并，维护一个最大的值。找环只需要利用DFS的返祖边找即可（类似于tarjan）

#include <bits/stdc++.h>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define x first
#define y second
#define rep(i,a,b) for(int i=a;i<b;++i)
#define per(i,a,b) for(int i=a-1;i>=b;--i)
#define fuck(x) cout<<'['<<#x<<' '<<(x)<<']'
#define FIN freopen("in.txt","r",stdin);
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef pair<int, ll> PIL;
 
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fll;
const int mod = 1e9 + 7;
const int MX = 5e4 + 5;
 
struct LB {
    ll d[61], p[61];
    int cnt, mx;
    LB() {
        memset(d, 0, sizeof(d));
        memset(p, 0, sizeof(p));
        cnt = 0, mx = 61;
    }
    void init() {
        memset(d, 0, sizeof(d));
        memset(p, 0, sizeof(p));
    }
    bool add(ll val) {
        per(i, mx, 0) if (val & (1LL << i)) {
            if (!d[i]) {d[i] = val; break;}
            val ^= d[i];
        }
        return val > 0;
    }
    ll query_max() {
        ll ret = 0;
        per(i, mx, 0) if((ret ^ d[i]) > ret) ret ^= d[i];
        return ret;
    }
    ll query_min() {
        rep(i, 0, mx) if(d[i]) return d[i];
        return 0;
    }
    void rebuild() {    //消元，保存到p数组
        cnt = 0;
        rep(i, 0, mx) rep(j, 0, i) if(d[i] & (1LL << j)) d[i] ^= d[j];
        rep(i, 0, mx) if (d[i]) p[cnt++] = d[i];
    }
    ll query_kth(ll k) { //使用前需要rebuild
        ll ret = 0;
        if (k >= (1LL << cnt)) return -1;
        per(i, cnt, 0) if (k & (1LL << i)) ret ^= p[i];
        return ret;
    }
    ll find(ll x) { //找x是第几大的数,需保证x一定在
        ll ret = 0, c = 0;
        rep(i, 0, mx) if(d[i]) {
            if(x >> i & 1) ret += (1LL << c);
            c++;
        }
        return ret;
    }
    LB operator+(const LB & _A)const {  //合并
        LB ret = *this;
        per(i, mx, 0) if(_A.d[i]) ret.add(_A.d[i]);
        return ret;
    }
};
struct Edge {
    int v, nxt;
    ll w;
} E[MX << 3];
int head[MX], tot;
void edge_add(int u, int v, ll w) {
    E[tot] = (Edge) {v, head[u], w}, head[u] = tot++;
}
void init() {
    memset(head, -1, sizeof(head));
    tot = 0;
}
ll d[MX], a[MX << 2];
int sz, vis[MX];
void dfs(int u, int pre) {
    vis[u] = 1;
    for(int i = head[u]; ~i; i = E[i].nxt) {
        if((i ^ 1) == pre) continue;
        if(vis[E[i].v]) a[sz++] = d[u] ^ d[E[i].v] ^ E[i].w;
        else {
            d[E[i].v] = d[u] ^ E[i].w;
            dfs(E[i].v, i);
        }
    }
}
int main() {
    //FIN;
    int n, m, u, v; ll w;
    cin >> n >> m;
    init();
    rep(i, 0, m) {
        scanf("%d%d%lld", &u, &v, &w);
        edge_add(u, v, w);
        edge_add(v, u, w);
    }
    dfs(1, -1);
    LB lb; rep(i, 0, sz) lb.add(a[i]);
    lb.rebuild();
    ll ans = d[n];
    per(i, lb.mx, 0) if(ans < (ans ^ lb.d[i])) ans ^= lb.d[i];
    cout << ans << endl;
    return 0;
}