CF - Magic Gems
题目链接: Educational Codeforces Round 60 (Rated for Div. 2) Magic Gems
题意
有两种宝石,第一种是普通宝石,第二种是魔法宝石,每个魔法宝石可以分成m个连续的普通宝石,这两种宝石所占格子都是一个,给你一个N个连续的格子,求能够填满这个格子的最初排列情况
数据范围: 2 ≤ M ≤ 100 2 \le M \le 100 2≤M≤100 , 1 ≤ N ≤ 1 0 18 1 \le N \le 10^{18} 1≤N≤1018
思路
设dp[n] 代表着能够组成 n 的情况,那么根据当前最后一个宝石的两种情况,我们可以 列出式子 d p n = d p n − m + d p n − 1 dp_n = dp_{n - m} + dp_{n - 1} dpn=dpn−m+dpn−1
当前的n有点大,我们可以用矩阵快速幂进行优化,
代码
#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int M = 1e9+7;
struct matrix {
vector<vector<LL> > v;
matrix(int n, int m) : v(n, vector<LL>(m)) {}
};
matrix operator * (matrix a, matrix b) {
int n = a.v.size();
int m = a.v[0].size();
assert(b.v.size() == m);
int k = b.v[0].size();
matrix ans (n, k);
for (int i=0; i<n; i++)
for (int j=0; j<k; j++)
for (int l=0; l<m; l++)
ans.v[i][j] = (ans.v[i][j] + a.v[i][l]*b.v[l][j])%M;
return ans;
}
matrix power(matrix a, LL p) {
if (p==1||p==0) return a;
matrix ans = power(a, p/2);
ans = ans * ans;
if (p%2) ans = (ans * a);
return ans;
}
void print(matrix a) {
for(int i =0 ; i < a.v.size() ; i++ ) {
for(int j =0 ; j < a.v[0].size() ; j++ ) {
cout<<a.v[i][j]<<" ";
}
cout<<endl;
}
}
int main()
{
LL n , k;
cin>>n>>k;
if (n < k) {
cout << 1 << endl;
return 0;
}
if (n == k) {
cout << 2 << endl;
return 0;
}
matrix base(k ,k);
matrix ans(k,k);
for(int i = 0;i < k;i ++) ans.v[i][0] = 1;
ans.v[k-1][0] = 2;
base.v[k-1][0] = base.v[k-1][k-1] = 1;
for(int i =1 ; i< k ; i++ ) {
base.v[i-1][i] = 1;
}
ans = power(base , n-k)*ans;
cout<<ans.v[k-1][0]<<endl;
return 0;
}