Pagini recente » Cod sursa (job #615231) | Cod sursa (job #2708679) | Cod sursa (job #925953) | Cod sursa (job #3185525) | Cod sursa (job #2305366)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("balanta.in");
ofstream fout("balanta.out");
short frg[1050],fru[1050],a[1050],b[1050],tip;
int nr1,nr0,sol;
/// 0 nu se stie cum e moneda
/// 1 moneda e suspecta
/// 2 moneda e sigura
int n,m,i,j,k;
int main()
{
fin>>n>>m;
for(i=1;i<=m;i++){
fin>>k;
for(j=1;j<=k;j++)
fin>>a[j];
for(j=1;j<=k;j++)
fin>>b[j];
fin>>tip;
if(tip==0)
for(j=1;j<=k;j++){
frg[a[j]]=frg[b[j]]=2;
fru[a[j]]=fru[b[j]]=2;
}
if(tip==1){
for(j=1;j<=k;j++){
frg[b[j]]=fru[a[j]]=2;
}
for(j=1;j<=k;j++){
if(frg[a[j]]<2)
frg[a[j]]=1;
if(fru[b[j]]<2)
fru[b[j]]=1;
}
}
if(tip==2){
for(j=1;j<=k;j++){
fru[b[j]]=frg[a[j]]=2;
}
for(j=1;j<=k;j++){
if(fru[a[j]]<2)
fru[a[j]]=1;
if(frg[b[j]]<2)
frg[b[j]]=1;
}
}
}
nr1=0;
nr0=0;
for(i=1;i<=n;i++){
if(frg[i]==0)
nr0++;
else if(frg[i]==1){
nr1++;
sol=i;
}
}
if(nr0==0&&nr1==1){
fout<<sol;
return 0;
}
nr1=0;
nr0=0;
for(i=1;i<=n;i++){
if(fru[i]==0)
nr0++;
else if(fru[i]==1){
nr1++;
sol=i;
}
}
if(nr0==0&&nr1==1){
fout<<sol;
return 0;
}
fout<<0;
}