A11418 | Gluttony
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an array $a$ with $n$ distinct integers. Construct an array $b$ by permuting $a$ such that for every non-empty subset of indices $S={x_{1},x_{2},...,x_{k}}$ ( $1<=x_{i}<=n$ , $0<k<n$ ) the sums of elements on that positions in $a$ and $b$ are different, i. e.
输入格式
The first line contains one integer $n$ ( $1<=n<=22$ ) — the size of the array.
The second line contains $n$ space-separated distinct integers $a_{1},a_{2},...,a_{n}$ ( $0<=a_{i}<=10^{9}$ ) — the elements of the array.
The second line contains $n$ space-separated distinct integers $a_{1},a_{2},...,a_{n}$ ( $0<=a_{i}<=10^{9}$ ) — the elements of the array.
输出格式
If there is no such array $b$ , print -1.
Otherwise in the only line print $n$ space-separated integers $b_{1},b_{2},...,b_{n}$ . Note that $b$ must be a permutation of $a$ .
If there are multiple answers, print any of them.
Otherwise in the only line print $n$ space-separated integers $b_{1},b_{2},...,b_{n}$ . Note that $b$ must be a permutation of $a$ .
If there are multiple answers, print any of them.
输入输出样例
输入 #1
2 1 2
输出 #1
2 1
输入 #2
4 1000 100 10 1
输出 #2
100 1 1000 10
An array $x$ is a permutation of $y$ , if we can shuffle elements of $y$ such that it will coincide with $x$ .
Note that the empty subset and the subset containing all indices are not counted.
Note that the empty subset and the subset containing all indices are not counted.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted