UPC 6615: Snuke Festival

6615: Snuke Festival

题目描述

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 is given from Standard Input in the following format:
N
A1 … AN
B1 … BN
C1 … CN

输出

Print the number of different altars that Ringo can build.

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;int b[100005];
int a[100005];
int c[100005];int main()
{int n;while(~scanf("%d",&n)){long long sum=0;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);int x=0,y=0,numa=0,numc=n;for(int i=0;i<n;i++){while(b[i]>a[x]&&x<n){x++;numa++;}while(b[i]>=c[y]&&y<n){y++;numc--;}sum+=(long long)numa*numc;}printf("%lld\n",sum);}return 0;
}

UPC 6615: Snuke Festival相关推荐

Snuke Festival（二分法）
题目描述 The season for Snuke Festival has come again this year. First of all, Ringo will perform a ritu ...
搜索 —— 暴力搜索
[暴力搜索] 暴力搜索,就是将所有情况都举出,并判断其是否符合题目条件.其基本方法是分析题意后,找到一个合适的维度列举每一个元素,以完成题目. 一般主流的 OJ 中,1000ms 的时间限制下可以运行 ...
UPC第38，39，40场部分题解
UPC第38,39,40场部分题解第38场 A. Bovine Alliance Description Bessie and her bovine pals from nearby farms h ...
CODE FESTIVAL 2017 qual B
昨晚因为有点事就去忙了,没打后悔啊 A - XXFESTIVAL Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem ...
BZOJ 2788[Poi2012]Festival
题面: 2788: [Poi2012]Festival Time Limit: 30 Sec Memory Limit: 64 MB Submit: 418 Solved: 190 [Submit ...
UPC个人训练赛第十五场（AtCoder Grand Contest 031）
传送门: [1]:AtCoder [2]:UPC比赛场 [3]:UPC补题场参考资料 [1]:https://www.cnblogs.com/QLU-ACM/p/11191644.html B.Re ...
CodeForces - 1509C The Sports Festival(dp)
题目链接:点击查看题目大意:给出一个长度为 nnn 的数列,现在需要对其进行重排列,使得贡献之和最小对于一个排列的贡献来说,对于每个 iii ,则 di=max(a1,a2,...,ai)−min ...
G. GCD Festival（莫比乌斯、欧拉函数）
G. GCD Festival ∑i=1n∑j=1ngcd⁡(ai,aj)gcd⁡(i,j)∑d=1nd∑i=1nd∑j=1ndgcd⁡(aid,ajd)[gcd⁡(i,j)=1]∑d=1nd∑k=1 ...
ARC068C - Snuke Line
ARC068C - Snuke Line Description 其实就是给出nnn个区间[li,ri][l_i,r_i][li,ri]对于每一个i∈[1,M]i\in[1,M]i∈[1,M],求 ...
C. The Sports Festival
C. The Sports Festival 题意: n个数,依次将所有数加入到区间内,每次得到一个k,k等于当前区间的最大值减最小值, 求所有k的和的最小值题解: 一开始就没往dp那方面想,自己在 ...

UPC 6615: Snuke Festival

UPC 6615: Snuke Festival相关推荐

最新文章

热门文章