Pagini recente » Cod sursa (job #2413129) | Cod sursa (job #337109) | Cod sursa (job #421939) | Cod sursa (job #1636574) | Cod sursa (job #2986196)
#include <fstream>
#include <vector>
#include <bitset>
#include <stack>
#define DIM 101
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n,m,x,y,cnt,lvl[DIM],low[DIM];
vector<int> l[DIM],c[DIM];
bitset<DIM> viz;
stack<int> st;
void dfs(int nod,int niv) {
lvl[nod]=niv;
low[nod]=niv;
st.push(nod);
viz[nod]=1;
for (int i=0;i<l[nod].size();i++) {
int vec=l[nod][i];
if (lvl[vec]==0) {
dfs(vec,niv+1);
low[nod]=min(low[nod],low[vec]);
}
else
if (viz[vec]==1)
low[nod]=min(low[nod],low[vec]);
}
if (lvl[nod]==low[nod]) {
cnt++;
int x;
do {
x=st.top();
st.pop();
c[cnt].push_back(x);
viz[x]=0;
} while (x!=nod);
}
}
int main() {
fin>>n>>m;
while (m--) {
fin>>x>>y;
l[x].push_back(y);
}
for (int i=1;i<=n;i++)
if (lvl[i]==0)
dfs(i,1);
fout<<cnt<<"\n";
for (int i=1;i<=cnt;i++) {
for (int j=0;j<c[i].size();j++)
fout<<c[i][j]<<" ";
fout<<"\n";
}
return 0;
}