-
Notifications
You must be signed in to change notification settings - Fork 0
/
1533.cpp
85 lines (77 loc) · 1.85 KB
/
1533.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <iostream>
#include <vector>
#define N 15
#define M 1000003
using namespace std;
typedef long long ll;
int n, s, e, t;
ll arr[N * 5][N * 5];
ll ans[N * 5][N * 5];
int main()
{
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
int i, j, k;
scanf("%d %d %d %d", &n, &s, &e, &t);
for (i = 1; i <= n; i++)
{
for (j = 0; j < 4; j++)
arr[i * 5 - j - 1][i * 5 - j] = 1;
}
for (i = 1; i <= n; i++)
{
getchar();
for (j = 1; j <= n; j++)
{
int w = getchar() - '0';
if (w)
arr[i * 5][j * 5 - w + 1] = 1;
}
}
for (i = 1; i <= n * 5; i++)
ans[i][i] = 1;
ll imsi[N * 5][N * 5];
while (t)
{
if (t % 2)
{
for (i = 1; i <= n * 5; i++)
{
for (j = 1; j <= n * 5; j++)
{
imsi[i][j] = 0;
for (k = 1; k <= n * 5; k++)
{
imsi[i][j] += ans[i][k] * arr[k][j];
imsi[i][j] %= M;
}
}
}
for (i = 1; i <= n * 5; i++)
{
for (j = 1; j <= n * 5; j++)
ans[i][j] = imsi[i][j];
}
}
for (i = 1; i <= n * 5; i++)
{
for (j = 1; j <= n * 5; j++)
{
imsi[i][j] = 0;
for (k = 1; k <= n * 5; k++)
{
imsi[i][j] += arr[i][k] * arr[k][j];
imsi[i][j] %= M;
}
}
}
for (i = 1; i <= n * 5; i++)
{
for (j = 1; j <= n * 5; j++)
arr[i][j] = imsi[i][j];
}
t /= 2;
}
printf("%lld", ans[s * 5][e * 5]);
return 0;
}