HDU6533 Build Tree(2019JSCPC B题)

Build Tree

Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1292    Accepted Submission(s): 218

Problem Description

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∑i=0Nd(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

Input

The input file contains 2 lines.

The first line contains 4 integers,these respectively is k,m,n,p。(2 ≤ k ≤200000,2 ≤ p≤ 1015)

The second line contains k integers,represent the set S，the elements in the set guarantee less than or equal to 1015.

We guarantee that k is greater than or equal to the number of edges.

Output

The output file contains an integer.represent the answer.

Sample Input

5 2 3 10 1 2 3 4 5

Sample Output

6

Source

2019CCPC湖南全国邀请赛（广东省赛、江苏省赛）重现赛

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
#define LL long long
#define N 200005
LL a[N], s[N];
LL k, m, n, p;
int main()
{
    while(~scanf("%lld%lld%lld%lld",&k,&m,&n,&p)){
    	memset(s,0,sizeof(s));
	    for(int i=0;i<k;++i) scanf("%lld",&a[i]);
	    sort(a,a+k);
	    LL now=n, tot=0;
	    for(int i=2;i<=m;++i){
	        s[i]=(n*s[i-1])%p;
	        for(int j=0;j<now;++j){
	            s[i]=(s[i]+a[tot++])%p;
	        }
	        now*=n;
	    }
	    for(int i=2;i<=m;++i) s[0]=(s[0]+s[i])%p;
	    cout<<s[0]<<endl;
    }
    return 0;
}