P2212 [USACO14MAR]Watering the Fields S(Prim)

[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;
}

P2212 [USACO14MAR]Watering the Fields S(Prim)相关推荐

P2212 [USACO14MAR]Watering the Fields S（最小生成树）
题目描述 Due to a lack of rain, Farmer John wants to build an irrigation system to send water between hi ...
BZOJ 3479: [Usaco2014 Mar]Watering the Fields( MST )
MST...一开始没注意-1结果就WA了... ---------------------------------------------------------------------------- ...
0x62.图论 - 最小生成树
目录一.KruskalKruskalKruskal算法 1.P3366 [模板]最小生成树二.PrimPrimPrim算法 2.P2212 [USACO14MAR]Watering the Fie ...
Minimum/Maximum Spanning Tree/Forest
MST问题.对于一个有权无向图,使其原有连通块保持连通性并形成树,同时边权之和最小.换一种说法,最小生成树或者最小生成森林. 两个算法一个推论. Kruskal's Algorithm 基于贪心.将边 ...
语法入门*算法入门题单
作者:王清楚链接:https://ac.nowcoder.com/discuss/817596?type=101&order=0&pos=1&page=4&chann ...
【新手上路】语法入门算法入门题单
作者:王清楚链接:[新手上路]语法入门&算法入门题单_ACM竞赛_ACM/CSP/ICPC/CCPC/比赛经验/题解/资讯_牛客竞赛OJ_牛客网来源:牛客网介绍:本题单分为语法入门和算法 ...
USACO oct. 09 Watering Hole
USACO oct. 09 Watering Hole 2017年7月15日 Prim算法 #include<iostream> #include<algorithm> #in ...
【题解】Luogu P2214 [USACO14MAR]哞哞哞Mooo Moo
P2214 [USACO14MAR]哞哞哞Mooo Moo 题目描述 Farmer John has completely forgotten how many cows he owns! He is ...
刷题周记（九）——#状压DP：最短Hamilton路径、小国王（互不侵犯）、玉米田(Corn Fields G)、愤怒的小鸟、吃奶酪、炮兵阵地、宝藏 #区间DP：清空字符串#DP：关灯问题II
文章目录 --2020年12月20日(周日)------------------ 状压DP 一.最短Hamilton路径(模板题) 二.玉米田(P1879 [USACO06NOV]Corn Field ...

P2212 [USACO14MAR]Watering the Fields S(Prim)

P2212 [USACO14MAR]Watering the Fields S(Prim)相关推荐

最新文章

热门文章