【POJ 3740】 Easy Finding

【题目链接】

http://poj.org/problem?id=3740

【算法】

Dancing Links算法解精确覆盖问题

详见这篇文章 ： https://www.cnblogs.com/grenet/p/3145800.html

【代码】

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cerrno>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <limits>
#include <list>
#include <map>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <utility>
#include <vector>
#include <cwchar>
#include <cwctype>
#include <stack>
#include <limits.h>
using namespace std;
#define MAXN 10010

int n,m,i,j,val;

struct DancingLinks
{
        int n,m,size;
        int U[MAXN],D[MAXN],L[MAXN],R[MAXN],Row[MAXN],Col[MAXN];
        int H[MAXN],S[MAXN];
        inline void init(int _n,int _m)
        {
                n = _n;
                m = _m;
                for (i = ; i <= m; i++)
                {
                        S[i] = ;
                        U[i] = D[i] = i;
                        L[i] = i - ;
                        R[i] = i + ;
                }
                R[m] = ; L[] = m;
                size = m;
                for (i = ; i <= n; i++) H[i] = -;
        }
        inline void link(int r,int c)
        {
                size++;
                Row[size] = r;
                Col[size] = c;
                S[c]++;
                D[size] = D[c];
                U[D[c]] = size;
                U[size] = c;
                D[c] = size;
                if (H[r] < ) L[size] = R[size] = H[r] = size;
                else
                {
                        R[size] = R[H[r]];
                        L[R[H[r]]] = size;
                        L[size] = H[r];
                        R[H[r]] = size;
                }
        }
        inline void remove(int c)
        {
                int i,j;
                L[R[c]] = L[c];
                R[L[c]] = R[c];
                for (i = D[c]; i != c; i = D[i])
                {
                        for (j = R[i]; j != i; j = R[j])
                        {
                                U[D[j]] = U[j];
                                D[U[j]] = D[j];
                                S[Col[j]]--;
                        }
                }
        }
        inline void resume(int c)
        {
                int i,j;
                for (i = D[c]; i != c; i = D[i])
                {
                        for (j = R[i]; j != i; j = R[j])
                        {
                                D[U[j]] = j;
                                U[D[j]] = j;
                                S[Col[j]]++;
                        }
                }
                L[R[c]] = c;
                R[L[c]] = c;
        }
        inline bool solve()
        {
                int i,c;
                if (R[] == ) return true;
                c = R[];
                for (i = R[]; i; i = R[i])
                {
                        if (S[i] < S[c])
                                c = i;
                }
                remove(c);
                for (i = D[c]; i != c; i = D[i])
                {
                        for (j = R[i]; j != i; j = R[j])
                                remove(Col[j]);
                        if (solve()) return true;
                        for (j = R[i]; j != i; j = R[j])
                                resume(Col[j]);
                }
                resume(c);
                return false;
        }
} DLX;

int main()
{

        while (scanf("%d%d",&n,&m) != EOF)
        {
                DLX.init(n,m);
                for (i = ; i <= n; i++)
                {
                        for (j = ; j <= m; j++)
                        {
                                scanf("%d",&val);
                                if (val == ) DLX.link(i,j);
                        }
                }
                if (DLX.solve()) printf("Yes, I found it\n");
                else printf("It is impossible\n");
        }

        return ;

}