【Tarjan】NOIP2015D1T2[信息传递]题解

解题报告

这……为什么我不在那年考NOIP……这道题显然是求最小且不为 1 <script type="math/tex" id="MathJax-Element-1">1</script> 的最小环……

示例程序

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=200000;

int n,E,lnk[maxn+5],nxt[maxn+5],son[maxn+5],ans;
int ti,dfn[maxn+5],low[maxn+5],top,stk[maxn+5],si[maxn+5];
bool vis[maxn+5];

#define Eoln(x) ((x)==10||(x)==13||(x)==EOF)
inline char readc()
{
    static char buf[100000],*l=buf,*r=buf;
    if (l==r) r=(l=buf)+fread(buf,1,100000,stdin);
    if (l==r) return EOF;return *l++;
}
inline int readi(int &x)
{
    int tot=0,f=1;char ch=readc(),lst='+';
    while ('9'<ch||ch<'0') {if (ch==EOF) return EOF;lst=ch;ch=readc();}
    if (lst=='-') f=-f;
    while ('0'<=ch&&ch<='9') tot=(tot<<3)+(tot<<1)+ch-48,ch=readc();
    return x=tot*f,Eoln(ch);
}
void Tarjan(int x)
{
    dfn[x]=low[x]=++ti;stk[++top]=x;vis[x]=true;
    for (int j=lnk[x];j;j=nxt[j])
        if (!dfn[son[j]]) Tarjan(son[j]),low[x]=min(low[x],low[son[j]]); else
        if (vis[son[j]]) low[x]=min(low[x],dfn[son[j]]);
    if (dfn[x]==low[x]) for (int y=stk[top--];;y=stk[top--])
        {vis[y]=false;si[x]++;if (x==y) break;}
}
#define Add(x,y) son[++E]=(y),nxt[E]=lnk[(x)],lnk[(x)]=E
int main()
{
    freopen("message.in","r",stdin);
    freopen("message.out","w",stdout);
    readi(n);for (int i=1,x;i<=n;i++) readi(x),Add(i,x);
    for (int i=1;i<=n;i++) if (!dfn[i]) Tarjan(i);
    ans=n;for (int i=1;i<=n;i++) if (dfn[i]==low[i]&&si[i]>1) ans=min(ans,si[i]);
    return printf("%d\n",ans),0;
}