Pagini recente » Cod sursa (job #1675425) | Cod sursa (job #2638728) | Cod sursa (job #206151) | Cod sursa (job #1589417) | Cod sursa (job #1595655)
#include <fstream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <bitset>
#include <iomanip>
using namespace std;
#define mp make_pair
#define eps 0.000001
#define inf 1 << 20
ifstream fin("balanta.in");
ofstream fout("balanta.out");
bitset<1030> a,b,c,d;
int i,j,n,m,k,l,x;
int main()
{
fin >> n >> m;
for(i = 1; i <= n; i++)
a[i] = b[i] = 1;
for(i = 1; i <= m; i++)
{
fin >> k;
c&=0;
d&=0;
for(j = 1; j <= k; j++)
{
fin >> x;
c[x] = 1;
}
for(j = 1; j <= k; j++)
{
fin >> x;
d[x] = 1;
}
fin >> l;
if(l == 0)
{
c.flip();
d.flip();
a = a & c & d;
b = b & c & d;
}
if(l == 1)
{
a &= c;
b &= d;
}
if(l == 2)
{
a &= d;
b &= c;
}
}
if(a.count() + b.count() == 1)
{
for(i = 1; i <= n; i++)
if(a[i] || b[i])
{
fout << i;
return 0;
}
}
else
fout << 0;
return 0;
}