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
96
97
| #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define maxn 105
#define put() putchar('\n')
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
using namespace std;
void read(int &x){
int f=1;x=0;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
x*=f;
}
namespace Debug{
Tp void _debug(char* f,Ty t){cerr<<f<<'='<<t<<endl;}
Ts void _debug(char* f,Ty x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
Tp ostream& operator<<(ostream& os,vector<Ty>& V){os<<"[";for(auto& vv:V) os<<vv<<",";os<<"]";return os;}
#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
int power(int x,int y=mod-2) {
int sum=1;
while (y) {
if (y&1) sum=sum*x%mod;
x=x*x%mod;y>>=1;
}
return sum;
}
int n,l,m;
double w[27];
struct yyy {
int flag,fail;
int nex[11];
}a[1005];
int cnt,endpos[maxn];
void insert(int id,string s) {
int now=0,i;
for (i=0;i<l;i++) {
if (!a[now].nex[s[i]-'A']) a[now].nex[s[i]-'A']=++cnt;
now=a[now].nex[s[i]-'A'];
}
a[now].flag=1;
endpos[id]=now;
}
queue<int>q;
double b[maxn][maxn],ans[maxn];
const double eps=1e-7;
void guess(int n) {
int i,j,k;
for (i=0;i<=n;i++) {
int id=i;
for (j=i;j<=n;j++) if (abs(b[j][i])>abs(b[id][i])) id=j;
for (j=i;j<=n+1;j++) swap(b[i][j],b[id][j]);
for (j=i+1;j<=n;j++) {
double r=b[j][i]/b[i][i];
for (k=i;k<=n+1;k++) b[j][k]-=b[i][k]*r;
}
}
for (i=n;i>=0;i--) {
for (j=i+1;j<=n;j++) b[i][cnt+1]-=ans[j]*b[i][j];
ans[i]=b[i][n+1]/b[i][i];
}
}
void built(void) {
int i,j,x;
for (i=0;i<m;i++) if (a[0].nex[i]) q.push(a[0].nex[i]);
while (!q.empty()) {
x=q.front();q.pop();
for (i=0;i<m;i++)
if (a[x].nex[i]) q.push(a[x].nex[i]),a[a[x].nex[i]].fail=a[a[x].fail].nex[i];
else a[x].nex[i]=a[a[x].fail].nex[i];
}
for (i=0;i<=cnt;i++) if (!a[i].flag) {
for (j=0;j<m;j++)
b[a[i].nex[j]][i]+=w[j];
}
for (i=0;i<=cnt;i++) b[i][i]-=1;
b[0][cnt+1]=-1;
guess(cnt);
}
signed main(void){
int i,j,x,y;string s;
read(n);read(l);read(m);
for (i=0;i<m;i++) read(x),read(y),w[i]=1.0*max(x*1.0,eps)/y;
for (i=1;i<=n;i++) {
cin>>s;
insert(i,s);
}
built();
for (i=1;i<=n;i++) printf("%.2lf\n",max(0.0,ans[endpos[i]]));
return 0;
}
|