Codeforces Round #369 (Div. 2) 711D Directed Roads (dfs)

原创 2016年08月30日 23:23:59

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.

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

题解:
这道题要求能使这个图不存在环的方法种数,这个方法是你可以任意反转边,那么我们先找到环,然后只有两种情况下反转边不能消除环
1、全部反转 2、一条也不反转
其余情况都是可以消除环的,那么我们统计就好了。
注意要处理
3
2 1 1
这种环,在dfs的时候如果直接判断当前节点如果等于父节点就continue掉的话,会出错。需要使用技巧处理。
这道题求环的方法是通过深度来解决的,并用used数组标记是否访问过,这种方法值得学习一下。

#include<bits/stdc++.h>
using namespace std;

const int maxn=2e5+5;
const __int64 mod=(__int64)(1e9+7);

int n,cycle;
__int64 Pow2[maxn];
vector<pair<int,int> > G[maxn];

bool used[maxn];
int dep[maxn];

void dfs(int now,int f,int d) {
    if(used[now]) {
        if(!cycle)
            cycle=d-dep[now];
        return;
    }
    dep[now]=d;
    used[now]=true;
    int len=(int)G[now].size();
    for(int i=0; i<len; ++i) {
        int from=G[now][i].first,to=G[now][i].second;
        if(from^f) {
            dfs(to,from,d+1);
//为什么是from,而不是now,因为上面的判断是from不等于f,而且每一次的from值都是取自G[now][i].first
        }
    }
}

int main() {
#ifdef tangge
    freopen("D.in","r",stdin);
#endif // tangge
    int val;
    Pow2[0]=1;
    for(int i=1; i<maxn; ++i) {
        Pow2[i]=(Pow2[i-1]<<1)%mod;
    }
    while(~scanf("%d",&n)) {
        for(int i=0; i<=n; ++i) {
            G[i].clear();
        }
        for(int i=1; i<=n; ++i) {
            scanf("%d",&val);
            G[i].push_back(make_pair(i,val));
            G[val].push_back(make_pair(i,i));
        }
        memset(used,false,sizeof(used));
        __int64 nums=0,ans=1;
        for(int i=1; i<=n; ++i) {
            if(!used[i]) {
                cycle=0;
                dfs(i,-1,0);
                ans=ans*(Pow2[cycle]-2)%mod;
                nums+=cycle;
            }
        }
        ans=ans*(Pow2[n-nums])%mod;
        cout<<ans<<endl;
    }
    return 0;
}



版权声明:本文为博主原创文章,未经博主允许不得转载。

Codeforces Round #369 (Div. 2) D. Directed Roads (dfs+组合数学 图论)

传送门:D. Directed Roads 描述: D. Directed Roads time limit per test 2 seconds memory li...

Codeforces Round #369 (Div. 2) -- D. Directed Roads (DFS找环)

大体题意: 给你一个有向图,可能会有环,你的操作是反向一条路,求得使得图中没有环所有方案数? 思路: 假如图中没有环的话,有n条边,答案就是2^n 如果有个m边的环,间接法考虑,总方案是2^m...

[Codeforces Round #369 (Div. 2)D. Directed Roads]Tarjan强连通分量+组合计数

[Codeforces Round #369 (Div. 2)D. Directed Roads]Tarjan强连通分量题目链接:[Codeforces Round #369 (Div. 2)D. D...

Codeforces Round #369 (Div. 2) D. Directed Roads

题目链接题意:给你一个n个点,n条有向边的图,你可以使任意条边反向,但是每条边只能反向一次,请求出使图不存在环的所有方案数量仔细思考我们发现,对于一个点数为x的环,除去全部不反向和全部反向两种情况,其...
  • naipp
  • naipp
  • 2016年08月30日 23:28
  • 118

Codeforces #369 div2 D.Directed Roads

codeforces

CodeForces 369 div2 D Directed Roads 图论 数论

D. Directed Roads time limit per test 2 seconds memory limit per test 256 megabytes ...

CodeForces - 711D Directed Roads(dfs判环)

Directed RoadsZS the Coder and Chris the Baboon has explored Udayland for quite some time. They real...

【Codeforces Round #369 (Div. 2)】Codeforces 711A Bus to Udayland

模拟
  • sdfzyhx
  • sdfzyhx
  • 2016年08月30日 13:53
  • 150

Codeforces Round #369 (div.2) 即 Codeforces 711

CodeForces Round #369 (div.2) DescreptionA有N排座位,每排有4个,这4个被分成了两组。给出每个座位是否是空的,问是否有相邻的座位。B给你一个N * N的幻方,...

Codeforces 711 E. ZS and The Birthday Paradox(数学)——Codeforces Round #369 (Div. 2)

[传送门](http://codeforces.com/contest/711/problem/E) E. ZS and The Birthday Paradoxtime limit per test...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Codeforces Round #369 (Div. 2) 711D Directed Roads (dfs)
举报原因:
原因补充:

(最多只允许输入30个字)