当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

6533:Build Tree

题目描述
You need to construct a full $n$-ary tree(n叉树) with $m$ layers.All the edges in this tree have a weight.But this weight cannot be chosen arbitrarily you can only choose from set $S$,the size of $S$ is $k$,each element in the set can only be used once.Node 0 is the root of tree.

We use $d(i)$ for the distance from root to node $i$.Our goal is to minimize the following expression:
$$
\min \sum_{i=0}^N{d(i)}
$$


Please find the minimum value of this expression and output it.Because it may be a big number,you should output the answer modul $p$.
输入解释
The input file contains 2 lines.

The first line contains 4 integers,these respectively is $k$,$m$,$n$,$p$。(2 $\leq$ $k$ $\leq $200000,2 $ \leq $ $p$$ \leq $ $10^{15}$)

The second line contains $k$ integers,represent the set $S$,the elements in the set guarantee less than or equal to $10^{15}$.

We guarantee that $k$ is greater than or equal to the number of edges.
输出解释
The output file contains an integer.represent the answer.
输入样例
5 2 3 10
1 2 3 4 5
输出样例
6
来自杭电HDUOJ的附加信息
Recommend liuyiding

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-6533

最后修改于 2020-10-25T23:32:05+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
3000/1500MS(Java/Others) 65536/65536K(Java/Others)