Educational Codeforces Round 164 D. Colored Balls

最新推荐文章于 2024-11-05 21:58:11 发布

Cythia-1

最新推荐文章于 2024-11-05 21:58:11 发布

阅读量853

点赞数 22

分类专栏： c++刷题记录文章标签：算法 c++ c语言数据结构 Codeforces

本文链接：https://blog.csdn.net/m0_69367351/article/details/139240379

版权

c++刷题记录专栏收录该内容

52 篇文章 0 订阅

订阅专栏

Colored Balls

time limit per test: 2 second memory limit per test: 1024 megabytes input: standard input output: standard output

There are balls of $n$ different colors; the number of balls of the $i$ -th color is $a_i$ .

The balls can be combined into groups. Each group should contain at most $2$ balls, and no more than $1$ ball of each color.

Consider all $2^n$ sets of colors. For a set of colors, let’s denote its value as the minimum number of groups the balls of those colors can be distributed into. For example, if there are three colors with $3$ , $1$ and $7$ balls respectively, they can be combined into $7$ groups (and not less than $7$ ), so the value of that set of colors is $7$ .

Your task is to calculate the sum of values over all $2^n$ possible sets of colors. Since the answer may be too large, print it modulo $998\,244\,353$ .

Input

The first line contains a single integer $n$ ( $\le n \le 5000$ ) — the number of colors.

The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $\le a_i \le 5000$ ) — the number of balls of the $i$ -th color.

Additional constraint on input: the total number of balls doesn’t exceed $5000$ .

Output

Print a single integer — the sum of values of all $2^n$ sets of colors, taken modulo $998\,244\,353$ .

Example

$\tt input$
3 1 1 2
$\tt output$
11

$\tt input$
1 5
$\tt output$
5

$\tt input$
4 1 3 3 7
$\tt output$
76

Note

Consider the first example. There are $8$ sets of colors:

for the empty set, its value is $0$ ;
for the set ${1\}$ , its value is $1$ ;
for the set ${2\}$ , its value is $1$ ;
for the set ${3\}$ , its value is $2$ ;
for the set ${1,2\}$ , its value is $1$ ;
for the set ${1,3\}$ , its value is $2$ ;
for the set ${2,3\}$ , its value is $2$ ;
for the set ${1,2,3\}$ , its value is $2$ .

So, the sum of values over all $2^n$ sets of colors is $11$ .

Tutorial

设选中的球的总数为 $m$ ，其中数量最多的颜色的球有 $x$ 个，则会出现以下两种情况：

如果 $\leq m - x$ ，则至少分成 $\lceil {m \over 2} \rceil$ 组
如果 $x > m - x$ ，则至少分成 $x$ 组

所以我们只需要计算 $\sum (\max(\lceil {m \over 2} \rceil,x) \times 总和为\ m\ 的方案数)$ 即可

接下来可以用动态规划来解决这个问题，将数组从前往后遍历，在 $i$ 位置，当前球的个数 $a_i$ 就是当前数量最多的球的个数， $dp_j$ 表示在此之前，其他球个数总和为 $j$ 的方案数，则当前位置对答案的贡献就是 $\sum_{j = 0}^{cnt}(dp_j \times \max(\lceil {j \over 2} \rceil,x))$ ，其中 $\sum_{k = 0}^i a_k$ ，然后直接按照背包问题进行计算即可

此解法时间复杂度为 $\mathcal O(n ^ 2)$ ，即背包问题的时间复杂度

Solution

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define int long long
const int mod = 998244353;

signed main() {
    int n, cnt = 0, ans = 0;
    cin >> n;
    vector<int> a(n);
    for (int &ai : a) {
        cin >> ai;
    }
    ranges::sort(a);
    vector<int> dp(5001);
    dp[0] = 1;
    for (int ai : a) {
        for (int i = cnt; ~i; --i) {
            if (dp[i]) {
                ans = (ans + dp[i] * max((i + ai + 1) / 2, ai)) % mod;
                dp[i + ai] = (dp[i + ai] + dp[i]) % mod;
            }
        }
        cnt += ai;
    }
    cout << ans << endl;
    return 0;
}