Pagini recente » Cod sursa (job #2020244) | Cod sursa (job #1053318) | Cod sursa (job #2018676) | Cod sursa (job #2072867) | Cod sursa (job #1038554)
#include <fstream>
#define maxn 1024
using namespace std;
ifstream fin("balanta.in");
ofstream fout("balanta.out");
int v[maxn],a[maxn],b[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;
for (int i=1; i<=k; ++i)
{
fin>>a[i];
}
for (int i=1; i<=k; ++i)
{
fin>>b[i];
}
fin>>c;
maxv = 0;
if (c==0)
{
for (int i=1; i<=k; ++i)
{
maxv = max (max(v[a[i]],v[b[i]]),maxv);
}
for (int i=1; i<=k; ++i)
{
v[a[i]] = maxv;
v[b[i]] = maxv;
}
}
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);
}
}
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);
}
}
}
maxi = 1; mini = 1;
ok1 = 0, ok2 = 0;
for (int i=1; i<=n; ++i)
{
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) fout<<maxi;
else if (ok2) fout<<mini;
else fout<<0;
}