第一次提交的时候,结果是编译失败,因为我没有导入vector的头文件,但我本地是可以运行的,我推断这与C++的编译器版本有关系,我提交时候选择的是C++17,我本地的C++编译器版本是2021年的,比OJ的高一些,所以总结下吧,本地即使能够运行正确,也要检查下自己的导包,是否导入了对应的头文件,不然白白错一次也是要罚时的。
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
struct Edge
{
int from, to;
double cost;
Edge(int from = 0, int to = 0, double cost = 0.0) : from(from), to(to), cost(cost) {}
};
vector<Edge> edges;
bool compareEdge(const Edge &a, const Edge &b)
{
return a.cost < b.cost;
}
int N, M, x[10007], y[10007], par[10007], ranks[10007];
vector<bool> used;
void input()
{
scanf("%d%d", &N, &M);
for (int i = 1; i <= N; i++)
{
scanf("%d%d", &x[i], &y[i]);
}
int p = 0, q = 0;
for (int i = 1; i <= M; i++)
{
scanf("%d%d", &p, &q);
double len = sqrt((x[p] - x[q]) * (x[p] - x[q]) + (y[p] - y[q]) * (y[p] - y[q]));
edges.push_back(Edge(p, q, len * (-1.0)));
used.push_back(false);
}
}
void init()
{
for (int i = 0; i <= N; i++)
{
par[i] = i;
ranks[i] = 1;
}
}
int find(int x)
{
if (x == par[x])
{
return x;
}
else
{
return par[x] = find(par[x]);
}
}
void unite(int x, int y)
{
x = find(x);
y = find(y);
if (x == y)
{
return;
}
if (ranks[x] < ranks[y])
{
par[x] = y;
}
else
{
par[y] = x;
if (ranks[x] == ranks[y])
{
ranks[x]++;
}
}
}
bool same(int x, int y)
{
return find(x) == find(y);
}
void kruskal()
{
sort(edges.begin(), edges.end(), compareEdge);
for (int i = 0; i < edges.size(); i++)
{
Edge edge = edges[i];
if (!same(edge.from, edge.to))
{
used[i] = true;
unite(edge.from, edge.to);
}
}
double ans = 0.0;
for (int i = 0; i < edges.size(); i++)
{
if (!used[i])
{
ans = ans + (edges[i].cost * (-1.0));
}
}
printf("%.3f", ans);
}
int main()
{
input();
init();
kruskal();
return 0;
}