思路
-
显然,题目中的 p 1 p1 p1 , p 2 p2 p2 , p 3 p3 p3 应在三个不同的家庭处,那么 B F BF BF 枚举三个点的位置再加上前缀和优化,就能 O ( n 3 ) O(n^3) O(n3) 求解,但这个复杂度太差了。
-
前缀和如何优化?如果你把居民从家走到集会点看成从家走到 p 4 p4 p4 ,再减去 p 4 p4 p4 到其集会点的距离,则对于划分出的一个区间,其减去的值的和应为区间内的人数(前缀和处理) × \times × 1 1 1 集会点距起点的距离。
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int n, l;
set<int> s;
vector<pii> families;
vector<ll> preSum;
int p1, p2, p3;
inline ll getPreSum(int left, int right) {
return preSum[right + 1] - preSum[left];
}
inline ll f1(int x) {
return getPreSum(0, x) * (l - families[x].first) + getPreSum(x + 1, p2) * (l - families[p2].first);
}
inline ll f2(int x) {
return getPreSum(p2 + 1, x) * (l - families[x].first);
}
int sanfen1(int left, int right) {
while (left < right - 1) {
int mid1 = (left + right) / 2,
mid2 = (mid1 + right) / 2;
if (f1(mid1) > f1(mid2)) right = mid2;
else left = mid1;
}
return f1(left) > f1(right) ? left : right;
}
int sanfen2(int left, int right) {
while (left < right - 1) {
int mid1 = (left + right) / 2,
mid2 = (mid1 + right) / 2;
if (f2(mid1) > f2(mid2)) right = mid2;
else left = mid1;
}
return f2(left) > f2(right) ? left : right;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
cin >> n >> l;
families.resize(n);
preSum.resize(n + 1);
for (pii &it:families) {
cin >> it.first >> it.second;
s.insert(it.first);
}
if (s.size() <= 3) {
cout << "0\n";
return 0;
}
sort(families.begin(), families.end());
preSum[0] = 0;
for (int i = 1; i <= n; i++)
preSum[i] = preSum[i - 1] + families[i - 1].second;
ll Sum = 0;
for (pii it:families) Sum += (l - it.first) * it.second;
ll ans = 0x3f3f3f3f3f3f3f3f;
for (int i = 1; i < n - 1; i++) {
p2 = i;
p1 = sanfen1(0, p2 - 1);
p3 = sanfen2(p2 + 1, n - 1);
ans = min(ans, Sum - f1(p1) - f2(p3));
}
cout << ans << endl;
return 0;
}