摘要：思路：做法与9*9的一样。只不过是变量。#include#include#include#include#include#include#include#include#include#include#include#define pb push_back#define mp make_pair#define Maxn 4100#define Maxm 200010#define Y 1100#define LL __int645rssss#define Abs(x) ((x)>0?(x):(-x))#define lson(x) (x='0') g[i][j+1... 阅读全文

摘要：思路：裸的DLX解数独。关键是建图，感觉还不如写个dfs直接，DLX写这个的代码很烦。#include#include#include#include#include#include#include#include#include#include#include#define pb push_back#define mp make_pair#define Maxn 400010#define Maxm 200010#define LL __int64#define Abs(x) ((x)>0?(x):(-x))#define lson(x) (x<<1)#define rso 阅读全文

摘要：思路：把每个点拆成（d+1）*n列，行数为可拆分区间数。对所有的有i号点拆分出来的行都要建一条该行到i列的边，那么就能确保有i号点拆出来的行只能选择一行。#include#include#include#include#include#include#include#include#include#include#define pb push_back#define mp make_pair#define Maxn 1010#define Maxm 80002#define LL __int64#define Abs(x) ((x)>0?(x):(-x))#define lson(x) 阅读全文

摘要：思路：裸的DLX重复覆盖#include#include#include#include#include#include#include#include#include#include#define pb push_back#define mp make_pair#define Maxn 51#define Maxm 80002#define LL __int64#define Abs(x) ((x)>0?(x):(-x))#define lson(x) (xK) return false; if(R[0]==0) return true; int i,j,temp,c; t... 阅读全文

摘要：思路：二分枚举建边，用DLX判断是否满足。#include#include#include#include#include#include#include#include#include#include#define clr(x,y) memset(x,y,sizeof(x))#define pb push_back#define mp make_pair#define Maxn 20010#define LL __int64#define Abs(x) ((x)>0?(x):(-x))#define lson(x) (x m) return false; if (R[0] == 0) 阅读全文

摘要：#include#include#include#include#include#include#include#include#include#include#define pb push_back#define mp make_pair#define Maxn 1000010#define Maxm 80002#define LL __int64#define Abs(x) ((x)>0?(x):(-x))#define lson(x) (x<<1)#define rson(x) (x<<1|1)#define inf 100000#define lowbit 阅读全文