Submission #3774

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
3774	2013-08-31T08:16:29 Z	qja0950	Following Flow (kriii1_F)	C++	0 / 1	0 ms	1116 KB

F

#include <stdio.h>
int n, m;
int line[34][34][3];
int x, y, z, cnt, now, how;
double plus[54][34], ans=0;
int times;
int main() {
//	freopen("input.txt", "r", stdin);
	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]]+=((double)1/(double)how)*plus[times%51][i];
			}
			plus[times%51][i]=0;
		}
		if(plus[times%51][n]!=0) {
			ans+=(plus[times%51][n]*(double)times);
			plus[times%51][n]=0;
		}
		times++;
	}
	printf("%.9lf\n", ans);
	return 0;
}

Subtask #1

0.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1116 KB	Output is correct
2	Correct	0 ms	1116 KB	Output is correct
3	Runtime error	0 ms	1112 KB	SIGSEGV Segmentation fault
4	Halted	0 ms	0 KB	-