A15493 | Absolute Maximization
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an array $a$ of length $n$ . You can perform the following operation several (possibly, zero) times:
- Choose $i$ , $j$ , $b$ : Swap the $b$ -th digit in the binary representation of $a_i$ and $a_j$ .
Find the maximum possible value of $\max(a) - \min(a)$ .
In a binary representation, bits are numbered from right (least significant) to left (most significant). Consider that there are an infinite number of leading zero bits at the beginning of any binary representation.
For example, swap the $0$ -th bit for $4=100_2$ and $3=11_2$ will result $101_2=5$ and $10_2=2$ . Swap the $2$ -nd bit for $4=100_2$ and $3=11_2$ will result $000_2=0_2=0$ and $111_2=7$ .
Here, $\max(a)$ denotes the maximum element of array $a$ and $\min(a)$ denotes the minimum element of array $a$ .
The binary representation of $x$ is $x$ written in base $2$ . For example, $9$ and $6$ written in base $2$ are $1001$ and $110$ , respectively.
- Choose $i$ , $j$ , $b$ : Swap the $b$ -th digit in the binary representation of $a_i$ and $a_j$ .
Find the maximum possible value of $\max(a) - \min(a)$ .
In a binary representation, bits are numbered from right (least significant) to left (most significant). Consider that there are an infinite number of leading zero bits at the beginning of any binary representation.
For example, swap the $0$ -th bit for $4=100_2$ and $3=11_2$ will result $101_2=5$ and $10_2=2$ . Swap the $2$ -nd bit for $4=100_2$ and $3=11_2$ will result $000_2=0_2=0$ and $111_2=7$ .
Here, $\max(a)$ denotes the maximum element of array $a$ and $\min(a)$ denotes the minimum element of array $a$ .
The binary representation of $x$ is $x$ written in base $2$ . For example, $9$ and $6$ written in base $2$ are $1001$ and $110$ , respectively.
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 128$ ) — the number of testcases.
The first line of each test case contains a single integer $n$ ( $3 \le n \le 512$ ) — the length of array $a$ .
The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $0 \le a_i < 1024$ ) — the elements of array $a$ .
It's guaranteed that the sum of $n$ over all testcases does not exceed $512$ .
The first line of each test case contains a single integer $n$ ( $3 \le n \le 512$ ) — the length of array $a$ .
The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $0 \le a_i < 1024$ ) — the elements of array $a$ .
It's guaranteed that the sum of $n$ over all testcases does not exceed $512$ .
输出格式
For each testcase, print one integer — the maximum possible value of $\max(a) - \min(a)$ .
输入输出样例
输入 #1
4 3 1 0 1 4 5 5 5 5 5 1 2 3 4 5 7 20 85 100 41 76 49 36
输出 #1
1 0 7 125
In the first example, it can be shown that we do not need to perform any operations — the maximum value of $\max(a) - \min(a)$ is $1 - 0 = 1$ .
In the second example, no operation can change the array — the maximum value of $\max(a) - \min(a)$ is $5 - 5 = 0$ .
In the third example, initially $a = [1, 2, 3, 4, 5]$ , we can perform one operation taking $i = 2$ , $j = 5$ , $b = 1$ . The array now becomes $a = [1, 0, 3, 4, 7]$ . It can be shown that any further operations do not lead to a better answer — therefore the answer is $\max(a) - \min(a) = 7 - 0 = 7$ .
In the second example, no operation can change the array — the maximum value of $\max(a) - \min(a)$ is $5 - 5 = 0$ .
In the third example, initially $a = [1, 2, 3, 4, 5]$ , we can perform one operation taking $i = 2$ , $j = 5$ , $b = 1$ . The array now becomes $a = [1, 0, 3, 4, 7]$ . It can be shown that any further operations do not lead to a better answer — therefore the answer is $\max(a) - \min(a) = 7 - 0 = 7$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted