A16084 | Swaps
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an array of integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le n$ ). You can perform the following operation several (possibly, zero) times:
- pick an arbitrary $i$ and perform swap $(a_i, a_{a_i})$ .
How many distinct arrays is it possible to attain? Output the answer modulo $(10^9 + 7)$ .
- pick an arbitrary $i$ and perform swap $(a_i, a_{a_i})$ .
How many distinct arrays is it possible to attain? Output the answer modulo $(10^9 + 7)$ .
输入格式
The first line contains an integer $n$ ( $1 \le n \le 10^6$ ).
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1\le a_i\le n$ ).
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1\le a_i\le n$ ).
输出格式
Output the number of attainable arrays modulo $(10^9 + 7)$ .
输入输出样例
输入 #1
3 1 1 2
输出 #1
2
输入 #2
4 2 1 4 3
输出 #2
4
输入 #3
6 2 3 1 1 1 2
输出 #3
18
In the first example, the initial array is $[1, 1, 2]$ . If we perform the operation with $i = 3$ , we swap $a_3$ and $a_2$ , obtaining $[1, 2, 1]$ . One can show that there are no other attainable arrays.
In the second example, the four attainable arrays are $[2, 1, 4, 3]$ , $[1, 2, 4, 3]$ , $[1, 2, 3, 4]$ , $[2, 1, 3, 4]$ . One can show that there are no other attainable arrays.
In the second example, the four attainable arrays are $[2, 1, 4, 3]$ , $[1, 2, 4, 3]$ , $[1, 2, 3, 4]$ , $[2, 1, 3, 4]$ . One can show that there are no other attainable arrays.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted