Pagini recente » Cod sursa (job #2964747) | Cod sursa (job #426584) | Cod sursa (job #1541014) | Cod sursa (job #1173293) | Cod sursa (job #1038641)
#include <fstream>
#include <cstring>
#define maxn 1024
using namespace std;
ifstream fin("balanta.in");
ofstream fout("balanta.out");
int v[maxn],a[maxn],b[maxn],mark[maxn],use[maxn];
int k,c,maxv,mini,maxi,n,m,ok1,ok2;
int main()
{
fin>>n>>m;
for (int i=1; i<=m; ++i)
{
fin>>k;
memset (use,0,sizeof(use));
for (int i=1; i<=k; ++i)
{
fin>>a[i];
use[a[i]] = 1;
}
for (int i=1; i<=k; ++i)
{
fin>>b[i];
use[b[i]] = 1;
}
fin>>c;
maxv = 0;
if (c==0)
{
for (int i=1; i<=k; ++i)
{
mark[a[i]] = 1;
mark[b[i]] = 1;
}
}
else if (c==1)
{
for (int i=1; i<=k; ++i)
{
maxv = max (maxv,v[b[i]]);
}
for (int i=1; i<=k; ++i)
{
v[a[i]] = max (v[a[i]],maxv +1);
}
for (int i=1; i<=n; ++i)
{
if (!use[i]) mark[i] = 1;
}
}
else
{
for (int i=1; i<=k; ++i)
{
maxv = max (maxv,v[a[i]]);
}
for (int i=1; i<=k; ++i)
{
v[b[i]] = max (v[b[i]],maxv +1);
}
for (int i=1; i<=n; ++i)
{
if (!use[i]) mark[i] = 1;
}
}
}
maxi = 1; mini = 1;
ok1 = 0, ok2 = 0;
for (int i=1; i<=n; ++i)
{
if (mark[i]) continue;
if (v[i] > v[maxi])
{
maxi = i;
ok1 = 1;
}
else if (v[i]==v[maxi])
{
ok1 = 0;
}
if (v[i] < v[mini])
{
mini = i;
ok2 = 1;
}
else if (v[i]==v[mini])
{
ok2 = 0;
}
}
if (ok1 && !ok2) fout<<maxi;
else if (ok2 && !ok1) fout<<mini;
else fout<<0;
}