P2951 [USACO09OPEN]捉迷藏Hide and Seek

题目

P2951 [USACO09OPEN]捉迷藏Hide and Seek

Dijkstra代码（TLE）

直接使用前向星Dijkstra最短路模板会超时

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 100005;
int id;
int head[MAXN], vis[MAXN], dis[MAXN], in[MAXN], cnt[MAXN];

struct Edge{
	int to;
	int next;
	int w;
}edge[MAXN];

void add(int u, int v, int w)
{
	edge[id].to = v;
	edge[id].w = w;
	edge[id].next = head[u];
	head[u] = id++;
	in[v]++;
}

int main() 
{
	memset(head, -1, sizeof(head));
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++)
	{
		dis[i] = 0x3f3f3f3f;
	}
	
	for (int i = 0; i < m; i++)
	{
		int u, v;
		scanf("%d%d", &u, &v);
		add(u, v, 1);
		add(v, u, 1);
	}
	
	int cur = 1, MIN;
	dis[cur] = 0;
	while (!vis[cur])
	{
		vis[cur] = 1;
		for (int i = head[cur]; i != -1; i = edge[i].next)
		{
			if (!vis[edge[i].to] && dis[edge[i].to] > dis[cur] + edge[i].w)
			{
				dis[edge[i].to] = dis[cur] + edge[i].w;
			}
		}
		MIN = 0x3f3f3f3f;
		for (int i = 1; i <= n; i++)
		{
			if (!vis[i] && MIN > dis[i])
			{
				MIN = dis[i];
				cur = i;
			}
		}
	}
	int MAX = -0x3f3f3f3f, mx = -1;
	for (int i = 1; i <= n; i++)
	{
		cnt[dis[i]]++;
		if (dis[i] > MAX)
		{
			MAX = dis[i];
			mx = i;
		}
		
	} 
	printf("%d %d %d\n", mx, MAX, cnt[MAX]);
	return 0;
}

堆优化Dijkstra代码（AC）

#include <iostream>
#include <queue>
#include <vector>
using namespace std; 

struct node {
	int id;
	int dis;
	node(){	}
	node(int _id, int _dis)
	{
		id = _id;
		dis = _dis;
	}
	bool operator < (const node &a) const
	{
		if (dis != a.dis)
		{
			return dis > a.dis;
		}
		return id < a.id;
	}
};
const int MAXN = 50005;
const int INF = 0x3f3f3f3f;
int n, m;
vector<node> edge[MAXN];
int dis[MAXN], cnt[MAXN];



void Dijkstra(int s)
{
	for (int i = 1; i <= n; i++)
	{
		dis[i] = INF;
	}
	dis[s] = 0;
	priority_queue<node> q;
	q.push(node(s, dis[s]));
	
	while (!q.empty())
	{
		node now = q.top();
		q.pop();
		for (int i = 0; i < edge[now.id].size(); i++)
		{
			node temp = edge[now.id][i];
			if (dis[temp.id] >  now.dis + temp.dis)
			{
				dis[temp.id] = now.dis + temp.dis;
				q.push(node(temp.id, dis[temp.id]));
			}
		}
	}
} 

int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 0; i < m; i++)
	{
		int u, v, w = 1;
		scanf("%d%d", &u, &v);
		edge[u].push_back(node(v, w));
		edge[v].push_back(node(u, w));
	} 
	Dijkstra(1);
	int p = 1, MAX;
	for (int i = 1; i <= n; i++)
	{
		cnt[dis[i]]++;
		if (dis[i] > MAX)
		{
			MAX = dis[i];
			p = i;
		}
	}
	printf("%d %d %d\n", p, MAX, cnt[MAX]);
	return 0;
}

听说可以用bfs代码，于是我也去试了一下，果然AC

BFS代码（AC）

#include <iostream>
#include <queue>
#include <cstdio>
using namespace std;

struct Node
{
	int step;
	int id;
	Node(int _step, int _id)
	{
		step = _step;
		id = _id;
	}
};

int dis[30005], vis[30005], cnt[30005];
vector<int> a[30005];
queue <Node> q;
int n, m;

void bfs()
{
	vis[1] = true;
	q.push(Node(0, 1));
	while (!q.empty())
	{
		Node now = q.front();
		q.pop();
		for (int i = 0; i < a[now.id].size(); i++)
		{
			if (!vis[a[now.id][i]])
			{
				dis[a[now.id][i]] = now.step + 1;
				vis[a[now.id][i]] = 1;
				q.push(Node(now.step + 1, a[now.id][i]));
			}
		}
	}
}

int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= m; i++)
	{
		int u, v;
		scanf("%d%d", &u, &v);
		a[v].push_back(u);
		a[u].push_back(v);
	}
	bfs();
	int ans = 0, sum = 0, p;
	for (int i = 2; i <= n; i++)
	{
		cnt[dis[i]]++;
		if (dis[i] > ans)
		{
			ans = dis[i];
			p = i;
		}
	}
	printf("%d %d %d\n", p, ans, cnt[ans]);
	return 0;
}