摘要:
//暴力DFS,求字典序最小的解,也是求字典序唯一的方法#include#include#includeusing namespace std;const int maxn=10000+10;struct Two... 阅读全文
摘要:
#include #include #include #include #include #include #define MAXN 2000+10#define MAXM 400000#define INF 1... 阅读全文
摘要:
DescriptionKatu Puzzle is presented as a directed graph G(V, E) with each edge e(a, b) labeled by a boolea... 阅读全文