Codeforces 1311 F. Moving Points （树状数组+离散化）

最新推荐文章于 2020-06-12 23:38:46 发布

邵光亮

最新推荐文章于 2020-06-12 23:38:46 发布

阅读量10w+

点赞数

分类专栏：数据结构——树状数组

本文链接：https://blog.csdn.net/qq_43627087/article/details/104494396

版权

数据结构——树状数组专栏收录该内容

11 篇文章 1 订阅

订阅专栏

Description：

There are $n$ points on a coordinate axis OX. The $i - t h$ point is located at the integer point $x i$ and has a speed $v i$ . It is guaranteed that no two points occupy the same coordinate. All n points move with the constant speed, the coordinate of the $i - t h$ point at the moment $t$ (t can be non-integer) is calculated as $x i + t \cdot v i$ .

Consider two points $i$ and $j$ . Let $d (i, j)$ be the minimum possible distance between these two points over any possible moments of time (even non-integer). It means that if two points i and j coincide at some moment, the value $d (i, j)$ will be 0.

Your task is to calculate the value $\sum_{1≤i<j≤n}d(i,j)$ (the sum of minimum distances over all pairs of points).

Input

The first line of the input contains one integer $n (2≤n≤2⋅10^5)$ — the number of points.

The second line of the input contains $n$ integers $x_1,x_2,…,x_n (1≤x_i≤10^8)$ , where xi is the initial coordinate of the i-th point. It is guaranteed that all xi are distinct.

The third line of the input contains $n$ integers $v_1,v_2,…,v_n (−10^8≤vi≤10^8)$ , where $v_i$ is the speed of the $i - t h$ point.

Output

Print one integer — the value $\sum_{1≤i<j≤n}d(i,j)$ (the sum of minimum distances over all pairs of points).

Examples

input

3
1 3 2
-100 2 3

output

input

5
2 1 4 3 5
2 2 2 3 4

output

input

2
2 1
-3 0

output

解题思路：

给出 $n$ 个点和他们的初始位置 $x$ 和移动速度 $v$ ，问所有点对在任意时刻全部最小值的和是多少，不是同一时刻而是每个点对的最小值的和，可以是很多时刻。

时间可以是任意实数，对于任意两点，如果 $x_i<=x_j$ ,且 $x_i<=v_j$ ，那么 $i ， j$ 永远不可能相遇。否则肯定可以相遇，所以只需要计算 $x_i<=x_j$ ,且 $x_i<=v_j$ 的情况即可。这种情况贡献就是距离，树状数组维护一个和就好了。

AC代码：

const int N = 2e5 + 10;
ll c[N][2], b[N], ans, len; //二维数组0维护有几个比他小的，1计算前缀和
int n;

struct node
{
    int x;
    int v;
} a[N];

bool cmp(node a, node b)
{
    return a.x < b.x;
}

void add(int x, int val)
{
    while (x <= n)
        c[x][0]++, c[x][1] += val, x += lowbit(x);
}

ll ask(int x, int k)
{
    ll res = 0;
    while (x)
        res += c[x][k], x -= lowbit(x);
    return res;
}

int main()
{
    sd(n);
    ans = 0, len = 0;
    rep(i, 1, n)
        sd(a[i].x);
    rep(i, 1, n)
    {
        sd(a[i].v);
        b[i] = a[i].v;
    }
    sort(a + 1, a + 1 + n, cmp);
    sort(b + 1, b + 1 + n);
    len = unique(b + 1, b + 1 + n) - b - 1; //不重复元素个数
    rep(i, 1, n)
    {
        int now = lower_bound(b + 1, b + 1 + len, a[i].v) - b; //找到位置比a[i]远并且速度还比a[i]大的，计算贡献
        ans += a[i].x * ask(now, 0) - ask(now, 1);
        //ask(now, 0)询问得到的是位置比x小速度还小的有几个，
        //ask(now, 1)询问得到的是位置比x小速度还小的前缀和，
        add(now, a[i].x);        
    }
    pld(ans);
    return 0;
}