{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"题目描述","value":{"format":"HTML","content":"构建一个m层的满n叉树,所有的边都有权值。\u003cp\u003e\n每条边的权值从k个数里面选,每个数只能被选一次\u003cp\u003e\n0是根节点。di表示根节点到i点的距离,我们的目标是使得每个点到根节点的和最小。\u003cp\u003e\n答案可能很大,请输出取模p后的答案\u003cp\u003e"}},{"title":"输入","value":{"format":"HTML","content":"输入包含两行\u003cp\u003e\n第一行四个数,k,m,n,p (2\u003c\u003dk\u003c\u003d2e5 , 2\u003c\u003dp\u003c\u003d1e15)\u003cp\u003e\n第二行包含k个数,保证k大于等于边数m,k个数每个数字保证小于等于1e15\u003cp\u003e"}},{"title":"输出","value":{"format":"HTML","content":"答案包含一个数字表示所有点到根节点的距离之和。"}},{"title":"样例输入","value":{"format":"HTML","content":"\u003cpre\u003e5 2 3 10\n1 2 3 4 5\u003c/pre\u003e"}},{"title":"样例输出","value":{"format":"HTML","content":"\u003cpre\u003e6\u003c/pre\u003e"}}]}