![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
2-SAT
olahiuj
我的女朋友不抽烟不喝酒不傲娇不化妆不存在
展开
-
bzoj1823 [JSOI2010]满汉全席 2-sat
Description 满汉全席是中国最丰盛的宴客菜肴,有许多种不同的材料透过满族或是汉族的料理方式,呈现在數量繁多的菜色之中。由于菜色众多而繁杂,只有极少數博学多闻技艺高超的厨师能够做出满汉全席,而能够烹饪出经过专家认证的满汉全席,也是中国厨师最大的荣誉之一。 世界满汉全席协会是由能够料理满汉全席的专家厨师们所组成,而他们之间还细分为许多不同等级的厨师。为了招收新进的厨师进入世界满汉全席协...原创 2018-05-03 11:53:10 · 125 阅读 · 0 评论 -
jzoj3782 [NOIP2014模拟8.17] 组队
Description 你的任务是将一群人分到两个队伍中,使得: 1、每个人都属于一个队伍。 2、每个队伍至少有一个人。 3、每个队伍的任意一个人都认识其他人。 4、两支队伍的人数尽可能接近。 这个任务可能有多组解,你可以输出任意一种。 注意:认识是单向的且没有传递性。 对于分值为 30%的数据,N 对于剩余分值为 70%的数据,N [评分标准] 该题采用捆绑测试点评原创 2018-02-03 19:31:39 · 278 阅读 · 0 评论 -
Ikki's Story IV - Panda's Trick_poj3207_2-sat
Description liympanda, one of Ikki’s friend, likes playing games with Ikki. Today after minesweeping with Ikki and winning so many times, he is tired of such easy games and wants to play another原创 2016-06-09 11:32:03 · 552 阅读 · 0 评论 -
Katu Puzzle_poj3678_2-sat
Description Katu Puzzle is presented as a directed graph G(V, E) with each edge e(a, b) labeled by a boolean operator op (one of AND, OR, XOR) and an integer c (0 ≤ c ≤ 1).(什么鬼名字O__O "…) One Ka转载 2016-06-09 00:04:45 · 485 阅读 · 0 评论 -
Get Luffy_poj2723_2-sat+二分
Description Ratish is a young man who always dreams of being a hero. One day his friend Luffy was caught by Pirate Arlong. Ratish set off at once to Arlong's island. When he got there, he found the s原创 2016-06-11 21:27:38 · 409 阅读 · 0 评论 -
Building Roads_poj2749_2-sat+二分
Description Farmer John's farm has N barns, and there are some cows that live in each barn. The cows like to drop around, so John wants to build some roads to connect these barns. If he builds转载 2016-06-10 19:59:29 · 433 阅读 · 0 评论 -
Peaceful Commission_hdu1814_2-sat
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原创 2016-06-10 10:50:09 · 521 阅读 · 0 评论 -
Wedding_poj3648_2-sat
Description Up to thirty couples will attend a wedding feast, at which they will be seated on either side of a long table. The bride and groom sit at one end, opposite each other, and the bride wears原创 2016-06-14 18:01:34 · 616 阅读 · 0 评论 -
bzoj1997 [Hnoi2010]Planar 2-SAT
Description 若能将无向图G=(V,E)画在平面上使得任意两条无重合顶点的边不相交,则称G是平面图。判定一个图是否为平面图的问题是图论中的一个重要问题。现在假设你要判定的是一类特殊的图,图中存在一个包含所有顶点的环,即存在哈密顿回路。 Solution 考虑把哈密顿路径画成一个圈,那么剩下的路径要么在圆外要么在圆内。问题变成求是否存在一种方案使得所有边不相交 这是一个...原创 2018-07-01 21:52:40 · 276 阅读 · 0 评论