递增三元组

给定三个整数数组A=[A1,A2,…AN]A=[A1,A2,…AN]

,
B=[B1,B2,…BN]B=[B1,B2,…BN]

,
C=[C1,C2,…CN]C=[C1,C2,…CN]

,请你统计有多少个三元组 (i,j,k)(i,j,k)

满足：1≤i,j,k≤N1≤i,j,k≤N

Ai<Bj<CkAi<Bj<Ck

输入格式第一行包含一个整数 NN

。第二行包含 NN

个整数 A1,A2,…ANA1,A2,…AN

。第三行包含 NN

个整数 B1,B2,…BNB1,B2,…BN

。第四行包含 NN

个整数 C1,C2,…CNC1,C2,…CN

。输出格式一个整数表示答案。数据范围1≤N≤1051≤N≤105

,
0≤Ai,Bi,Ci≤1050≤Ai,Bi,Ci≤105

输入样例：3
1 1 1
2 2 2
3 3 3
输出样例：27

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10;
typedef  long long LL;
int a[N], b[N], c[N];
int as[N];
int cs[N];
int cnt[N], s[N];
int main(){
 int n;
 scanf("%d", &n);
        for (int i = 1; i <= n; i ++)   scanf("%d", &a[i]), a[i] ++;
    for (int i = 1; i <= n; i ++)   scanf("%d", &b[i]), b[i] ++;
    for (int i = 1; i <= n; i ++)   scanf("%d", &c[i]), c[i] ++;
         for (int i = 1; i <= n; i ++)    cnt[a[i]] ++;
    for (int i = 1; i <= N; i ++)    s[i] = s[i - 1] + cnt[i];
    for (int i = 1; i <= n; i ++)    as[i] = s[b[i] - 1];
        memset(cnt, 0, sizeof cnt);
    memset(s, 0, sizeof s);
        for (int i = 1; i <= n; i ++)   cnt[c[i]] ++;
    for (int i = 1; i <= N; i ++)   s[i] = s[i - 1] + cnt[i];
    for (int i = 1; i <= n; i ++)   cs[i] = s[N - 1] - s[b[i]];
        LL ans = 0;
    for (int i = 1; i <= n; i ++)    ans += (LL)as[i] * cs[i];
  cout << ans << endl;
  return 0;   
}