Cod sursa(job #2020656)

Utilizator CodrinsahCotarlan Codrin Codrinsah Data 11 septembrie 2017 11:55:38
Problema Pioni Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.11 kb
#include <fstream>
#include <vector>
#include <bitset>

using namespace std;
ifstream fi ("pioni.in");
ofstream fo ("pioni.out");

vector <int> v[20005];
bitset <20005> radacina;

int lg[20005],sol[20005],a[20005];
int t,nrnod,nrmuchii,i,rez,nr;

void citire()
{
    fi>>t>>nrnod>>nrmuchii;
    for (i=1;i<=nrnod;i++) radacina[i]=true;
    for (i=1;i<=nrmuchii;i++)
    {
      int nod1,nod2;
      fi>>nod1>>nod2;
      v[nod2].push_back(nod1);
      radacina[nod1]=false;
    }
}

void dfs(int nod)
{
  int it;
  for (it=0;it<v[nod].size();it++)
  {
    if (sol[nod]==0) sol[v[nod][it]]=nod;
    else sol[v[nod][it]]=0;
    dfs(v[nod][it]);
  }
}
int main()
{
  citire();
  for (i=1;i<=nrmuchii;i++)
    if (radacina[i])
      dfs(i);
  while (t)
  {
    t--;
    rez=0;
    fi>>nr;
    for (i=1;i<=nr;i++)
    {
      fi>>a[i];
      if (sol[a[i]]!=0) rez++;
    }
    if (rez>0)
    {
      fo<<"Nargy"<<'\n';
      fo<<rez;
      for (i=1;i<=nr;i++) if (sol[a[i]]>0) fo<<' '<<a[i]<<' '<<sol[a[i]];
      fo<<'\n';
    }
    else fo<<"Fumeanu"<<'\n';
  }
  return 0;
}