风骨散人 - 博客园

摘要： Problem DescriptionConflicts are everywhere in the world, from the young to the elderly, from families to ... 阅读全文

posted @ 2019-11-17 09:54 风骨散人阅读(108) 评论(0) 推荐(0)

摘要： Peaceful CommissionTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Tot... 阅读全文

posted @ 2019-11-17 09:51 风骨散人阅读(113) 评论(0) 推荐(0)

摘要： #include #include #include #include #include #include #define MAXN 40000+10#define MAXM 200000+10#define I... 阅读全文

posted @ 2019-11-17 09:44 风骨散人阅读(114) 评论(0) 推荐(0)

摘要： Planet Krypton is about to explode. The inhabitants of this planet have to leave the planet immediately. B... 阅读全文

posted @ 2019-11-17 09:42 风骨散人阅读(118) 评论(0) 推荐(0)

摘要： Perfect ElectionTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 964 Accepted: 43... 阅读全文

posted @ 2019-11-17 09:23 风骨散人阅读(109) 评论(0) 推荐(0)

摘要： //暴力DFS，求字典序最小的解，也是求字典序唯一的方法#include#include#includeusing namespace std;const int maxn=10000+10;struct Two... 阅读全文

posted @ 2019-11-15 22:02 风骨散人阅读(149) 评论(0) 推荐(0)

摘要： #include #include #include #include #include #include #define MAXN 2000+10#define MAXM 400000#define INF 1... 阅读全文

posted @ 2019-11-15 21:48 风骨散人阅读(133) 评论(0) 推荐(0)

摘要： DescriptionKatu Puzzle is presented as a directed graph G(V, E) with each edge e(a, b) labeled by a boolea... 阅读全文

posted @ 2019-11-15 21:46 风骨散人阅读(116) 评论(0) 推荐(0)

摘要：问题描述：现有一个由N个布尔值组成的序列A，给出一些限制关系，比如A[x]AND A[y]=0、A[x] OR A[y] OR A[z]=1等，要确定A[0..N-1]的值，使得其满足所有限制关系。这个称为SAT... 阅读全文

posted @ 2019-11-13 22:13 风骨散人阅读(480) 评论(0) 推荐(0)

摘要： Problem DescriptionGiven a rectangle frame of size n×m. Initially, the frame is strewn with n×m square blo... 阅读全文

posted @ 2019-11-12 20:46 风骨散人阅读(97) 评论(0) 推荐(0)

CM_Lunatic