Pagini recente » Cod sursa (job #2850625) | Cod sursa (job #966750) | Cod sursa (job #2747577) | Cod sursa (job #767459) | Cod sursa (job #1212237)
#include<iostream>
#include<fstream>
#define maxn 1030
using namespace std;
ifstream f("balanta.in");
ofstream g("balanta.out");
int st[maxn],dr[maxn],usor[maxn],greu[maxn],i,j,n,k,m,c;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)usor[i]=1;
for(i=1;i<=n;i++)greu[i]=1;
while(m>0)
{
f>>k;
for(i=1;i<=k;i++)f>>j,st[j]=1;
for(i=1;i<=k;i++)f>>j,dr[j]=1;
f>>c;
if(c==2){
for(i=1;i<=n;i++)usor[i]*=st[i],st[i]=0;
for(i=1;i<=n;i++)greu[i]*=dr[i],dr[i]=0;
}
else
if(c==1){
for(i=1;i<=n;i++)greu[i]*=st[i],st[i]=0;
for(i=1;i<=n;i++)usor[i]*=dr[i],dr[i]=0;
}
else
for(i=1;i<=n;i++)usor[i]-=dr[i],usor[i]-=st[i],greu[i]-=dr[i],greu[i]-=st[i],st[i]=0,dr[i]=0;
m--;
}
k=0;
for(i=1;i<=n;i++)
{
if(usor[i])k++,j=i;
if(greu[i])k++,j=i;
}
if(k==1)g<<j;
else
g<<0;
return 0;
}