A13935 | Divide and Sum
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an array $a$ of length $2n$ . Consider a partition of array $a$ into two subsequences $p$ and $q$ of length $n$ each (each element of array $a$ should be in exactly one subsequence: either in $p$ or in $q$ ).
Let's sort $p$ in non-decreasing order, and $q$ in non-increasing order, we can denote the sorted versions by $x$ and $y$ , respectively. Then the cost of a partition is defined as $f(p, q) = \sum_{i = 1}^n |x_i - y_i|$ .
Find the sum of $f(p, q)$ over all correct partitions of array $a$ . Since the answer might be too big, print its remainder modulo $998244353$ .
Let's sort $p$ in non-decreasing order, and $q$ in non-increasing order, we can denote the sorted versions by $x$ and $y$ , respectively. Then the cost of a partition is defined as $f(p, q) = \sum_{i = 1}^n |x_i - y_i|$ .
Find the sum of $f(p, q)$ over all correct partitions of array $a$ . Since the answer might be too big, print its remainder modulo $998244353$ .
输入格式
The first line contains a single integer $n$ ( $1 \leq n \leq 150\,000$ ).
The second line contains $2n$ integers $a_1, a_2, \ldots, a_{2n}$ ( $1 \leq a_i \leq 10^9$ ) — elements of array $a$ .
The second line contains $2n$ integers $a_1, a_2, \ldots, a_{2n}$ ( $1 \leq a_i \leq 10^9$ ) — elements of array $a$ .
输出格式
Print one integer — the answer to the problem, modulo $998244353$ .
输入输出样例
输入 #1
1 1 4
输出 #1
6
输入 #2
2 2 1 2 1
输出 #2
12
输入 #3
3 2 2 2 2 2 2
输出 #3
0
输入 #4
5 13 8 35 94 9284 34 54 69 123 846
输出 #4
2588544
Two partitions of an array are considered different if the sets of indices of elements included in the subsequence $p$ are different.
In the first example, there are two correct partitions of the array $a$ :
1. $p = [1]$ , $q = [4]$ , then $x = [1]$ , $y = [4]$ , $f(p, q) = |1 - 4| = 3$ ;
2. $p = [4]$ , $q = [1]$ , then $x = [4]$ , $y = [1]$ , $f(p, q) = |4 - 1| = 3$ .
In the second example, there are six valid partitions of the array $a$ :
1. $p = [2, 1]$ , $q = [2, 1]$ (elements with indices $1$ and $2$ in the original array are selected in the subsequence $p$ );
2. $p = [2, 2]$ , $q = [1, 1]$ ;
3. $p = [2, 1]$ , $q = [1, 2]$ (elements with indices $1$ and $4$ are selected in the subsequence $p$ );
4. $p = [1, 2]$ , $q = [2, 1]$ ;
5. $p = [1, 1]$ , $q = [2, 2]$ ;
6. $p = [2, 1]$ , $q = [2, 1]$ (elements with indices $3$ and $4$ are selected in the subsequence $p$ ).
In the first example, there are two correct partitions of the array $a$ :
1. $p = [1]$ , $q = [4]$ , then $x = [1]$ , $y = [4]$ , $f(p, q) = |1 - 4| = 3$ ;
2. $p = [4]$ , $q = [1]$ , then $x = [4]$ , $y = [1]$ , $f(p, q) = |4 - 1| = 3$ .
In the second example, there are six valid partitions of the array $a$ :
1. $p = [2, 1]$ , $q = [2, 1]$ (elements with indices $1$ and $2$ in the original array are selected in the subsequence $p$ );
2. $p = [2, 2]$ , $q = [1, 1]$ ;
3. $p = [2, 1]$ , $q = [1, 2]$ (elements with indices $1$ and $4$ are selected in the subsequence $p$ );
4. $p = [1, 2]$ , $q = [2, 1]$ ;
5. $p = [1, 1]$ , $q = [2, 2]$ ;
6. $p = [2, 1]$ , $q = [2, 1]$ (elements with indices $3$ and $4$ are selected in the subsequence $p$ ).
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted