Build Tree

Home STD Contest Notification Clarification Problems Ranklist Status Statistics Print

Build Tree

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

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

 

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll read() {
  ll x = 0;
  ll ch = getchar();
  while (ch < '0' || ch > '9') {
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + (ll)(ch - '0');
    ch = getchar();
  }
  return x;
}
void out(ll a) {
  if (a < 0) {
    putchar('-');
    a = -a;
  }
  if (a >= 10) {
    out(a / 10);
  }
  putchar(a % 10 + '0');
}
ll a[200010], num[2000], sum[200010], tot[2000];
int main() {
  ll n, m, k;
  ll p;
  while(~scanf("%lld%lld%lld%lld", &k, &m, &n, &p)) {//n叉m层
    ll cnt = 0, t = 1, ans = 0;
    sum[0] = 0;
    for (ll i = 1; i <= k; i++) {
      a[i] = read();
    }
    num[1] = 0;
    tot[2] = 1;
    for (ll i = 2; i <= m; i++) {
      t *= n;
      cnt += t;
      num[i] = num[i-1] + t;//num[i] 第i层有num[i]条边 
      tot[i+1] = tot[i] + t;//倒 每层边需要使用多少次 
    }
    sort(a+1, a+k+1);
    for (ll i = 1; i <= cnt; i++) {
      sum[i] = (sum[i-1] + a[i]) % p;
    }
    for (ll i = 2; i <= m; i++) {
      ans = (ans + (((sum[num[i]] - sum[num[i-1]] + p) % p) * tot[m-i+2]) % p) % p;
    }
    out(ans);
    putchar('\n');
  }
  return 0;
}