题意:从(0,0)走到(k,0),每次可以从(x,y)走到(x+1,y+1)或(x+1,y)或(x+1,y-1),坐标中有n条线段,对于第i条线段的a[i],b[i],c[i],a[i]=b[i-1],b[i]=a[i+1],且对于a[i]<=x<=b[i],0<=y<=c[i],求有多少种走法。
由于纵坐标最大只有15,所以把0到15这16个点全部塞在一个矩阵里面,对于每条线段跑矩阵快速幂,最后把n个矩阵乘起来。从(0,0)开始,最后输出(0,0)就行。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define ll long long
const ll mod = 1000000007;
ll n, k;
ll l[105], r[105];
int c[105];
struct Matrix
{
ll a[20][20];
void clear()
{
for (int i = 0; i < 16; i++)
for (int j = 0; j < 16; j++)
a[i][j] = 0;
}
Matrix operator * (Matrix &b)const
{
Matrix tmp;
tmp.clear();
for (int i = 0; i < 16; i++)
for (int j = 0; j < 16; j++)
for (int k = 0; k < 16; k++)
tmp.a[i][j] = (tmp.a[i][j] + a[i][k] * b.a[k][j] % mod + mod) % mod;
return tmp;
}
// void print()
// {
// for (int i = 0; i < 16; i++)
// {
// for (int j = 0; j < 16; j++)
// printf("%lld ", a[i][j]);
// putchar('\n');
// }
// putchar('\n');
// }
};
Matrix fast_pow(Matrix mat, ll n)
{
Matrix tmp;
tmp.clear();
for (int i = 0; i < 16; i++) tmp.a[i][i] = 1;
while (n)
{
if (n & 1)
tmp = tmp * mat;
mat = mat * mat;
n >>= 1;
}
return tmp;
}
int main()
{
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> l[i] >> r[i] >> c[i];
Matrix ans;
ans.clear();
for (int i = 0; i < 16; i++) ans.a[i][i] = 1;
for (int i = 0; i < n; i++)
{
Matrix tmp;
tmp.clear();
for (int j = 0; j <= c[i]; j++)
{
tmp.a[j][j]++;
if (j - 1 >= 0) tmp.a[j][j - 1]++;
if (j + 1 <= c[i]) tmp.a[j][j + 1]++;
}
if (r[i] < k)
tmp = fast_pow(tmp, r[i] - l[i]);
else
tmp = fast_pow(tmp, k - l[i]);
// tmp.print();
ans = ans * tmp;
}
cout << ans.a[0][0] << endl;
return 0;
}