2019CCPC湖南全国邀请赛（广东省赛、江苏省赛）B Build Tree

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 <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long ll;
const int maxn=200050;
ll a[maxn],res[maxn],sum[maxn];
ll MOD;
int k,n,m;

ll mult(ll a,ll b){
    ll c=0;
    while(b){
        if(b&1) c=(c+a)%MOD;
        b>>=1;a<<=1;a%=MOD;
    }
    return c;
}
void init(){
    res[1]=1;
    for(int i=2;i<=m;i++)   res[i]=res[i-1]*n;
    for(int i=1;i<=m;i++)   sum[i]=sum[i-1]+res[i];
}
void solve(){
    scanf("%d %d %d %lld",&k,&m,&n,&MOD);
    init();
    for(int i=1;i<=k;i++)   scanf("%lld",&a[i]);
    sort(a+1,a+k+1);
    ll ans=0,now=2;
    for(int i=2;i<=m;i++){
        while(now<=sum[i]){
            ans=(ans+mult(sum[m-i+1],a[now-1]))%MOD;
            now++;
        }
    }
    printf("%lld\n",ans);
}
int main(){
    solve();
    return 0;
}