2-SAT DFS暴力求最小字典序的模板(Peaceful Commission)
来源:互联网 发布:php 在线人数统计 编辑:程序博客网 时间:2024/06/06 04:17
Peaceful Commission
Time Limit : 10000/5000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
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.
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 21 32 4
Sample Output
145
// 以最裸最经典的和平委员会这题为例
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <cmath>#include <cstdlib>#include <queue>#include <vector>#include <algorithm>using namespace std;const int MAX = 8000 + 100;int top;int n, m;vector<int>map[MAX * 2];bool mark[MAX * 2];int S[MAX * 2];bool dfs(int x) {if (mark[x ^ 1])return false;if (mark[x])return true;mark[x] = true;S[top++] = x;for (int i = 0; i < map[x].size(); i++){if (!dfs(map[x][i]))return false;}return true;}bool two_sat(){memset(mark, 0, sizeof(mark));for (int i = 0; i < n; i += 2){if (!mark[i] && !mark[i ^ 1]){top = 0;if (!dfs(i)){while (top)mark[S[--top]] = false;if (!dfs(i ^ 1))return false;}}}return true;}int main(){while (scanf("%d%d", &n, &m) != EOF){int a, b;n = n * 2;for (int i = 0; i <= n; i++)map[i].clear();for (int i = 0; i < m; i++){scanf("%d%d", &a, &b);a--;b--;map[a].push_back(b ^ 1);map[b].push_back(a ^ 1);}if (two_sat()){for (int i = 0; i < n; i += 2){if (mark[i])printf("%d\n", i + 1);elseprintf("%d\n", (i ^ 1) + 1);}}elseprintf("NIE\n");}return 0;}
阅读全文
0 0
- 2-SAT DFS暴力求最小字典序的模板(Peaceful Commission)
- [2-SAT 字典序最小解 暴力dfs 模板题] HDU 1814 Peaceful Commission
- HDOJ 1814 - Peaceful Commission 输出字典序最小的2-sat方案...暴力2-sat
- HDU 1814 Peaceful Commission(2-SAT:最小字典序)
- HDU 1814Peaceful Commission (最小字典序 2-SAT)
- HDU 1814 Peaceful Commission(2-sat 模板题输出最小字典序解决方案)
- HDU1814.Peaceful Commission——2-sat输出字典序最小的解
- hdu 1814 Peaceful Commission(2-SAT 输出字典序最小的解)
- HDU 1814 Peaceful Commission 2-sat(字典序最小的解)
- hdoj 1814 Peaceful Commission 【2-sat暴力染色 求解字典序最小解】
- hdu 1814 Peaceful Commission (2-sat 输出字典序最小路径)
- Hdu 1814 Peaceful Commission(2-sat+输出字典序最小方案)
- hdu 1814 Peaceful Commission 2-sat 按字典序输出
- 【2-SAT字典序最小解】HDU1814[Peaceful Commission]题解
- HDU 1814:Peaceful Commission(2-SAT的字典序最小解)
- [hdu 1814] Peaceful Commission(2-sat求最小序列可行解)
- HDU 1814 Peaceful Commission (2-sat暴力染色)
- hdu1814 Peaceful Commission,2-sat
- 阿里云9块9 LAMP&JAVA运行环境搭建
- Python环境搭建
- 树莓派安装QT5+OPENCV-2.4.9学习笔记
- poj 3449 判断许多个几何图形是否相交
- MFC子窗口和父窗口(SetParent,SetOwner)
- 2-SAT DFS暴力求最小字典序的模板(Peaceful Commission)
- [leetcode]43. Multiply Strings@Java
- 电子元器件如何检测和筛选
- js类型转换原则
- Hive和Hbase的数据整合联系
- elasticsearch快速入门方法以及使用方法示例
- USB设备开发---- usb描述符概述
- 转载:C++中的extern "C"
- 微信公众号开发-接入指南