codeforces CF949C Data Center Maintenance Tarjan强连通分量

$ \rightarrow $ 戳我进CF原题

　
BigData Inc. is a corporation that has $ n $ data centers
indexed from $ 1 $ to $ n $ that are located all over the world.
These data centers provide storage for client data (you can figure out that client data is really big!).
　
Main feature of services offered by BigData Inc.
is the access availability guarantee even under the circumstances of any data center having an outage.
Such a guarantee is ensured by using the two-way replication.
Two-way replication is such an approach for data storage
that any piece of data is represented by two identical copies that are stored in two different data centers.
　
For each of $ m $ company clients,
let us denote indices of two different data centers storing this client data as $ c_{i, 1} $ and $ c_{i, 2} $ .
　
In order to keep data centers operational and safe,
the software running on data center computers is being updated regularly.
Release cycle of BigData Inc.
is one day meaning that the new version of software is being deployed to the data center computers each day.
　
Data center software update is a non-trivial long process,
that is why there is a special hour-long time frame that is dedicated for data center maintenance.
During the maintenance period, data center computers are installing software updates,
and thus they may be unavailable.
Consider the day to be exactly $ h $ hours long.
For each data center there is an integer $ u_j (0 \le u_j \le h - 1) $ defining the index of an hour of day,
such that during this hour data center $ j $ is unavailable due to maintenance.
　
Summing up everything above, the condition $ u_{c_{i, 1}} \not=  u_{c_{i, 2}} $ should hold for each client,
or otherwise his data may be unaccessible while data centers that store it are under maintenance.
　
Due to occasional timezone change in different cities all over the world,
the maintenance time in some of the data centers may change by one hour sometimes.
Company should be prepared for such situation, that is why they decided to conduct an experiment,
choosing some non-empty subset of data centers, and shifting the maintenance time for them by an hour later
(i.e. if $ u_j = h - 1 $ , then the new maintenance hour would become $ 0 $ , otherwise it would become $ u_j + 1 $ ).
　
Such an experiment would provide useful insights,
but changing update time is quite an expensive procedure,
that is why the company asked you to find out the minimum number of data centers
that have to be included in an experiment in order to keep the data accessibility guarantees.
　

Input

The first line of input contains three integers $ n, m $ and $ h (2 \le n \le100 000, 1 \le m \le 100 000, 2 \le h \le 100 000) $ ,
the number of company data centers, number of clients and the day length of day measured in hours.
　
The second line of input contains $ n $ integers $ u_1, u_2,\dots, u+n (0 \le uj < h) $ ,
$ j $ -th of these numbers is an index of a maintenance hour for data center $ j $ .
　
Each of the next m lines contains two integers $ c_{i, 1} $ and $ c_{i, 2} (1 \le c_{i, 1}, c_{i, 2} \le n, c_{i, 1} ≠ c_{i, 2} ) $ ,
defining the data center indices containing the data of client $ i $ .
　
It is guaranteed that the given maintenance schedule allows
each client to access at least one copy of his data at any moment of day.
　

Output

In the first line print the minimum possible number of data centers $ k (1\le k \le n) $
that have to be included in an experiment in order to keep the data available for any client.
　
In the second line print k distinct integers $ x_1, x_2,\dots, x_k (1 \le x_i \le n) $ ,
the indices of data centers whose maintenance time will be shifted by one hour later.
Data center indices may be printed in any order.
　
If there are several possible answers, it is allowed to print any of them.
It is guaranteed that at there is at least one valid choice of data centers.
　

Examples

input1

 3 3 5
 4 4 0
 1 3
 3 2
 3 1

output1

 1
 3

input2

 4 5 4
 2 1 0 3
 4 3
 3 2
 1 2
 1 4
 1 3

output2

 4
 1 2 3 4 

Note

Consider the first sample test.
The given answer is the only way to conduct an experiment involving the only data center.
In such a scenario the third data center has a maintenance during the hour 1,
and no two data centers storing the information of the same client have maintenance at the same hour.
　
On the other hand, for example,
if we shift the maintenance time on hour later for the first data center,
then the data of clients 1 and 3 will be unavailable during the hour 0.
　

题目大意

• 有 $ n $ 个信息中心，第 $ i $ 个信息中心要在第 $ t_i $ 个小时维护，维护期间信息不能被获得。

• 每个用户的数据都有两份备份，第 $ i $ 个用户的数据放在信息中心 $ c_{i,1} $ 和 $ c_{i,2} $ 。

• 现在要挑选一个尽量小的信息中心合集，使得将这个集合的维护时间推迟一个小时后，仍然能保证每个用户的数据在任意时刻都能获得。

• $ n \le 100000 $
  　

  题解

• 对于每个$ c_{i,1} ， c_{i,2} $ 若调整 $ c_{i,1} $ 后与 $ c_{i,2} $ 的维护时间冲突 则连边$ （c_{i,1} ， c_{i,2} ）$

• 对于$ c_{i,2} ， c_{i,1} $ 亦然

• 求出强连通分量，所求集合即为缩点后度数为0的最小的 $ SCC $
  　

  代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<stack>
using namespace std;
#define maxn 100005
stack<int>s;
vector<int>e[maxn],sct[maxn];
int dfn[maxn],low[maxn],tim,bel[maxn],scc;
bool vis[maxn];
void tarjan(int u){
    dfn[u]=low[u]=++tim; vis[u]=1; s.push(u);
    for(int v,i=0;i<e[u].size();++i)
        if(!dfn[v=e[u][i]]){
            tarjan(v);
            low[u]=min(low[v],low[u]);
        } else if(vis[v])
            low[u]=min(dfn[v],low[u]);
    if(dfn[u]==low[u]){
        ++scc;
        do{
            u=s.top(); s.pop(); vis[u]=0;
            bel[u]=scc;
            sct[scc].push_back(u);
        }while(dfn[u]!=low[u]);
    }
}
int n,deg[maxn];
inline void shrink_point(){
    for(int i=1;i<=n;++i)
        for(int j=0;j<e[i].size();++j)
            if(bel[i]!=bel[e[i][j]])
                ++deg[bel[i]];
}
int m,h,t[maxn],ans,siz=maxn;
int main(){
    scanf("%d %d %d",&n,&m,&h);
    for(int i=1;i<=n;++i) scanf("%d",&t[i]);
    for(int u,v,i=1;i<=m;++i){
        scanf("%d %d",&u,&v);
        if((t[u]+1)%h==t[v]) e[u].push_back(v);
        if((t[v]+1)%h==t[u]) e[v].push_back(u);
    }
    for(int i=1;i<=n;++i) if(!dfn[i]) tarjan(i);
    shrink_point();
    for(int i=1;i<=scc;++i)
        if(deg[i]==0&&sct[i].size()<siz){ ans=i; siz=sct[i].size(); }
    printf("%d\n",sct[ans].size());
    sort(sct[ans].begin(),sct[ans].end());
    for(int i=0;i<sct[ans].size();++i) printf("%d ",sct[ans][i]);
    return 0;
}