#include <stdio.h>
int n, m;
int line[31][31][2];
int x, y, z, cnt, now, how;
double plus[51][31], ans=0;
int times;
int main() {
scanf("%d %d", &n, &m);
int i, j;
for(i=1; i<=m; i++) {
scanf("%d %d %d", &x, &y, &z);
line[x][0][0]++;
line[x][line[x][0][0]][0]=y;
line[x][line[x][0][0]][1]=z;
}
plus[0][0]=1;
while(times<=1000) {
for(i=0; i<n; i++) {
how=line[i][0][0];
if(how==0 || plus[times%51][i]==0) continue;
for(j=1; j<=how; j++) {
plus[(times+line[i][j][1])%51][line[i][j][0]]+=(1./how)*plus[times%51][i];
}
plus[times%51][i]=0;
}
if(plus[times%51][n]!=0) {
ans+=(plus[times%51][n]*times);
plus[times%51][n]=0;
}
times++;
}
printf("%.9lf", ans);
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1108 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1108 KB |
Output is correct |
| 3 |
Runtime error |
0 ms |
1104 KB |
SIGSEGV Segmentation fault |
| 4 |
Halted |
0 ms |
0 KB |
- |
