Pagini recente » Cod sursa (job #1134173) | Cod sursa (job #3273384) | Cod sursa (job #2348655) | Cod sursa (job #214820) | Cod sursa (job #2443807)
#include <bits/stdc++.h>
using namespace std;
ifstream in ("pioni.in");
ofstream out("pioni.out");
const int N = 20005;
vector<int> v[N];
bool dp[N],viz[N];
int nxt[N];
void dfs (int x)
{
viz[x] = 1;
for (auto it: v[x])
{
if (!viz[it])
dfs(it);
if (!dp[it])
{
dp[x] = 1;
nxt[x] = it;
}
}
}
int main()
{
int t,n,m;
in >> t >> n >> m;
for (int i = 1; i<=m; i++)
{
int x,y;
in >> x >> y;
v[x].push_back(y);
}
for (int i = 1; i<=n; i++)
if (!viz[i])
dfs(i);
for (int i = 1; i<=t; i++)
{
int k;
in >> k;
vector<int> sol;
for (int j = 1; j<=k; j++)
{
int x;
in >> x;
if (dp[x])
sol.push_back(x);
}
if (sol.size()>0)
{
out << "Nargy\n" << sol.size() << " ";
for (auto it: sol)
out << it << " " << nxt[it] << " ";
out << "\n";
}
else
out << "Fumeanu\n";
}
}