A15118 | Permutation Weight (Easy Version)
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
This is an easy version of the problem. The difference between the easy and hard versions is that in this version, you can output any permutation with the smallest weight.
You are given a permutation $p_1, p_2, \ldots, p_n$ of integers from $1$ to $n$ .
Let's define the weight of the permutation $q_1, q_2, \ldots, q_n$ of integers from $1$ to $n$ as $$$$|q_1 - p_{q_{2}}| + |q_2 - p_{q_{3}}| + \ldots + |q_{n-1} - p_{q_{n}}| + |q_n - p_{q_{1}}| $$ </p><p>You want your permutation to be as lightweight as possible. Find any permutation $q$$$ with the smallest possible weight.
You are given a permutation $p_1, p_2, \ldots, p_n$ of integers from $1$ to $n$ .
Let's define the weight of the permutation $q_1, q_2, \ldots, q_n$ of integers from $1$ to $n$ as $$$$|q_1 - p_{q_{2}}| + |q_2 - p_{q_{3}}| + \ldots + |q_{n-1} - p_{q_{n}}| + |q_n - p_{q_{1}}| $$ </p><p>You want your permutation to be as lightweight as possible. Find any permutation $q$$$ with the smallest possible weight.
输入格式
The first line of the input contains a single integer $t$ ( $1 \le t \le 100$ ) — the number of test cases. The description of the test cases follows.
The first line of each test case contains a single integer $n$ ( $2 \le n \le 200$ ) — the size of the permutation.
The second line of each test case contains $n$ integers $p_1, p_2, \ldots, p_n$ ( $1 \le p_i \le n$ , all $p_i$ are distinct) — the elements of the permutation.
The sum of $n$ over all test cases doesn't exceed $400$ .
The first line of each test case contains a single integer $n$ ( $2 \le n \le 200$ ) — the size of the permutation.
The second line of each test case contains $n$ integers $p_1, p_2, \ldots, p_n$ ( $1 \le p_i \le n$ , all $p_i$ are distinct) — the elements of the permutation.
The sum of $n$ over all test cases doesn't exceed $400$ .
输出格式
For each test case, output $n$ integers $q_1, q_2, \ldots, q_n$ ( $1 \le q_i \le n$ , all $q_i$ are distinct) — one of the permutations with the smallest weight.
输入输出样例
输入 #1
3 2 2 1 4 2 3 1 4 5 5 4 3 2 1
输出 #1
1 2 1 3 4 2 1 4 2 3 5
In the first test case, there are two permutations of length $2$ : $(1, 2)$ and $(2, 1)$ . Permutation $(1, 2)$ has weight $|1 - p_2| + |2 - p_1| = 0$ , and permutation $(2, 1)$ has the same weight: $|2 - p_1| + |1 - p_2| = 0$ . You can output any of these permutations in this version.
In the second test case, the weight of the permutation $(1, 3, 4, 2)$ is $|1 - p_3| + |3 - p_4| + |4 - p_2| + |2 - p_1| = |1 - 1| + |3 - 4| + |4 - 3| + |2 - 2| = 2$ . There are no permutations with smaller weights.
In the third test case, the weight of the permutation $(1, 4, 2, 3, 5)$ is $|1 - p_4| + |4 - p_2| + |2 - p_3| + |3 - p_5| + |5 - p_1| = |1 - 2| + |4 - 4| + |2 - 3| + |3 - 1| + |5 - 5| = 4$ . There are no permutations with smaller weights.
In the second test case, the weight of the permutation $(1, 3, 4, 2)$ is $|1 - p_3| + |3 - p_4| + |4 - p_2| + |2 - p_1| = |1 - 1| + |3 - 4| + |4 - 3| + |2 - 2| = 2$ . There are no permutations with smaller weights.
In the third test case, the weight of the permutation $(1, 4, 2, 3, 5)$ is $|1 - p_4| + |4 - p_2| + |2 - p_3| + |3 - p_5| + |5 - p_1| = |1 - 2| + |4 - 4| + |2 - 3| + |3 - 1| + |5 - 5| = 4$ . There are no permutations with smaller weights.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted