711D

原创 2016年08月30日 13:53:39
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裸题

一个强连通分量(环)(1<<环的大小)-2;

其他为1<<k k=n-环的元素总和;

两者相乘

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
  • 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
  • FTQOOO
  • 2016年08月31日 21:09
  • 569

CF - 711D 搜索环

题意: 给出n个点n条单向边的一个图,其中可以任意选择其中的某个边的集合,将其中的边反向,问可以选择多少种集合,使得整个图中不存在环? 思路: 初看这题可能会觉得无从下手,仔细读题之后会...
  • Bahuia
  • 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
  • nare123
  • 2016年09月06日 22:25
  • 182

codeforces 711D Directed Roads(DFS)

题目链接:http://codeforces.com/problemset/problem/711/D 思路:由于每个点出度都为1,所以没有复杂的环中带环。DFS遍历,若为环则有2^k-2种,若为链...
  • West___wind
  • West___wind
  • 2016年09月03日 11:23
  • 167

codeforces 711D Directed Roads

题目链接:cf 711D 这个题主要是读题意比较难 因为是n个点,n条边,那么肯定会有环存在 那么,一旦出现了环,就出现了题中给的非法情况 那么,我们根据连通情况将图中的点分类...
  • kevin66654
  • kevin66654
  • 2016年09月16日 14:15
  • 161

codeforces 711D Directed Roads dfs

首先给的每个点只有一个出度既不可能有大于一个出度 每条边可以改变方向 所以每个点最多只能在一个环上,且所有有向环的信息已经给出因为每个点只有一个出度 dfs把每个环都求出来 ans *( 2^n...
  • acblacktea
  • acblacktea
  • 2016年09月06日 12:46
  • 172

【图论】Codeforces 711D Directed Roads

题目链接:   http://codeforces.com/problemset/problem/711/D 题目大意:   给一张N个点N条有向边的图,边可以逆向。问任意逆向若...
  • u010568270
  • u010568270
  • 2016年08月30日 15:01
  • 326

Codeforces 711D dfs找环

题目:http://codeforces.com/contest/711/problem/D题意: 有一个n个点的有向图,有n条边,分别从每个点 i 出发指向某个点ai,现在可以把某些边翻转,问总...
  • hjt_fathomless
  • 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
  • harlow_cheng
  • 2016年10月09日 17:13
  • 246
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:711D
举报原因:
原因补充:

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