题目大意
给出一个有很多洞的桌子,每个洞下面都吊着一个重物,现在将挂重物的绳子打结,求出最后打结点的坐标。
解题思路
大三蒟蒻不太会分析这种物理题,参考了题解的题意:
根据物理的知识,当系统处于平衡状态时,系统的总能量最小。又因为系统的总能量是等于各个物体的重力势能,在质量一定时,即要求物体离地最近,离桌子最远。那么,也就是绳子在桌子上的距离尽量的小。即 ∑ i = 1 n m i d i s ( p 0 , p i ) \sum_{i=1}^nm_idis(p_0,p_i) ∑i=1nmidis(p0,pi)最小。
思路一
于是我们不难想到使用模拟退火解决类似费马点的问题,模拟退火的学习参考了 M _ s e a M\_sea M_sea的博客。
//
// Created by Happig on 2020/11/10
//
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ins insert
#define Vector Point
#define ENDL "\n"
#define lowbit(x) (x&(-x))
#define mkp(x, y) make_pair(x,y)
#define mem(a, x) memset(a,x,sizeof a);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const double eps = 1e-14;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const double dinf = 1e300;
const ll INF = 1e18;
const int Mod = 1e9 + 7;
const int maxn = 2e5 + 10;
const double T = 1000;
const double delta = 0.998;
struct Point {
double x, y, w;
Point(double a = 0, double b = 0, double c = 0) : x(a), y(b), w(c) {}
} p[2020];
int n;
double getRandomPro() {
return rand() * 1.0 / RAND_MAX;
}
double dis(Point a, Point b) {
return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
double f(Point s) {
double sum = 0;
for (int i = 0; i < n; i++) {
sum += dis(s, p[i]) * p[i].w;
}
return sum;
}
Point ans;
void SA() {
double sum = dinf, t = T;
Point tmp = ans;
while (t > eps) {
Point nxt(tmp.x + ((rand() << 1) - RAND_MAX) * t, tmp.y + ((rand() << 1) - RAND_MAX) * t);
//Point nxt(tmp.x + dx[i] * t, tmp.y + dy[i] * t);
double res = f(nxt);
double del = res - sum;
if (del < 0) {
ans = tmp = nxt;
sum = res;
} else if (exp(-del / t) * RAND_MAX > rand() * 1.0) {
tmp = nxt;
}
t *= delta;
}
}
int main() {
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
//ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
srand(233333333);
srand(rand()), srand(rand());
scanf("%d", &n);
double sumx = 0, sumy = 0;
for (int i = 0; i < n; i++) {
scanf("%lf%lf%lf", &p[i].x, &p[i].y, &p[i].w);
sumx += p[i].x, sumy += p[i].y;
}
ans = Point(sumx / n, sumy / n);
for (int i = 0; i < 5; i++) SA();
printf("%.3lf %.3lf\n", ans.x, ans.y);
return 0;
}
思路二
在评论区我发现了一个十分神奇的结论解法——三分套三分,以下是关于费马点的结论:
当确定 x x x坐标时,距离和函数关于 y y y是一个单峰函数;确定 y y y坐标时,距离和函数关于 x x x是一个单峰函数。
又因为这道题和费马点十分类似,完全可以照搬思路。于是我们可以先三分 x x x再三分 y y y,这样确定答案,之所以采用三分一百次的写法,是因为浮点误差不好控制,三分一百次的精度是最高的!(写 w h i l e ( l + e p s < r ) while(l+eps<r) while(l+eps<r)形式的三分, e p s = 1 e − 12 eps = 1e^{-12} eps=1e−12会 W A WA WA, e p s = 1 e − 14 eps = 1e^{-14} eps=1e−14就 T L E TLE TLE,尝试开了 l o n g d o u b l e long~double long double虽然过了但是跑的贼慢,由此可知,在精度不能完全把握的情况下浮点数的三分使用三分一百次的写法最靠谱)
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
const double eps = 1e-10;
struct Point {
double x, y, w;
Point(double a = 0, double b = 0, double c = 0) : x(a), y(b), w(c) {}
} p[maxn];
int n;
double ly, ry;
double dis(Point a, Point b) {
return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
double f(double x, double y) {
double ans = 0;
Point cur(x, y);
for (int i = 0; i < n; i++) {
ans += dis(cur, p[i]) * p[i].w;
}
return ans;
}
double tri_search(double x) {
ly = -10000.0, ry = 10000.0;
double midl, midr;
for (int i = 1; i <= 100; i++) {
midl = ly + (ry - ly) / 3.0;
midr = ry - (ry - ly) / 3.0;
if (f(x, midl) > f(x, midr)) {
ly = midl;
} else ry = midr;
}
return f(x, midl);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lf%lf%lf", &p[i].x, &p[i].y, &p[i].w);
}
double lx = -10000.0, rx = 10000.0, midl, midr;
for (int i = 1; i <= 100; i++) {
midl = lx + (rx - lx) / 3.0;
midr = rx - (rx - lx) / 3.0;
if (tri_search(midl) > tri_search(midr)) {
lx = midl;
} else rx = midr;
}
printf("%.3lf %.3lf\n", lx, ly);
return 0;
}