![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
强连通及其拓展
Dust_Heart
这个作者很懒,什么都没留下…
展开
-
HDOJ 1815 Building roads(2-sat简介)
2-sat问题又称稳定党员问题,下面将对2-sat问题进行简要的概述 问题引入:一共有2n个人,分成n个帮派,每个帮派两个人,有一天这些帮派要进行一个重要会议,要求每个帮派只能派出一个人来参加会议,每个帮派之间还有相对矛盾的条件,比如帮派A中的一个人与帮派B中的某一个人不能同时参加会议,问满足这种条件的前提下是否能够有n个人参加会议。 问题分析:同一个帮派的两个人不能同时参加会议。...原创 2017-06-03 12:28:30 · 369 阅读 · 2 评论 -
POJ 3114 Countries in War
Countries in War Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3955 Accepted: 1135 Description In the year 2050, after differen原创 2017-04-02 23:33:01 · 219 阅读 · 0 评论 -
POJ 2186 Popular Cows
Popular Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 32921 Accepted: 13413 Description Every cow's dream is to become the m原创 2017-04-02 23:30:03 · 216 阅读 · 0 评论 -
HDOJ 3072 Intelligence System
Intelligence System Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2655 Accepted Submission(s): 1144 Problem Description After a原创 2017-04-02 23:27:04 · 222 阅读 · 0 评论 -
HDOJ 3861 The King’s Problem
The King’s Problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2853 Accepted Submission(s): 1017 Problem Description In the Ki原创 2017-04-02 23:23:29 · 260 阅读 · 0 评论 -
HDOJ 2767 Proving Equivalences
Proving Equivalences Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6594 Accepted Submission(s): 2280 Problem Description Conside原创 2017-04-02 23:17:17 · 171 阅读 · 0 评论 -
HDOJ 3639 Hawk-and-Chicken
Hawk-and-Chicken Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3081 Accepted Submission(s): 954 Problem Description Kids in kind原创 2017-04-02 23:14:51 · 292 阅读 · 0 评论 -
HDOJ 1827 Summer Holiday
Summer Holiday Time Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3540 Accepted Submission(s): 1617 Problem Description To see a Wor原创 2017-04-02 22:59:22 · 273 阅读 · 0 评论 -
2017 Multi-University Training Contest 1 && HDOJ 6038 Function 【强连通找环】
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原创 2017-07-25 21:58:26 · 406 阅读 · 0 评论