Pagini recente » Cod sursa (job #2103701) | Cod sursa (job #1009326) | Cod sursa (job #1911463) | Cod sursa (job #1966888) | Cod sursa (job #1330912)
#include <iostream>
#include <fstream>
#include <math.h>
#include <algorithm>
using namespace std;
ifstream f("balanta.in");
ofstream g("balanta.out");
int vs[1025] ,vd[1025] ,p[1025];
int n ,m ,i ,j ,x ,r;
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x;
for(j=1;j<=x;j++)
f>>vs[j];
for(j=1;j<=x;j++)
f>>vd[j];
f>>r;
if(r==0)
for(j=1;j<=x;j++)
{
p[vs[j]]=1;
p[vd[j]]=1;
}
else
if(r==1)
for(j=1;j<=x;j++)
p[vd[j]]=1;
else
for(j=1;j<=x;j++)
p[vs[j]]=1;
}
m=0;
for(i=1;i<=n;i++)
{
if(p[i]==0)
{
if(m==0)
{
m=i;
}
else
{
m=0;
break;
}
}
}
g<<m;
}