随笔分类 -  2-SAT

HDU 4751 2-sat模板题
摘要：Divide GroupsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 161Accepted Submission(s): 62 Problem DescriptionThis year is the 60th anniversary of NJUST, and to make the celebration more colorful, Tom200 is going to invite distinguished alumnus ba 阅读全文
posted @ 2013-09-21 19:49 线性无关 阅读(184) 评论(1) 推荐(1)
HDU 4421 2-SAT
摘要：Bit MagicProblem DescriptionYesterday, my teacher taught me about bit operators: and (&), or (|), xor (^). I generated a number table a[N], and wrote a program to calculate the matrix table b[N][N] using three kinds of bit operator. I thought my achievement would get teacher's attention.The 阅读全文
posted @ 2013-09-05 22:05 线性无关 阅读(151) 评论(0) 推荐(0)
HDU 4115 2-SAT
摘要：Eliminate the ConflictProblem DescriptionConflicts are everywhere in the world, from the young to the elderly, from families to countries. Conflicts cause quarrels, fights or even wars. How wonderful the world will be if all conflicts can be eliminated.Edward contributes his lifetime to invent a  阅读全文
posted @ 2013-09-05 14:01 线性无关 阅读(123) 评论(0) 推荐(0)
POJ 2723 二分+2-SAT
摘要：Get Luffy OutTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 6910Accepted: 2638DescriptionRatish 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 secret plac 阅读全文
posted @ 2013-09-05 11:23 线性无关 阅读(129) 评论(0) 推荐(0)
HDU 3715 二分+2-SAT
摘要：Go DeeperProblem DescriptionHere is a procedure's pseudocode:go(int dep, int n, int m)beginoutput the value of dep.if dep #include#include#include#includeusingnamespacestd;constintmaxn=30000;constintmaxm=9000000;inthead[maxn],low[maxn],dfn[maxn],tol,Stack[maxn],instack[maxn],belong[maxn],indexx, 阅读全文
posted @ 2013-09-05 00:01 线性无关 阅读(113) 评论(0) 推荐(0)
HDU 1814 2-sat 输出最小方案
摘要：Peaceful CommissionTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1315Accepted Submission(s): 313Problem DescriptionThe Public Peace Commission should be legislated in Parliament of The Democratic Republic of Byteland according to The Very Import 阅读全文
posted @ 2013-09-04 20:39 线性无关 阅读(212) 评论(0) 推荐(0)
POJ 3648 2-SAT 输出方案
摘要：WeddingTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7264Accepted: 2215Special JudgeDescriptionUp 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 an e.. 阅读全文
posted @ 2013-09-04 15:26 线性无关 阅读(140) 评论(0) 推荐(0)
POJ 3207 2-SAT
摘要：Ikki's Story IV - Panda's TrickTime Limit: 1000MSMemory Limit: 131072KTotal Submissions: 7124Accepted: 2648Descriptionliympanda, 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 阅读全文
posted @ 2013-09-04 11:18 线性无关 阅读(99) 评论(0) 推荐(0)
POJ 3678 2-SAT
摘要：Katu PuzzleTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6870Accepted: 2524DescriptionKatu 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). One Katu is solvable if one can find eac.. 阅读全文
posted @ 2013-09-04 10:25 线性无关 阅读(104) 评论(0) 推荐(0)
POJ 3683 2-SAT 输出方案
摘要：Priest John's Busiest DayTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 7216Accepted: 2464Special JudgeDescriptionJohn is the only priest in his town. September 1st is the John's busiest day in a year because there is an old legend in the town that the couple who get married on tha 阅读全文
posted @ 2013-09-04 00:14 线性无关 阅读(157) 评论(0) 推荐(0)
POJ 2296 二分+2-SAT
摘要：Map LabelerTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1408Accepted: 456DescriptionMap generation is a difficult task in cartography. A vital part of such task is automatic labeling of the cities in a map; where for each city there is text label to be attached to its location, so that.. 阅读全文
posted @ 2013-09-03 21:54 线性无关 阅读(104) 评论(0) 推荐(0)
POJ 3905 简单2-SAT
摘要：Perfect ElectionTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 491Accepted: 254DescriptionIn a country (my memory fails to say which), the candidates {1, 2 ..., N} are running in the parliamentary election. An opinion poll asks the question "For any two candidates of your own choice, 阅读全文
posted @ 2013-09-03 07:44 线性无关 阅读(127) 评论(0) 推荐(0)
HDU 1815 二分+2SAT
摘要：Building roadsTime Limit: 10000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 445Accepted Submission(s): 114Problem DescriptionFarmer 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 阅读全文
posted @ 2013-09-03 06:52 线性无关 阅读(128) 评论(0) 推荐(0)
ZOJ 3717 二分+2-sat判定
摘要：BalloonTime Limit:3 Seconds Memory Limit:65536 KB Special JudgeThe weather is wonderful today.Gaotakes a walk in the garden with his girlfriend. His girlfriend likes balloons so much, so that she wants to fly some balloons (not kites!) in the garden.We can regard the garden as a three-dimensional s. 阅读全文
posted @ 2013-09-03 02:32 线性无关 阅读(138) 评论(0) 推荐(0)
HDU 3622 二分+2-SAT
摘要：Bomb GameTime Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3033Accepted Submission(s): 1023Problem DescriptionRobbie is playing an interesting computer game. The game field is an unbounded 2-dimensional region. There are N rounds in the game. At eac 阅读全文
posted @ 2013-09-03 02:02 线性无关 阅读(143) 评论(1) 推荐(0)
HDU 1824 2-SAT
摘要：Let's go homeProblem Description小时候，乡愁是一枚小小的邮票，我在这头，母亲在那头。—— 余光中集训是辛苦的，道路是坎坷的，休息还是必须的。经过一段时间的训练，lcy决定让大家回家放松一下，但是训练还是得照常进行，lcy想出了如下回家规定，每一个队（三人一队）或者队长留下或者其余两名队员同时留下；每一对队员，如果队员A留下，则队员B必须回家休息下，或者B留下，A回家。由于今年集训队人数突破往年同期最高记录，管理难度相当大，lcy也不知道自己的决定是否可行，所以这个难题就交给你了，呵呵，好处嘛~，免费**漂流一日。Input第一行有两个整数，T和M，1#i 阅读全文
posted @ 2013-09-03 00:27 线性无关 阅读(123) 评论(0) 推荐(0)
HDU 3062 2-SAT入门题
摘要：Party Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3422Accepted Submission(s): 1101Problem Description有n对夫妻被邀请参加一个聚会，因为场地的问题，每对夫妻中只有1人可以列席。在2n 个人中，某些人之间有着很大的矛盾（当然夫妻之间是没有矛盾的），有矛盾的2个人是不会同时出现在聚会上的。有没有可能会有n 个人同时列席？Inputn： 表示有n对夫妻被邀请 (n#include#inc. 阅读全文
posted @ 2013-09-01 04:26 线性无关 阅读(134) 评论(0) 推荐(0)