P2212 [USACO14MAR]Watering the Fields S(Prim)

最新推荐文章于 2024-11-10 21:54:30 发布

eva_can(not)survive

最新推荐文章于 2024-11-10 21:54:30 发布

阅读量107

点赞数

分类专栏：洛谷学习图论文章标签：算法

本文链接：https://blog.csdn.net/Ghostttttttiii/article/details/124440060

版权

洛谷学习同时被 2 个专栏收录

202 篇文章 0 订阅

订阅专栏

图论

43 篇文章 0 订阅

订阅专栏

本文提供了一段USACO比赛中的题目Watering the Fields的解决方案。代码使用C++编写，主要涉及最短路径算法，计算两点间距离并更新最短距离，寻找下一个最近未访问的点，直至所有点都被访问。最终输出灌溉田地的最小距离。

摘要由CSDN通过智能技术生成

[USACO14MAR]Watering the Fields S - 洛谷https://www.luogu.com.cn/problem/P2212

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

int n, c;
struct node {
	int x, y;
};
node ver[MAXN];
bool vis[MAXN];

inline int dis(int a, int b) {
	return (ver[a].x - ver[b].x) * (ver[a].x - ver[b].x) + (ver[a].y - ver[b].y) * (ver[a].y - ver[b].y);
}
int d[MAXN];

int main() {
	scanf("%d %d", &n, &c);
	for (int i = 1; i <= n; i++) {
		scanf("%d %d", &ver[i].x, &ver[i].y);
	}
	for (int i = 1; i <= n; i++) {
		d[i] = INF;
	}
	int ans = 0;
	int pos = 1, now = 1;
	while (true) {
		vis[pos] = true;
		for (int i = 1; i <= n; i++) {
			int t = dis(pos, i);
			if (t >= c && t < d[i]) {
				d[i] = t;
			}
		}
		int minn = INF;
		for (int i = 1; i <= n; i++) {
			if (!vis[i] && minn > d[i]) {
				minn = d[i], pos = i;
			}
		}
		if (minn == INF)
			break;
		ans += minn, now++;
		//printf("%d\n", minn);
	}
	if (now != n) {
		printf("-1");
	} else {
		printf("%d", ans);
	}
	return 0;
}