Pagini recente » Cod sursa (job #1622373) | Cod sursa (job #1707839) | Cod sursa (job #1429100) | Cod sursa (job #2411091) | Cod sursa (job #1570978)
#include<fstream>
#include<algorithm>
#include<iostream>
using namespace std;
ifstream fin("balanta.in");
ofstream fout("balanta.out");
int v[1024],uv[1024],i,j,h,m,n,k,nr,maxi,nrmax,u[1024],r,ok;
int main()
{
fin>>n>>m;
for(h=1;h<=m;h++)
{
fin>>k;
ok=0;
for(i=1;i<=k;i++)
{
fin>>v[i];
if(h==1)
uv[v[i]]=1;
}
for(i=1;i<=k;i++)
{
fin>>v[i+k];
if(h==1)
uv[v[i+k]]=2;
}
for(i=1;i<=k;i++)
if(uv[v[i+k]]!=uv[v[i]])
ok=1;
fin>>r;
if(r==1)
for(i=1;i<=k*2;i++)
{
if(ok==0)
{
if(i<=k)
u[v[i]]++;
}
else
u[v[i]]++;
}
else
if(r==2)
for(i=1;i<=k*2;i++)
{
if(ok==0)
{
if(i>k)
u[v[i]]++;
}
else
u[v[i]]++;
}
}
nr=0;
for(i=1;i<=n;i++)
{
if(u[i]>maxi)
{
nrmax=i;
maxi=u[i];
nr=1;
}
else
if(u[i]==maxi)
nr++;
}
if(nr==1)
fout<<nrmax;
else
fout<<0;
fin.close();
fout.close();
return 0;
}