首先理解题意很重要。。。题意看得我云里雾里,意思是有多个会议,每个会议都要满足要求,如果一个人他是什么会议都参加不了,那他就要被踢出了。
关系不好的不坐一起,那么反向建边,把那些能坐一起的建一条边,然后找点双连通分量。
在一个点双连通分量中,如果存在奇环,如果有点x在这个环外,那么一定存在x与这个奇环上的点形成简单环,因为奇环两个点间一定存在一奇一偶,所以类似缩点后,就用染色法判断存在奇环没,类似判定二分图,有奇环就不是二分图。
tarjan这种多组输入真恶心。。经常少初始化而wa然后找半天bug。
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<stack>
#include<map>
using namespace std;
#define LL long long
#define eps (1e-8)
const int maxn = 1e3+10;
const LL mod = 1e9 + 7;
const LL inf = 1e15;
int f[maxn][maxn];
struct node
{
int v, nxt;
}e[2 * maxn * maxn];
int head[maxn], cnt;
void add(int u, int v)
{
e[++cnt].v = v;
e[cnt].nxt = head[u];
head[u] = cnt;
}
int dfn[maxn], low[maxn], vis[maxn], scc[maxn], tmp[maxn], book[maxn], ans[maxn], ti, col, num;
stack<int>s;
bool judge(int u, int clr)
{
book[u] = clr;
for (int i = head[u]; i; i = e[i].nxt)
{
int v = e[i].v;
if (scc[v] == col)
{
if (book[v] && book[v] == book[u])
return true;
if (!book[v] && judge(v, -clr))
return true;
}
}
return false;
}
void tarjan(int u,int fa)
{
dfn[u] = low[u] = ++ti;
s.push(u);
vis[u] = 1;
for (int i = head[u]; i; i = e[i].nxt)
{
int v = e[i].v;
if (v == fa)continue;
if (!dfn[v])
{
tarjan(v, u);
low[u] = min(low[u], low[v]);
if (low[v] >= dfn[u])
{
col++, num = 0;
while (1)
{
int v1 = s.top();
s.pop();
vis[v1] = 0;
scc[v1] = col;
tmp[++num] = v1;
if (v1 == v)break;//注意到v就好了,以为u可能还是其他点的割点。
}
tmp[++num] = u;
memset(book, 0, sizeof(book));
if (num >= 3 && judge(u, 1))
{
for (int k = 1; k <= num; k++)ans[tmp[k]] = 1;
}
}
}
else if (vis[v]) low[u] = min(low[u], dfn[v]);
}
}
void init()
{
memset(head, 0, sizeof(head));
memset(dfn, 0, sizeof(dfn));
memset(low, 0, sizeof(low));
memset(ans, 0, sizeof(ans));
memset(vis, 0, sizeof(vis));
memset(scc, 0, sizeof(scc));
memset(f, 0, sizeof(f));
while (!s.empty())s.pop();
cnt = 0, ti = 0, col = 0, num = 0;
}
int main()
{
int n, m;
while (~scanf("%d%d", &n, &m) && n && m)
{
init();
int u, v;
while (m--)
{
scanf("%d%d", &u, &v);
f[u][v] = f[v][u] = 1;
}
for (int i = 1; i <= n; i++)
{
for (int j = i + 1; j <= n; j++)
{
if (!f[i][j])add(i, j), add(j, i);
}
}
for (int i = 1; i <= n; i++)
{
if (!dfn[i])tarjan(i, -1);
}
int res = 0;
for (int i = 1; i <= n; i++)
{
if (!ans[i])res++;
}
cout << res << endl;
}
return 0;
}