711D

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 1 to 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.

tarjan裸题

tarjan还是不太懂。。。

#include<stack>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <cstdio>
#include <string>
#include <vector>
#include <math.h>
#include <time.h>
#include <utility>
#include <cstdlib>
#include <sstream>
#include <cstring>
#include <stdio.h>
#include <iomanip>
#include <iostream>
#include <algorithm>
using namespace std;
const int inf=1e9+7,SIZE=200010;
long long n,stamp,ans=1,sum,j;
int used[SIZE],dfn[SIZE],low[SIZE];
stack<int>s;
vector<int>graph[SIZE];
void tarjan(int u)
{
dfn[u]=low[u]=++stamp;
used[u]=1;
s.push(u);
for(int i=0;i<graph[u].size();i++)
{
int v=graph[u][i];
if(used[v]==0)
{
tarjan(v);
low[u]=min(low[u],low[v]);
}
else if(used[v]==1)
{
low[u]=min(low[u],low[v]);
}
}
if(low[u]==dfn[u])
{
int temp=0;
while(s.top()!=u)
{
used[s.top()]=-1;
s.pop();
temp++;
}
used[s.top()]=-1;
s.pop();
temp++;
if(temp>1)
{
int num=1;
for(int i=1;i<=temp;i++)
{
num*=2;
num%=inf;
}
num=(num+inf-2)%inf;
ans*=num%inf;
ans%=inf;
}
else if(temp==1)
{
ans*=2;
ans%=inf;
}
}
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
scanf("%d",&j);
graph[i].push_back(j);
}
for(int i=1;i<=n;i++)
{
if(!used[i])
{
tarjan(i);
}
}
cout<<ans<<endl;
return 0;
}

• 本文已收录于以下专栏：

Codeforces 711D Directed Roads（所有点出度为1的图反向边去环）

D. Directed Roads time limit per test 2 seconds memory limit per test 256 megabytes input...
• Yasola
• 2016年08月30日 12:53
• 677

codeforces 711D. Directed Roads 找环

D. Directed Roads time limit per test 2 seconds memory limit per test 256 megabytes input standar...
• FTQOOO
• 2016年08月31日 21:09
• 569

CF - 711D 搜索环

• Bahuia
• 2016年11月03日 21:59
• 227

Codeforces 711D Directed Roads

ZS the Coder and Chris the Baboon has explored Udayland for quite some time. They realize that it co...
• nare123
• 2016年09月06日 22:25
• 182

codeforces 711D Directed Roads（DFS）

• West___wind
• 2016年09月03日 11:23
• 167

codeforces 711D Directed Roads

• kevin66654
• 2016年09月16日 14:15
• 161

codeforces 711D Directed Roads dfs

• acblacktea
• 2016年09月06日 12:46
• 172

【图论】Codeforces 711D Directed Roads

• u010568270
• 2016年08月30日 15:01
• 326

Codeforces 711D dfs找环

• hjt_fathomless
• 2016年09月01日 09:38
• 216

【34.40%】【codeforces 711D】Directed Roads

time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandar...
• harlow_cheng
• 2016年10月09日 17:13
• 246

举报原因： 您举报文章：711D 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)