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
86
87
88
89
90
91
92
93
94
95
| #include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<vector>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
inline const int Get_Int() {
int num=0,bj=1;
char x=getchar();
while(x<'0'||x>'9') {
if(x=='-')bj=-1;
x=getchar();
}
while(x>='0'&&x<='9') {
num=num*10+x-'0';
x=getchar();
}
return num*bj;
}
const int maxn=205;
struct Matrix {
int n,m;
double a[maxn][maxn];
Matrix(int n,int m) {
init(n,m);
}
Matrix(int n,int m,char E) {
init(n,m);
for(int i=1; i<=n; i++)a[i][i]=1;
}
void init(int n,int m) {
this->n=n;
this->m=m;
memset(a,0,sizeof(a));
}
double* operator [] (const int x) {
return a[x];
}
Matrix operator * (Matrix& b) {
Matrix c(n,b.m);
for(int i=1; i<=n; i++)
for(int j=1; j<=b.m; j++)
for(int k=1; k<=m; k++)
c[i][j]+=a[i][k]*b[k][j];
return c;
}
void operator *= (Matrix& b) {
*this=*this*b;
}
Matrix operator ^ (int b) {
Matrix ans(n,m,'e'),a=*this;
while(b>0) {
if(b&1)ans=ans*a;
a*=a;
b>>=1;
}
return ans;
}
};
int n,t,map[maxn][maxn];
double p[maxn];
int main() {
n=Get_Int();
t=Get_Int();
for(int i=1; i<=n; i++)scanf("%lf",&p[i]);
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
map[i][j]=map[j][i]=Get_Int();
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
map[i][j]=min(map[i][j],map[i][k]+map[k][j]);
Matrix A(n,n);
for(int i=1; i<=n; i++) {
double sum=0;
for(int j=1; j<=n; j++)sum+=map[i][j];
for(int j=1; j<=n; j++)A[i][j]=map[i][j]/sum;
}
A=A^t;
for(int i=1; i<=n; i++) {
double sum=0;
for(int j=1; j<=n; j++)sum+=A[j][i]*p[j];
printf("%0.6lf\n",sum);
}
return 0;
}
|
