#include<stdio.h>
#include<vector>
#include<time.h>
struct edge{
int st,en,len;
};
edge data[1005];
double t[2][35],p[2][35];
double cnt[35];
int n,m;
int main()
{
double ans=0;
int s=0, e=1, ct=0;
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
scanf("%d%d%d",&data[i].st,&data[i].en,&data[i].len);
cnt[data[i].st]++;
}
p[s][0]=1;
while(++ct<3000){
for(int i=0;i<=n;i++)p[e][i]=t[e][i]=0;
for(int i=0;i<m;i++){
p[e][data[i].en]+=p[s][data[i].st]/cnt[data[i].st];
t[e][data[i].en]+=(t[s][data[i].st]+data[i].len*p[s][data[i].st])/cnt[data[i].st];
}
ans+=t[e][n];
s=!s; e=!e;
}
printf("%.9lf",ans);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1100 KB |
Output is correct |
2 |
Correct |
0 ms |
1100 KB |
Output is correct |
3 |
Correct |
132 ms |
1100 KB |
Output is correct |
4 |
Correct |
44 ms |
1100 KB |
Output is correct |
5 |
Correct |
36 ms |
1100 KB |
Output is correct |
6 |
Correct |
32 ms |
1100 KB |
Output is correct |
7 |
Correct |
52 ms |
1100 KB |
Output is correct |
8 |
Correct |
52 ms |
1100 KB |
Output is correct |
9 |
Incorrect |
0 ms |
1100 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |