1003.Ink on paper
题目大意:
第 i i i滴墨水的起始位置是 ( x i , y i ) (x_i,y_i) (xi,yi)以每秒0.5厘米的速度向外圆形扩散,问所有墨滴联通要多久,输出时间的平方。
思路:
跑一遍最小生成树,然后记录max边权。
因为是完全图,边很多,所以跑Prim准没错。
一开始跑了Kruskal导致出错了一发,要牢记!!
- 复杂度:Kruskal (mlogm)
- 复杂度:Prim (n^2 +m)
代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 2e3 + 9;
const ll INF = 0x3f3f3f3f3f3f3f3f;
ll e[maxn][maxn], cal[maxn], x[maxn], y[maxn];
int vis[maxn];
int n;
void init() {
for (int i = 1; i <= n; i++) e[i][i] = 0;
}
ll dist(int i, int j) {
return (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
}
void Prim() {
memset(vis, 0, sizeof(vis));
for (int i = 1; i <= n; i++) cal[i] = e[1][i];
vis[1] = 1;
ll mind, ans = 0;
int u, v;
for (int i = 1; i <= n - 1; i++) {
mind = INF;
u = -1;
for (int j = 1; j <= n; j++) {
if (!vis[j] && mind > cal[j]) {
mind = cal[j];
u = j;
}
}
if (u == -1) break;
ans = max(ans, cal[u]);
vis[u] = 1;
for (v = 1; v <= n; v++) {
if (!vis[v] || e[u][v] < INF) {
if (cal[v] > e[u][v])
cal[v] = e[u][v];
}
}
}
printf("%lld\n", ans);
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%lld %lld", &x[i], &y[i]);
init();
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++)
e[i][j] = e[j][i] = dist(i, j);
Prim();
}
return 0;
}
后来发现Kruskal也也不是不能跑。
简单说把完全图边权从小到大排列,然后一个个Union并查集维护,不重复连同一点,同时保证刚好所有点都连接上了就跳出,此时一定最优。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5e3 + 10;
int fa[N] ;
int sum = 0;
int find(int x) {
if (fa[x] != x) fa[x] = find(fa[x]);
return fa[x];
}
void Union(int x, int y) {
int fx = find(x), fy = find(y);
if (fx != fy) fa[fy] = fx, sum++;
}
int T, n;
ll x[N], y[N];
struct node {
int x, y;
ll dis;
bool operator<(const node &b) const {
return dis < b.dis;
}
} Node[N * N];
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
int cnt = 0;
for (int i = 1; i <= n; i++) scanf("%lld%lld", &x[i], &y[i]);
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++)
Node[++cnt] = {i, j, (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j])};
}
for (int i = 0; i <= n; i++) fa[i] = i;
sort(Node + 1, Node + cnt + 1);
sum = 0;
for (int i = 1; i <= cnt; i++) {
Union(Node[i].x, Node[i].y);
if (sum == n - 1) {
printf("%lld\n", Node[i].dis);
break;
}
}
}
}