CodeForces - 711D Directed Roads(找环）

题目链接：http://codeforces.com/problemset/problem/711/D点击打开链接

D. Directed Roads

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

ZS the Coder and Chris the Baboon has explored Udayland for quite some time. They realize that it consists of n towns numbered from 1to n.

There are n directed roads in the Udayland. i-th of them goes from town i to some other town ai (ai ≠ i). ZS the Coder can flip the direction of any road in Udayland, i.e. if it goes from town A to town B before the flip, it will go from town B to town A after.

ZS the Coder considers the roads in the Udayland confusing, if there is a sequence of distinct towns A1, A2, ..., Ak (k > 1) such that for every 1 ≤ i < k there is a road from town Ai to town Ai + 1 and another road from town Ak to town A1. In other words, the roads are confusing if some of them form a directed cycle of some towns.

Now ZS the Coder wonders how many sets of roads (there are 2n variants) in initial configuration can he choose to flip such that after flipping each road in the set exactly once, the resulting network will not be confusing.

Note that it is allowed that after the flipping there are more than one directed road from some town and possibly some towns with no roads leading out of it, or multiple roads between any pair of cities.

Input

The first line of the input contains single integer n (2 ≤ n ≤ 2·105) — the number of towns in Udayland.

The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ n, ai ≠ i), ai denotes a road going from town i to town ai.

Output

Print a single integer — the number of ways to flip some set of the roads so that the resulting whole set of all roads is not confusing. Since this number may be too large, print the answer modulo 109 + 7.

Examples

input

3
2 3 1

output

6

input

4
2 1 1 1

output

8

input

5
2 4 2 5 3

output

28

Note

Consider the first sample case. There are 3 towns and 3 roads. The towns are numbered from 1 to 3 and the roads are , ,  initially. Number the roads 1 to 3 in this order.

The sets of roads that ZS the Coder can flip (to make them not confusing) are {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}. Note that the empty set is invalid because if no roads are flipped, then towns 1, 2, 3 is form a directed cycle, so it is confusing. Similarly, flipping all roads is confusing too. Thus, there are a total of 6 possible sets ZS the Coder can flip.

The sample image shows all possible ways of orienting the roads from the first sample such that the network is not confusing.

给你一个n个点的有向图 然后再给你n条边 边可以转换方向 问存在多少种不构成环的组成方法

题目已经告诉你了只有n个点和n条边 所以不存在同一个点属于两个环的情况

我们找出所有的环 则每个x个点的环就具有2^x-2种不构成环的情况

其余的不够成环的点的集合可以构成2^x种情况

将每个环看成一个集合 不构成环的点也看做一个集合 算出他们各自的情况个数再相乘 便是结果

#include <bits/stdc++.h>
using namespace std;
set<int > s[222222];
int nnext[222222];
int book[222222];
int cycjudge[222222];
int mod=1000000007;
void cycle(int x,int cnt)
{
	if(cycjudge[x])
		return;
	cycjudge[x]=cnt;
	cycle(nnext[x],cnt);
}
long long int power(int num,int tot)
{
	long long int sum=1;
	for(int i=0;i<tot;i++)
	{
		sum*=num;
		sum%=mod;
	}
	return sum;
}
int main()
{
	for(int i=0;i<222222;i++)
	{	
		book[i]=0;
		cycjudge[i]=0;
	}
 	int n; 
 	cin >> n; 
 	for(int i=1;i<=n;i++)
 	{
 		int mid;
 		cin >> mid;
 		nnext[i]=mid;
 	}
 	int cnt=1;
 	for(int i=1;i<=n;i++)
 	{
 		if(!book[i])
 		{
 			int now=i;
 			while(book[now]==0)
 			{
 				book[now]=cnt;
 				now=nnext[now];
 			}
 			if(book[now]==cnt)
 			{

 				cycle(now,cnt);
 			}
 			cnt++;
 		}
  	}
  	for(int i=1;i<=n;i++)
  	{
  		s[cycjudge[i]].insert(i);
  	}
  	long long int sum=1;
  	for(int i=1;i<=n;i++)
  	{
  		if(s[i].size()!=0)
  		{
  			sum=sum*(power(2,s[i].size())-2)%mod;
  		}
  	}
  	sum=sum*(power(2,s[0].size()))%mod;
  	cout << sum << endl;
}