| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 3646 | cki86201 | Following Flow (kriii1_F) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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()
{
freopen("input.txt","r",stdin);
double ans=0;
int s=0, e=1, cnt=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(++cnt<10000){
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);
}