这篇博客介绍了Snuke Festival的问题，包括题目描述、输入输出格式、样例及解决方案。Ringo需要构建满足特定条件的祭坛，通过排序和二分查找的方法来确定不同祭坛的数量。博客中强调了STL在解决此问题中的作用，并分享了作者获得个人训练赛第一的喜悦。
Snuke Festival
时间限制: 1 Sec 内存限制: 128 MB
题目描述
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≤1
最低0.47元/天 解锁文章
348
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
