2019南京现场赛 Robots 概率DP

Robot

//MADE BY Y_is_sunshine;
//#include <bits/stdc++.h>
//#include <memory.h>
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <cstdio>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>

#define INF 0x3f3f3f3f
#define MAXN 200005

const int mod = 1e9 + 7;
const double PI = acos(-1);

using namespace std;

int N, M, K;

int out[MAXN];
double dp1[MAXN];
double dp2[MAXN];

vector<int > edge[MAXN];

void init()
{
	for (int i = 0; i <= N; i++)
	{
		edge[i].clear();
		dp1[i] = 0;
		dp2[i] = 0;
		out[i] = 0;
	}
}

double f1(int x) {
	if (dp1[x] != 0) return dp1[x];
	if (out[x] == 0) return dp1[x];
	double sum = 0;
	for (auto it1 = edge[x].begin(); it1 != edge[x].end(); it1++) {
		sum += f1(*it1);
	}
	//return dp1[x] = sum / out[x] * 1.0 + 1 + 1.0 / out[x];
	return dp1[x] = sum * 1.0 / out[x] + 1.0 / out[x] + 1;

}


double f2(int x) {
	if (dp2[x] != 0) return dp2[x];
	if (out[x] == 0) return dp2[x];
	double sum = 0;
	for (auto it1 = edge[x].begin(); it1 != edge[x].end(); it1++) {
		sum += f2(*it1);
	}
	return dp2[x] = sum / out[x] * 1.0 + (1 + 1.0 / out[x] * 1.0)*dp1[x];
	//return dp2[x] = sum / out[x] + (out[x] + 1.0) / (out[x]) * dp1[x];
}

int main() {
	freopen("data.txt", "r", stdin);

	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int T;
	cin >> T;
	while (T--) {
		init();
		cin >> N >> M;
		for (int i = 0; i < M; i++) {
			int a, b;
			cin >> a >> b;
			edge[a].push_back(b);
			out[a]++;
		}

		f1(1);
		printf("%.2f\n", f2(1));

	}
	




	freopen("CON", "r", stdin);
	system("pause");
	return 0;
}