The Preliminary Contest for ICPC Asia Shenyang 2019 B. Dudu's maze

本文链接：https://blog.csdn.net/qq_43313637/article/details/100889611

本文深入解析了一道图算法竞赛题目，通过使用深度优先搜索（DFS）和动态规划（DP）来解决复杂网络中的节点和边问题。文章详细介绍了如何初始化图结构，进行连通性分析，并计算特定条件下节点的期望值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

https://nanti.jisuanke.com/t/41402

~~显然，这是一道阅读理解题（鱼队的阅读理解太强了）~~

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<stack>
#include<cstring>
#include<set>
#include<iterator>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<cmath>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<iomanip>
//#include<unordered_set>
using namespace std;
#define lowbit(x) x&(-x)
typedef long long ll;
typedef pair<int, int> P;
const int N = 1e5 + 10;
const int M = 1e4 + 10;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
int mon[N], belong[N], vis[N];
int block[N];
vector<int> g[N];
int cnt = 0;
void init(int n) 
{
	for(int i = 1; i <= n; i++)
	{
		g[i].clear();
	}
	for (int i = 1; i <= n; i++)
	{
		belong[i] = vis[i] = mon[i] = 0;
	}
	for (int i = 0; i < cnt; i++)
	{
		block[i] = 0;
	}
	cnt = 0;

}
void dfs(int s)
{
	belong[s] = cnt;
	block[cnt]++;
	vis[s] = 1;
	for (int i = 0; i < g[s].size(); i++)
	{
		int to = g[s][i];
		if (!vis[to] && !mon[to])
		{
			dfs(to);
		}
	}
}
double dfs2(int s)
{
	if (mon[s])
	{
		double res = 0;
		for (int i = 0; i < g[s].size(); i++)
		{
			int to = g[s][i];
			if (!mon[to] && belong[to])
				res += block[belong[to]];
		}
		return res / g[s].size();
	}
	vis[s] = 1;
	double res = 0;
	for (int i = 0; i < g[s].size(); i++)
	{
		int to = g[s][i];
		if (!vis[to])
		{
			res = max(dfs2(to), res);
		}
	}
	return res;
}
int main()
{
	int t;
	scanf("%d", &t);
	while (t--)
	{
		int n, m, k;
		scanf("%d%d%d", &n, &m, &k);
		for (int i = 0; i < m; i++)
		{
			int x, y;
			scanf("%d%d", &x, &y);
			g[x].push_back(y);
			g[y].push_back(x);
		}
		for (int i = 0; i < k; i++)
		{
			int x;
			scanf("%d", &x);
			mon[x] = 1;
		}
		for (int i = 1; i <= n; i++)
		{
			if (!mon[i] && !vis[i])
			{
				dfs(i);
				cnt++;
			}
		}
		for (int i = 1; i <= n; i++)
		{
			vis[i] = 0;
		}
		printf("%.6f\n",(double)block[0] + dfs2(1));
		init(n);
	}
	return 0;
}