Pagini recente » Cod sursa (job #681724) | Cod sursa (job #2441925) | Cod sursa (job #479746) | Cod sursa (job #2676925) | Cod sursa (job #24912)
Cod sursa(job #24912)
#include <cstdio>
#include <vector>
using namespace std;
#define MAXN 1024
int M, N, seen[MAXN], type[MAXN];
vector<int> V[MAXN];
void read()
{
scanf("%d %d", &N, &M);
for (int i = 0; i < M; i++)
{
int nr;
scanf("%d", &nr);
nr *= 2;
for (; nr; nr--)
{
int p;
scanf("%d", &p),
V[i].push_back(p);
}
scanf("%d", &type[i]);
}
}
void mark(vector<int>::iterator itr1, vector<int>::iterator itr2)
{
for (; itr1 != itr2; itr1++)
seen[*itr1] = 1;
}
int check(vector<int>::iterator itr1, vector<int>::iterator itr2)
{
for (; itr1 != itr2; itr1++)
if (!seen[*itr1])
return 0;
return 1;
}
int getEasy()
{
memset(seen, 0, sizeof(seen));
for (int i = 0; i < M; i++)
{
if (type[i] == 0)
mark(V[i].begin(), V[i].end());
if (type[i] == 1)
mark(V[i].begin(), V[i].begin() + V[i].size() / 2);
if (type[i] == 2)
mark(V[i].begin() + V[i].size() / 2, V[i].end());
}
int nr = 0, p;
for (int i = 0; i < N; i++)
if (!seen[i])
nr++, p = i;
if (nr > 1)
return -1;
for (int i = 0; i < M; i++)
{
if (type[i] == 1)
if (check(V[i].begin() + V[i].size() / 2, V[i].end()))
return -1;
if (type[i] == 2)
if (check(V[i].begin(), V[i].begin() + V[i].size() / 2))
return -1;
}
return p;
}
int getHard()
{
memset(seen, 0, sizeof(seen));
for (int i = 0; i < M; i++)
{
if (type[i] == 0)
mark(V[i].begin(), V[i].end());
if (type[i] == 2)
mark(V[i].begin(), V[i].begin() + V[i].size() / 2);
if (type[i] == 1)
mark(V[i].begin() + V[i].size() / 2, V[i].end());
}
int nr = 0, p;
for (int i = 1; i <= N; i++)
if (!seen[i])
nr++, p = i;
if (nr > 1)
return -1;
for (int i = 0; i < M; i++)
{
if (type[i] == 2)
if (check(V[i].begin() + V[i].size() / 2, V[i].end()))
return -1;
if (type[i] == 1)
if (check(V[i].begin(), V[i].begin() + V[i].size() / 2))
return -1;
}
return p;
}
void solve()
{
int p1 = getEasy();
if (p1 != -1)
{
printf("%d\n", p1);
return;
}
p1 = getHard();
if (p1 != -1)
{
printf("%d\n", p1);
return;
}
printf("0\n");
}
int main()
{
freopen("balanta.in", "r", stdin);
freopen("balanta.out", "w", stdout);
read();
solve();
return 0;
}