Atcoder arc 084 C - Snuke Festival（前缀和+二分）

77 阅读 0 评论 51 点赞

我是靠谱客的博主受伤季节，最近开发中收集的这篇文章主要介绍Atcoder arc 084 C - Snuke Festival（前缀和+二分），觉得挺不错的，现在分享给大家，希望可以做个参考。

概述

题目链接：http://arc084.contest.atcoder.jp/tasks/arc084_a

C - Snuke Festival

Time limit : 2sec / Memory limit : 256MB

Score : 300 points

Problem Statement

The season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.

He has N parts for each of the three categories. The size of the i-th upper part is Ai, the size of the i-th middle part is Bi, and the size of the i-th lower part is Ci.

To build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.

How many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.

Constraints

1≤N≤105
1≤Ai≤109(1≤i≤N)
1≤Bi≤109(1≤i≤N)
1≤Ci≤109(1≤i≤N)
All input values are integers.

Input

Input is given from Standard Input in the following format:

N
A1 … AN
B1 … BN
C1 … CN

Output

Print the number of different altars that Ringo can build.

Sample Input 1

Copy

Sample Output 1

Copy

The following three altars can be built:

Upper: 1-st part, Middle: 1-st part, Lower: 1-st part
Upper: 1-st part, Middle: 1-st part, Lower: 2-nd part
Upper: 1-st part, Middle: 2-nd part, Lower: 2-nd part

Sample Input 2

Copy

Sample Output 2

Copy

Sample Input 3

Copy

6
3 14 159 2 6 53
58 9 79 323 84 6
2643 383 2 79 50 288

Sample Output 3

Copy

解析：这个题显然不能用O(n^2)或者O(n^3)，只能O(n*log(n))，这里就想到了前缀和

代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
 
const int N = 100009;
 
int a[N], b[N], c[N];
LL f[N];
 
 
int main()
{
    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);
    LL ans = 0;
 
    for(int i = 0; i < n; i++)
    {
        if(b[i] >= c[n-1]) break;
        f[i+1] = 1ll*n - (upper_bound(c, c+n, b[i]) - c);
    }
    f[0] = 0;
    for(int i = 1; i <= n; i++) f[i] += f[i-1];
 
    for(int i = 0; i < n; i++)
    {
        if(a[i] >= b[n-1]) break;
        int s = upper_bound(b, b+n, a[i]) - b;
        ans += f[n] - f[s];
    }
 
    printf("%lldn", ans);
    return 0;
 
 
 
}