BZOJ4128: Matrix(BSGS 矩阵乘法)

Time Limit: 10 Sec  Memory Limit: 128 MB
Submit: 813  Solved: 442
[Submit][Status][Discuss]

Description

给定矩阵A,B和模数p,求最小的x满足

A^x = B (mod p)

Input

第一行两个整数n和p，表示矩阵的阶和模数,接下来一个n * n的矩阵A.接下来一个n * n的矩阵B

Output

输出一个正整数，表示最小的可能的x，数据保证在p内有解

Sample Input

2 7
1 1
1 0
5 3
3 2

Sample Output

4

HINT

对于100%的数据，n <= 70,p <=19997，p为质数,0<= A_{ij},B_{ij}< p

保证A有逆

 

Source

裸的BSGS，把$x$分解为$im - j$

原式化为$a^{im} \equiv ba^j \pmod p$

其中$m = \ceil{sqrt(p)}$

然后枚举一个$j$，存到map里

再枚举一个$i$判断即可

一开始map写成bool类型了调了半个小时

#include<cstdio>
#include<algorithm>
#include<cmath>
#include<map>
//#define LL long long
using namespace std;
const int MAXN =  * 1e5 + ;
inline int read() {
    char c = getchar(); int x = , f = ;
    while(c < '' || c > '') {if(c == '-') f = -; c = getchar();}
    while(c >= '' && c <= '') x = x *  + c - '', c = getchar();
    return x * f;
}
int N, mod, M;
struct Matrix {
    int m[][];
    Matrix operator * (const Matrix &rhs) const {
        Matrix ans = {};
        for(int i = ; i <= N; i++)
            for(int j = ; j <= N; j++)
                for(int k = ; k <= N; k++)
                    (ans.m[i][j] += m[i][k] * rhs.m[k][j]) %= mod;
        return ans;
    }
    void init() {
        for(int i = ; i <= N; i++)
            for(int j = ; j <= N; j++)
                m[i][j] = read();
    }
    void print() {
        for(int i = ; i <= N; i++, puts(""))
            for(int j = ; j <= N; j++)
                printf("%d ", m[i][j]);
    }
    bool operator < (const Matrix &rhs) const {
        for(int i = ; i <= ; i++)
            for(int j = ; j <= ; j++) {
                if(m[i][j] < rhs.m[i][j]) return ;
                if(m[i][j] > rhs.m[i][j]) return ;
            }
        return ;
    }
}A, B;
map<Matrix, int> mp;
void MakeMap() {
    Matrix a = B;
    mp[a] = ;
    for(int i = ; i <= M; i++) a = a * A, mp[a] = i;
}
void FindAns() {
    Matrix a, am = A;
    for(int i = ; i <= M - ; i++) am = am * A;
    a = am;
    for(int i = ; i <= M; i++) {
        if(mp[a]) printf("%d", i * M - mp[a]), exit();
        a = a * am;
    }
}
main() {
    N = read(); mod = read();
    A.init(); B.init();
    M = (double)ceil(sqrt(mod));
    MakeMap();
    FindAns();
}