[DLX] IBM Ponder This May 2017 Letter gaps

裸的dfs随便剪剪就能跑出20多一点
这就启发我们直接上Dancing Link
列分别表示每个位置以及某个字符是否放了
行就枚举a-z和空格放在哪

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;

const int N=205;
const int M=200005;

int ncnt;
int L[M],R[M],U[M],D[M],row[M],col[M];
int size[N];
int ans[N],pnt;

inline void del(int c){
  L[R[c]]=L[c]; R[L[c]]=R[c];
  for (int i=D[c];i!=c;i=D[i])
    for (int j=R[i];j!=i;j=R[j])
      U[D[j]]=U[j],D[U[j]]=D[j],size[col[j]]--;
}
inline void rec(int c){
  L[R[c]]=R[L[c]]=c;
  for (int i=U[c];i!=c;i=U[i])
    for (int j=L[i];j!=i;j=L[j])
      U[D[j]]=D[U[j]]=j,size[col[j]]++;
}

inline bool dance(){
  if (R[0]==0){
    //printf("%d ",pnt); sort(ans+1,ans+pnt+1);
    //for (int i=1;i<=pnt;i++) printf("%d ",ans[i]); printf("\n");
    return 1;
  }
  int minv=1<<30,c=0;
  for (int i=R[0];i;i=R[i]) if (size[i]<minv) minv=size[i],c=i;
  del(c);
  for (int i=D[c];i!=c;i=D[i]){
    ans[++pnt]=row[i];
    for (int j=R[i];j!=i;j=R[j]) del(col[j]);
    if (dance()) return 1;
    for (int j=L[i];j!=i;j=L[j]) rec(col[j]);
    ans[pnt--]=0;
  }
  rec(c);
  return 0;
}

int newr;
int _x[10005],_y[10005];

inline void addline(int a,int b,int c){
  for (int i=1;i<=3;i++) L[ncnt+i]=ncnt+i-1,R[ncnt+i]=ncnt+i+1;
  L[ncnt+1]=ncnt+3; R[ncnt+3]=ncnt+1;
  U[++ncnt]=U[a]; D[ncnt]=a; U[D[ncnt]]=ncnt; D[U[ncnt]]=ncnt; col[ncnt]=a; row[ncnt]=newr; size[a]++;
  U[++ncnt]=U[b]; D[ncnt]=b; U[D[ncnt]]=ncnt; D[U[ncnt]]=ncnt; col[ncnt]=b; row[ncnt]=newr; size[b]++;
  U[++ncnt]=U[c]; D[ncnt]=c; U[D[ncnt]]=ncnt; D[U[ncnt]]=ncnt; col[ncnt]=c; row[ncnt]=newr; size[c]++;
}
inline void addline(int a,int b){
  for (int i=1;i<=2;i++) L[ncnt+i]=ncnt+i-1,R[ncnt+i]=ncnt+i+1;
  L[ncnt+1]=ncnt+2; R[ncnt+2]=ncnt+1;
  U[++ncnt]=U[a]; D[ncnt]=a; U[D[ncnt]]=ncnt; D[U[ncnt]]=ncnt; col[ncnt]=a; row[ncnt]=newr; size[a]++;
  U[++ncnt]=U[b]; D[ncnt]=b; U[D[ncnt]]=ncnt; D[U[ncnt]]=ncnt; col[ncnt]=b; row[ncnt]=newr; size[b]++;
}

int n,m;
char s[N];

int main(){
  char c; bool first=1;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  scanf("%d",&n); m=n<<1|1;
  for (int i=1;i<=m+n+1;i++) L[i]=i-1,R[i]=i+1,size[i]=0,U[i]=D[i]=i;
  ncnt=m+n+1; 
  R[0]=1; L[0]=m+n+1; R[m+n+1]=0;
  for (int i=1;i<=n;i++)
    for (int j=1;j+i+1<=m;j++){
      ++newr; _x[newr]=i; _y[newr]=j;
      addline(j,j+i+1,m+i);
    }
  for (int j=1;j<=m;j++){
    ++newr; _x[newr]=n+1; _y[newr]=j;
    addline(j,m+n+1);
  }
  dance();
  for (int i=1;i<=pnt;i++)
    if (_x[ans[i]]<=n)
      s[_y[ans[i]]]=s[_y[ans[i]]+_x[ans[i]]+1]='A'+_x[ans[i]]-1;
    else
      s[_y[ans[i]]]='-';
  printf("%s\n",s+1);
  return 0;
}