C. Heavy Intervals
C. Heavy Intervals
You have intervals , such that for each , and all the endpoints of the intervals are distinct.
The -th interval has weight per unit length. Therefore, the weight of the -th interval is .
You don't like large weights, so you want to make the sum of weights of the intervals as small as possible. It turns out you can perform all the following three operations:
- rearrange the elements in the array in any order;
- rearrange the elements in the array in any order;
- rearrange the elements in the array in any order.
However, after performing all of the operations, the intervals must still be valid (i.e., for each , must hold).
What's the minimum possible sum of weights of the intervals after performing the operations?
Input
Each test contains multiple test cases. The first line contains the number of test cases (). The description of the test cases follows.
The first line of each test case contains a single integer () — the number of intervals.
The second line of each test case contains integers () — the left endpoints of the initial intervals.
The third line of each test case contains integers () — the right endpoints of the initial intervals.
It is guaranteed that are all distinct.
The fourth line of each test case contains integers () — the initial weights of the intervals per unit length.
It is guaranteed that the sum of over all test cases does not exceed .
Output
For each test case, output a single integer: the minimum possible sum of weights of the intervals after your operations.
Example
input
2
2
8 3
12 23
100 100
4
20 1 2 5
30 4 3 10
2 3 2 3
output
2400
42
Note
In the first test case, you can make
- ;
- ;
- .
In that case, there are two intervals:
- interval with weight per unit length, and in total;
- interval with weight per unit length, and in total.
The sum of the weights is . It can be shown that there is no configuration of final intervals whose sum of weights is less than .
In the second test case, you can make
- ;
- ;
- .
In that case, there are four intervals:
- interval with weight per unit length, and in total;
- interval with weight per unit length, and in total;
- interval with weight per unit length, and in total;
- interval with weight per unit length, and in total.
The sum of the weights is . It can be shown that there is no configuration of final intervals whose sum of weights is less than .
解题思路
首先为了使得分数最小,根据排序不等式应该让数组 以值为关键字,区间以长度为关键字,一个升序另外一个降序,然后对应项相乘并对乘积的结果求和。
另外容易知道对于任意合法的区间构造方案(即区间的右端点大于左端点),区间的总长度是一个定值 。因此在这个前提下,应该如何构造区间才能使得分数最小。
考虑例子 。有两种构造方案,分别是 和 ,对应的分数是 。另外一种是 和 ,对应的分数是 。很明显第二种方案会更优,可以发现第一种方案中两个区间是相交的(非包含),而第二种方案的区间是包含的,可以证明把两个相交的区间变成包含关系,分数会变小。
假设现在有两个区间 和 ,并且满足 ,,,那么此时分数是 。将 和 交换,区间变成包含关系,分数变成了 。令 得到 ,得证。
因此只要存在两个区间是非包含的相交关系,则将其变成包含关系,那么最后得到的 个区间中的任意两个区间都满足包含关系。要得到这些区间的方法是把所有的 和 放到一起排序,从小到大枚举,如果发现是左端点的值,则将其压入栈中,如果是右端点的值,则与栈顶元素匹配变成一个区间,并把栈顶元素弹出(整个过程类似于括号匹配,每个右端点尽量匹配到最靠近的左端点)。最后把得到的 个区间按长度排序,与数组 对应项相乘并求和即可。
AC 代码如下,时间复杂度为 :
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e5 + 10;
int a[N], b[N], c[N], p[N];
int stk[N];
void solve() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
for (int i = 0; i < n; i++) {
scanf("%d", b + i);
}
for (int i = 0; i < n; i++) {
scanf("%d", c + i);
}
sort(a, a + n);
sort(b, b + n);
sort(c, c + n);
for (int i = 0, j = 0, k = 0, tp = 0; k < n; ) {
if (i < n && a[i] < b[j]) stk[++tp] = a[i++];
else p[k++] = b[j++] - stk[tp--];
}
sort(p, p + n, greater<int>());
LL ret = 0;
for (int i = 0; i < n; i++) {
ret += 1ll * p[i] * c[i];
}
printf("%lld\n", ret);
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}
参考资料
Editorial of Codeforces Round 917 (Div. 2):https://codeforces.com/blog/entry/123721
Codeforces Pinely Round 3 讲解(ABCDF1):https://www.bilibili.com/BV1iG411k7vX
本文来自博客园,作者:onlyblues,转载请注明原文链接:https://www.cnblogs.com/onlyblues/p/17931232.html
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 单线程的Redis速度为什么快?
· 展开说说关于C#中ORM框架的用法!
· Pantheons:用 TypeScript 打造主流大模型对话的一站式集成库
· SQL Server 2025 AI相关能力初探
· 为什么 退出登录 或 修改密码 无法使 token 失效