Submission #3814

#TimeUsernameProblemLanguageResultExecution timeMemory
3814qja0950Following Flow (kriii1_F)C++98
0 / 1
0 ms1220 KiB
#include <stdio.h> #include <vector> using namespace std; typedef pair<int,int> P; vector<P> line[32]; int n, m; //int line[34][34][3]; int x, y, z, cnt, now, how; double plus[54][34], ans=0, fast; int times; int main() { // freopen("input.txt", "r", stdin); scanf("%d %d", &n, &m); int i, j; P temp; for(i=1; i<=m; i++) { scanf("%d %d %d", &x, &y, &z); temp.first=y;temp.second=z; line[x].push_back(temp); /* 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<=99) { for(i=0; i<n; i++) { how=line[i].size(); if(how==0 || plus[times%51][i]==0) continue; for(j=0; j<how; j++) { plus[(times+line[i][j].second)%51][line[i][j].first]+=((double)1/(double)how)*plus[times%51][i]; } plus[times%51][i]=0; } if(plus[times%51][n]!=0) { fast=(plus[times%51][n]*(double)times); // printf("%.50lf\n", fast); if(fast<0.000000000005) break; ans+=fast; plus[times%51][n]=0; } times++; } // printf("%d", times); printf("%.9lf\n", ans); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...