Dust_heart的博客

2-sat问题又称稳定党员问题，下面将对2-sat问题进行简要的概述问题引入：一共有2n个人，分成n个帮派，每个帮派两个人，有一天这些帮派要进行一个重要会议，要求每个帮派只能派出一个人来参加会议，每个帮派之间还有相对矛盾的条件，比如帮派A中的一个人与帮派B中的某一个人不能同时参加会议，问满足这种条件的前提下是否能够有n个人参加会议。问题分析：同一个帮派的两个人不能同时参加会议。...

Countries in WarTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3955Accepted: 1135DescriptionIn the year 2050, after differen

Popular CowsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 32921Accepted: 13413DescriptionEvery cow's dream is to become the m

Intelligence SystemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2655    Accepted Submission(s): 1144Problem DescriptionAfter a

The King’s ProblemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2853    Accepted Submission(s): 1017Problem DescriptionIn the Ki

Proving EquivalencesTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6594    Accepted Submission(s): 2280Problem DescriptionConside

Hawk-and-ChickenTime Limit: 6000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3081    Accepted Submission(s): 954Problem DescriptionKids in kind

Summer HolidayTime Limit: 10000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3540    Accepted Submission(s): 1617Problem DescriptionTo see a Wor

2017 Multi-University Training Contest && HDOJ 6038 Function 【强连通找环】You are given a permutation a from 0 to n−1 and apermutation b from 0 to m−1.Define that the domain of function f is the set of integers from 0 to n−1, and the range of it is the set of