Xor-sequences (codeforces 691E)

Problem

You are given n integers $a_1,  a_2,  ...,  a_n$.

A sequence of integers $x_1,  x_2,  ...,  x_k$ is called a “xor-sequence” if for every 1  ≤  i  ≤  k - 1 the number of ones in the binary representation of the number $x_i$ $xor$ $x_{i + 1}$’s is a multiple of 3 and for all 1 ≤ i ≤ k. The symbol is used for the binary exclusive or operation.

How many “xor-sequences” of length k exist? Output the answer modulo $10^9 + 7$.

Note if a = [1, 1] and k = 1 then the answer is 2, because you should consider the ones from a as different.

Input

The first line contains two integers n and k (1 ≤ n ≤ 100, 1 ≤ k ≤ $10^{18}$) — the number of given integers and the length of the “xor-sequences”.

The second line contains n integers ai (0 ≤ ai ≤ $10^{18}$).

Output

Print the only integer c — the number of “xor-sequences” of length k modulo $10^9 + 7$.

Sample Input

5 2
15 1 2 4 8

5 1
15 1 2 4 8

Sample Output

13
5

---

题目描述：

给出序列 $a_1,a_2,...,a_n$，从中选出k个数（可重复选择）构成序列$x_1,x_2,...,x_k$，需满足 $x_i$ 异或 $x_{i+1}$的值在二进制表示下1的个数是3的倍数（$1 \le i < n$），问共有多少种选择方案？

分析：

如果 $x_i$ 异或 $x_{i+1}$的值在二进制表示下1的个数是3的倍数，那么$x_i$ 和 $x_{i+1}$可以连接，即 $i$ 到 $i+1$ 存在转移，令$d[i][j] = 1$，得到转移矩阵。对转移矩阵做 $k-1$ 次矩阵乘法，得到最终矩阵，将最终矩阵所有的值加起来即为答案，用矩阵快速幂加速。
解释：最终矩阵 $d[i][j]=x$ 意义为，以$a_i$起始，$a_j$结束的满足条件的序列数量为 x x <script type="math/tex" id="MathJax-Element-1707">x</script> 个。

AC代码：

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<time.h>
#include<iostream>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>

using namespace std;

const int mod = 1e9+7;

struct Matrix
{
    int n,m;
    long long d[100][100];
    Matrix (int a,int b)
    {
        n = a, m = b;
        memset(d,0,sizeof(d));
    }
    void Copy(int *tmp)
    {
        for (int i=0;i<n;i++)
            for (int j=0;j<m;j++)
            {
                d[i][j] = *tmp;
                tmp++;
            }
    }
    friend Matrix operator * (const Matrix &a,const Matrix &b)
    {
        Matrix c(a.n,b.m);
        for (int i=0;i<a.n;i++)
            for (int j=0;j<b.m;j++)
            {
                long long tmp = 0;
                for (int k=0;k<a.m;k++)
                {
                    tmp += a.d[i][k] * b.d[k][j] % mod;
                    if (tmp >= mod) tmp -= mod; 
                }
                c.d[i][j] = tmp;
            }
        return c;
    }
};

int n;
long long k,a[110];

int getnum(long long x)
{
    int cnt = 0;
    while (x)
    {
        cnt += x&1;
        x>>=1;
    }
    return cnt % 3;
}

void solve(long long m)
{
    Matrix A(100,100);
    for (int i=0;i<n;i++) A.d[i][i] = 1;

    Matrix B(100,100);
    for (int i=0;i<n;i++) 
        for (int j=0;j<n;j++)
            if (!getnum(a[i]^a[j])) B.d[i][j] = 1;  

    while (m)
    {
        if (m & 1) A = A*B;
        B = B*B;
        m = m>>1;
    }

    long long cnt = 0;
    for (int i=0;i<n;i++) 
        for (int j=0;j<n;j++)
        {
            cnt = cnt + A.d[i][j];
            if (cnt >= mod) cnt -= mod;
        }
    printf("%lld\n",cnt);
    return;
}

int main()
{
    while (scanf("%d %lld",&n,&k)!=EOF)
    {
        for (int i=0;i<n;i++) scanf("%lld",&a[i]);

        if (k == 1) 
        {
            printf("%d\n",n);
            continue;
        }

        solve(k-1);
    }
    return 0;
}