A14398 | XOR and Distance
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an array $a$ consisting of $n$ distinct elements and an integer $k$ . Each element in the array is a non-negative integer not exceeding $2^k-1$ .
Let's define the XOR distance for a number $x$ as the value of
$$$$f(x) = \min\limits_{i = 1}^{n} \min\limits_{j = i + 1}^{n} |(a_i \oplus x) - (a_j \oplus x)|, $$ </p><p>where $\\oplus$ denotes <a href="https://en.wikipedia.org/wiki/Bitwise_operation#XOR">the bitwise XOR operation</a>.</p><p>For every integer $x$ from $0$ to $2^k-1$ , you have to calculate $f(x)$$$.
Let's define the XOR distance for a number $x$ as the value of
$$$$f(x) = \min\limits_{i = 1}^{n} \min\limits_{j = i + 1}^{n} |(a_i \oplus x) - (a_j \oplus x)|, $$ </p><p>where $\\oplus$ denotes <a href="https://en.wikipedia.org/wiki/Bitwise_operation#XOR">the bitwise XOR operation</a>.</p><p>For every integer $x$ from $0$ to $2^k-1$ , you have to calculate $f(x)$$$.
输入格式
The first line contains two integers $n$ and $k$ ( $1 \le k \le 19$ ; $2 \le n \le 2^k$ ).
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $0 \le a_i \le 2^k-1$ ). All these integers are distinct.
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $0 \le a_i \le 2^k-1$ ). All these integers are distinct.
输出格式
Print $2^k$ integers. The $i$ -th of them should be equal to $f(i-1)$ .
输入输出样例
输入 #1
3 3 6 0 3
输出 #1
3 1 1 2 2 1 1 3
输入 #2
3 4 13 4 2
输出 #2
2 2 6 6 3 1 2 2 2 2 1 3 6 6 2 2
Consider the first example:
- for $x = 0$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[6, 0, 3]$ , and the minimum absolute difference of two elements is $3$ ;
- for $x = 1$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[7, 1, 2]$ , and the minimum absolute difference of two elements is $1$ ;
- for $x = 2$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[4, 2, 1]$ , and the minimum absolute difference of two elements is $1$ ;
- for $x = 3$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[5, 3, 0]$ , and the minimum absolute difference of two elements is $2$ ;
- for $x = 4$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[2, 4, 7]$ , and the minimum absolute difference of two elements is $2$ ;
- for $x = 5$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[3, 5, 6]$ , and the minimum absolute difference of two elements is $1$ ;
- for $x = 6$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[0, 6, 5]$ , and the minimum absolute difference of two elements is $1$ ;
- for $x = 7$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[1, 7, 4]$ , and the minimum absolute difference of two elements is $3$ .
- for $x = 0$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[6, 0, 3]$ , and the minimum absolute difference of two elements is $3$ ;
- for $x = 1$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[7, 1, 2]$ , and the minimum absolute difference of two elements is $1$ ;
- for $x = 2$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[4, 2, 1]$ , and the minimum absolute difference of two elements is $1$ ;
- for $x = 3$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[5, 3, 0]$ , and the minimum absolute difference of two elements is $2$ ;
- for $x = 4$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[2, 4, 7]$ , and the minimum absolute difference of two elements is $2$ ;
- for $x = 5$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[3, 5, 6]$ , and the minimum absolute difference of two elements is $1$ ;
- for $x = 6$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[0, 6, 5]$ , and the minimum absolute difference of two elements is $1$ ;
- for $x = 7$ , if we apply bitwise XOR to the elements of the array with $x$ , we get the array $[1, 7, 4]$ , and the minimum absolute difference of two elements is $3$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted