Pagini recente » Cod sursa (job #3177875) | Cod sursa (job #153650) | Cod sursa (job #2176934) | Cod sursa (job #2921248) | Cod sursa (job #3271337)
#include <fstream>
#include <vector>
#include <set>
#include <stack>
using namespace std;
ifstream fin("obiective.in");
ofstream fout("obiective.out");
int n, m, i, j, viz[32005], nr, component[32005], x, y, t;
vector <int> v1[32005], v2[32005];
stack <int> q;
set <int> components[32005];
void dfs1(int nod)
{
viz[nod]=1;
for(auto i: v1[nod])
if(viz[i]==0)
dfs1(i);
q.push(nod);
}
void dfs2(int nod)
{
viz[nod]=1;
component[nod]=nr;
components[nr].insert(nod);
for(auto i: v2[nod])
if(viz[i]==0)
dfs2(i);
}
int main()
{
fin>>n>>m;
for(i=1; i<=m; i++)
{
fin>>x>>y;
v1[x].push_back(y);
v2[y].push_back(x);
}
for(i=1; i<=n; i++)
if(viz[i]==0)
dfs1(i);
for(i=1; i<=n; i++)
viz[i]=0;
while(!q.empty())
{
int x=q.top();
q.pop();
if(viz[x]==0)
{
nr++;
dfs2(x);
}
}
fin>>t;
while(t--)
{
fin>>x>>y;
fout<<component[x]<<" "<<component[y]<<'\n';
}
for(i=1; i<=nr; i++)
{
for(auto j: components[i])
fout<<j<<" ";
fout<<'\n';
}
return 0;
}