Pagini recente » Cod sursa (job #401959) | Cod sursa (job #166298) | Cod sursa (job #1932815) | Cod sursa (job #1941173) | Cod sursa (job #2734144)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("pioni.in");
ofstream fout("pioni.out");
int t,n,m,sg[200005],nr[200005];
vector<int> muchii[200005];
bool use[200005];
void calc(int nod)
{
int f[20005];
memset(f,1,sizeof(f));
use[nod]=1;
int mex=0;
for(auto i:muchii[nod])
{
if(!use[i])
calc(i);
f[sg[i]]=0;
while(f[mex]==0)
mex++;
}
sg[nod]=mex;
}
void solve()
{
int k;
fin>>k;
int suma=0;
for(int i=1;i<=k;i++)
{
int x;
fin>>x;
suma^=sg[x];
nr[x]++;
}
if(suma==0)
{
fout<<"Fumeanu\n";
return;
}
fout<<"Nargy\n";
vector<int> sol;
for(int nod=1;nod<=n;nod++)
for(auto j:muchii[nod])
if(((suma^sg[nod])^sg[j])==0)
for(int p=1;p<=nr[nod];p++)
{
sol.push_back(nod);
sol.push_back(j);
}
fout<<sol.size()/2<<" ";
for(auto i:sol)
fout<<i<<" ";
fout<<'\n';
}
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(0);
fin>>t>>n>>m;
for(int i=1;i<=m;i++)
{
int a,b;
fin>>a>>b;
muchii[a].push_back(b);
}
for(int i=1;i<=m;i++)
if(!use[i])
calc(i);
while(t--)
solve();
return 0;
}