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

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
  • 137

CodeForces - 711D Directed Roads(dfs判环)

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

Codeforces711D-Directed Roads(强连通分量+乘法原理)

题目链接http://codeforces.com/contest/711/problem/D思路这道题的输入很神奇,由输入可以得出一个结论就是每个点最多只会有一条出边,因此每个点最多在一个环中。 ...
  • Lzedo
  • Lzedo
  • 2016年09月23日 20:46
  • 165

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
  • 562

Codeforces Problem 711D Directed Roads(Tarjan判环)

Codeforces Problem 711D Directed Roads(Tarjan判环)

HX711 24位A/D模块计算公式

HX711 称重传感器 运算放大器 24位A/D模块

[基环] codeforces 711D. Directed Roads

Directed Roads题意:给n个点,和P[i],表示从第i个点到P[i]有一条有向边,每条边可以至多翻转方向一次,问有多少种方法翻转后没有环。思路:n个点n条边,无自环,每点出度为1,这个模型...
  • kg20006
  • kg20006
  • 2016年08月30日 14:39
  • 248

【34.40%】【codeforces 711D】Directed Roads

time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandar...

项目进度(四) - hx711组成秤

关于hx711与arduino的接线: 1. VCC 可以是 2.6-5.5 中的任意值,因为我们使用的是 Arduino ,所以直接5V供电,GND 接地。 2. SCK 接 A...

g711u与g729比较编码格式

g711a—编解码格式为G.711 alaw •g711u—编解码格式为G.711 ulaw (the default) •g729—编解码格式为G.729 •g729a—编解码格式...
  • bytxl
  • bytxl
  • 2015年12月26日 16:29
  • 1789
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:711D
举报原因:
原因补充:

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