Peaceful Commission
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3793 Accepted Submission(s): 1274
Problem Description
The Public Peace Commission should be legislated in Parliament of The Democratic Republic of Byteland according to The Very Important Law. Unfortunately one of the obstacles is the fact that some deputies do not get on with some others.
The Commission has to fulfill the following conditions:
1.Each party has exactly one representative in the Commission,
2.If two deputies do not like each other, they cannot both belong to the Commission.
Each party has exactly two deputies in the Parliament. All of them are numbered from 1 to 2n. Deputies with numbers 2i-1 and 2i belong to the i-th party .
Task
Write a program, which:
1.reads from the text file SPO.IN the number of parties and the pairs of deputies that are not on friendly terms,
2.decides whether it is possible to establish the Commission, and if so, proposes the list of members,
3.writes the result in the text file SPO.OUT.
The Commission has to fulfill the following conditions:
1.Each party has exactly one representative in the Commission,
2.If two deputies do not like each other, they cannot both belong to the Commission.
Each party has exactly two deputies in the Parliament. All of them are numbered from 1 to 2n. Deputies with numbers 2i-1 and 2i belong to the i-th party .
Task
Write a program, which:
1.reads from the text file SPO.IN the number of parties and the pairs of deputies that are not on friendly terms,
2.decides whether it is possible to establish the Commission, and if so, proposes the list of members,
3.writes the result in the text file SPO.OUT.
Input
In the first line of the text file SPO.IN there are two non-negative integers n and m. They denote respectively: the number of parties, 1 <= n <= 8000, and the number of pairs of deputies, who do not like each other, 0 <= m <=2 0000. In each of the following m lines there is written one pair of integers a and b, 1 <= a < b <= 2n, separated by a single space. It means that the deputies a and b do not like each other.
There are multiple test cases. Process to end of file.
There are multiple test cases. Process to end of file.
Output
The text file SPO.OUT should contain one word NIE (means NO in Polish), if the setting up of the Commission is impossible. In case when setting up of the Commission is possible the file SPO.OUT should contain n integers from the interval from 1 to 2n, written in the ascending order, indicating numbers of deputies who can form the Commission. Each of these numbers should be written in a separate line. If the Commission can be formed in various ways, your program may write mininum number sequence.
Sample Input
3 2 1 3 2 4
Sample Output
1 4 5
Source
2-SAT问题,入门题。
把每个代表当做图论中的一个点,若有不能一起出现的点A B,设和他们同党的点为A',B',连边A->B',B->A'。之后dfs,若A可选,则A'不可选,A的后继节点必选。如此选择直到同一个强连通分量的点被选完。题目要求序列字典序最小,则从序号小的点开始dfs。
#include <cstdio>
#include <iostream>
#include <string.h>
#include <stack>
#include <vector>
#include <queue>
using namespace std;
const int maxn=16005;
int color[maxn],dfn[maxn],num,flag;
vector<int> v[maxn];
bool dfs(int now) {
if (color[now]==2) return false;
if (color[now]==1) return true;
color[now]=1;
color[now^1]=2;
dfn[++num]=now;
int size=v[now].size();
for (int i=0;i<size;i++) {
int to=v[now][i];
if (!dfs(to)) return false;
}
return true;
}
int main() {
int n,m,i,j,x,y,a,b;
while (scanf("%d%d",&n,&m)!=EOF) {
for (i=1;i<=m;i++) {
scanf("%d%d",&x,&y);
x--;y--;
v[x].push_back(y^1);
v[y].push_back(x^1);
}
memset(color,0,sizeof(color));
int flag=1;
for (i=0;i<n;i++) {
if (!color[i*2]) {
num=0;
if (!dfs(i*2)) {
for (j=1;j<=num;j++)
color[dfn[j]]=color[dfn[j]^1]=0;
if (!dfs(i*2+1)) {
flag=0;
break;
}
}
}
}
if (flag) {
for (i=0;i<n;i++) {
if (color[i*2]==1) printf("%d\n",i*2+1);
else printf("%d\n",i*2+2);
}
} else printf("NIE\n");
for (i=0;i<n*2;i++) v[i].clear();
}
return 0;
}