Pagini recente » Cod sursa (job #395418) | Cod sursa (job #2325334) | Cod sursa (job #3237691) | Cod sursa (job #2932695) | Cod sursa (job #2356924)
#include <fstream>
#include <cstring>
#include <vector>
#include <cstdio>
using namespace std;
ifstream cin("pioni.in");
ofstream count("pioni.out");
#define NMAX 10010
int n, m, T, k, x, y, fr[NMAX], win[NMAX], t[NMAX];
vector<int> a[NMAX];
void dfs(int nod)
{
fr[nod] = 1;
for(auto it : a[nod])
{
if(!fr[it])
dfs(it);
if(!win[it])
win[nod] = 1, t[nod] = it;
}
}
int main()
{
cin>>T>>n>>m;
for(int i = 1; i <= m; i++)
{
cin>>x>>y;
a[x].push_back(y);
}
for(int i = 1; i <= n; i++)
if(!fr[i])
dfs(i);
for(; T >= 1; T--)
{
cin>>k;
vector<int> moves;
for(int i = 1; i <= k; i++)
{
cin>>x;
if(win[x])
moves.push_back(x);
}
if(moves.size() == 0)
cout<<"Fumeanu\n";
else
{
cout<<"Nargy\n"<<moves.size();
for(auto it : moves) {
cout<<' '<<it<<' '<<t[it];
}
cout<<endl;
}
}
return 0;
}