题意:
给出一个包含n个点,m条边的图,问能否将n个点分为两组,使任意一边上的两点都为不同组
题解:
dfs
#include<iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include<stdlib.h>
#include <string.h>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<time.h>
using namespace std;
#define MAX_N 100005
#define inf 0x7fffffff
#define LL long long
#define ull unsigned long long
#define mod 10007
LL INF=9e18;
vector<int>G[MAX_N];
vector<int>ans[2];
short color[MAX_N];
bool vis[MAX_N];
void dfs(int u, int k)
{
color[u] = k;
ans[k].push_back(u);
for(int i=0;i<G[u].size();i++) {
if(color[G[u][i]] == -1) {
dfs(G[u][i], !k);
}
}
}
bool check(int u)
{
vis[u] = true;
for(int i=0;i<G[u].size();i++) {
if(color[u] == color[G[u][i]])
return false;
if(!vis[G[u][i]]) {
if(!check(G[u][i]))
return false;
}
}
return true;
}
int main()
{
int n,m;
cin >> n >> m;
for(int i=0;i<m;i++) {
int u,v;
scanf("%d%d",&u,&v);
G[u].push_back(v);
G[v].push_back(u);
}
memset(color, -1, sizeof(color));
memset(vis, false, sizeof(vis));
bool flag = true;
for(int i=1;i<=n;i++) {
if(!vis[i]) {
dfs(i, 0);
if(!check(i)) {
flag = false;
break;
}
}
}
if(flag) {
cout << ans[0].size() << endl;
for(int i=0;i<ans[0].size();i++) {
printf("%d%c",ans[0][i],i==ans[0].size()-1?'\n':' ');
}
cout << ans[1].size() << endl;
for(int i=0;i<ans[1].size();i++) {
printf("%d%c",ans[1][i],i==ans[1].size()-1?'\n':' ');
}
}
else {
cout << -1 << endl;
}
}