HackerRank/direct_connections.cpp at master · fedeoliv/HackerRank · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
// https://www.hackerrank.com/challenges/direct-connections

#include <iostream>
#include <algorithm>

using namespace std;

typedef long long LL;
const int MAX = 200005;
const LL MODULO = 1000000007;

struct SegTree {
    LL sum[MAX << 2];
    int lson(int rt) {return rt << 1;}
    int rson(int rt) {return rt << 1 | 1;}

    void pushup(int rt) {
        sum[rt] = sum[lson(rt)] + sum[rson(rt)];
    }

    void build(int l, int r, int rt) {
        sum[rt] = 0;
        if (l == r) return;
        int mid = (l + r) >> 1;

        build(l, mid, lson(rt));
        build(mid + 1, r, rson(rt));
    }

    void update(int pos, LL c, int l, int r, int rt) {
        if (l == r) {
            sum[rt] += c;
            return;
        }

        int mid = (l + r) >> 1;

        if (pos <= mid) update(pos, c, l, mid, lson(rt));
        else update(pos, c, mid + 1, r, rson(rt));

        pushup(rt);
    }

    LL query(int from, int to, int l, int r, int rt) {
        if (from <= l && r <= to)
                return sum[rt];

        int mid = (l + r) >> 1;
        LL res = 0;

        if (from <= mid) res += query(from, to, l, mid, lson(rt));
        if (to > mid) res += query(from, to, mid + 1, r, rson(rt));

        return res;
    }
} tree, tr;

struct City {
    int x, p, idx;

    bool operator < (const City &pt) const {
        return p < pt.p;
    }
} city[MAX];

bool cmp(const City &a, const City &b) {
    return a.x < b.x;
}

int n;

int main() {
    int test;

    cin >> test;

    while (test--) {
        cin >> n;

        for (int i = 0; i < n; i++)
            cin >> city[i].x;

        for (int i = 0; i < n; i++)
            cin >> city[i].p;

        sort(city, city + n, cmp);

        for (int i = 0; i < n; i++)
            city[i].idx = i + 1;

        tree.build(1, n, 1);
        tr.build(1, n, 1);

        sort(city, city + n);

        LL res = 0;

        for (int i = 0; i < n; i++) {
            LL suml = tree.query(1, city[i].idx, 1, n, 1);
            LL sumr = tree.query(city[i].idx, n, 1, n, 1);
            LL numl = tr.query(1, city[i].idx, 1, n, 1);
            LL numr = tr.query(city[i].idx, n, 1, n, 1);

            res += ((numl * city[i].x - suml) + (sumr - numr * city[i].x)) * city[i].p;
            res %= MODULO;

            tree.update(city[i].idx, city[i].x, 1, n, 1);
            tr.update(city[i].idx, 1, 1, n, 1);
        }

        cout << res << endl;
    }

    return 0;
}