Card Game 【HDU - 3722】【Trie树优化+KM算法】

题目链接

---

  就是说，我们可以把一个卡片贴到前面一个卡片上面，当且仅当前面卡片的后缀是你的前缀，可以得到一些覆盖，现在我们有N个卡片，我们现在想知道怎样才能使得卡片的覆盖面积数量是最大的。

  首先，我们利用Trie字典树来进行优化查询的这部分，强行把原本，其中len代表的是字符串的长度，然后优化到了，这里就是一个离线的操作来进行优化了。

  然后是环与KM的关系了。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
#define Min3(a, b, c) min(a, min(b, c))
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 2e2 + 7;
int N, M;
char str[maxN][1002];
struct KM
{
    int n, mp[maxN][maxN], link_x[maxN], link_y[maxN];
    bool vis_x[maxN], vis_y[maxN];
    int que[maxN], top, fail, pre[maxN];
    ll hx[maxN], hy[maxN], slk[maxN];
    bool check(int i)
    {
        vis_x[i] = true;
        if(link_x[i])
        {
            que[fail++] = link_x[i];
            vis_y[link_x[i]] = true;
            return true;
        }
        while(i)
        {
            link_x[i] = pre[i];
            swap(i, link_y[pre[i]]);
        }
        return false;
    }
    void bfs(int S)
    {
        for(int i=1; i<=n; i++)
        {
            slk[i] = INF;
            vis_x[i] = vis_y[i] = false;
        }
        top = 0; fail = 1; que[0] = S;
        vis_y[S] = true;
        while(true)
        {
            ll d = 0;
            while(top < fail)
            {
                for(int i=1, j = que[top++]; i<=n; i++)
                {
                    if(!vis_x[i] && slk[i] >= (d = hx[i] + hy[j] - mp[i][j]))
                    {
                        pre[i] = j;
                        if(d) slk[i] = d;
                        else if(!check(i)) return;
                    }
                }
            }
            d = INF;
            for(int i=1; i<=n; i++)
            {
                if(!vis_x[i] && d > slk[i]) d = slk[i];
            }
            for(int i=1; i<=n; i++)
            {
                if(vis_x[i]) hx[i] += d;
                else slk[i] -= d;
                if(vis_y[i]) hy[i] -= d;
            }
            for(int i=1; i<=n; i++)
            {
                if(!vis_x[i] && !slk[i] && !check(i)) return;
            }
        }
    }
    void init()
    {
        for(int i=1; i<=n; i++)
        {
            link_x[i] = link_y[i] = 0;
            hy[i] = slk[i] = 0;
            vis_y[i] = false;
        }
        for(int i=1; i<=n; i++)
        {
            hx[i] = 0;
            for(int j=1; j<=n; j++)
            {
                if(hx[i] < mp[i][j]) hx[i] = mp[i][j];
            }
        }
    }
    void solve()
    {
        n = N;
        init();
        for(int i=1; i<=n; i++) bfs(i);
        ll ans = 0;
        for(int i=1; i<=n; i++) ans += hx[i] + hy[i];
        printf("%lld\n", ans);
    }
}km;
const int maxTrieSize = 2e4 + 7;
vector<int> vt[maxTrieSize];
struct Trie
{
    int tot, t[maxTrieSize][52];
    inline void init()
    {
        tot = 0;
        for(int i=0; i<52; i++) t[0][i] = 0;
    }
    inline void clear(int id)
    {
        for(int i=0; i<52; i++) t[id][i] = 0;
        vt[id].clear();
    }
    inline void Insert(char *s, int ith)
    {
        int len = (int)strlen(s), root = 0;
        for(int i=0, nex_ch; i<len; i++)
        {
            if(s[i] >= 'a' && s[i] <= 'z') nex_ch = s[i] - 'a';
            else nex_ch = s[i] - 'A' + 26;
            if(!t[root][nex_ch])
            {
                t[root][nex_ch] = ++tot;
                clear(tot);
            }
            root = t[root][nex_ch];
            vt[root].push_back(ith);
        }
    }
    inline void query(char *s, int ith)
    {
        int len = (int)strlen(s), root = 0;
        for(int i=0, nex_ch, vt_size; i<len; i++)
        {
            if(s[i] >= 'a' && s[i] <= 'z') nex_ch = s[i] - 'a';
            else nex_ch = s[i] - 'A' + 26;
            if(!t[root][nex_ch]) break;
            root = t[root][nex_ch];
            vt_size = (int)vt[root].size();
            for(int j=0; j<vt_size; j++)
            {
                km.mp[ith][vt[root][j]] = i + 1;
            }
        }
    }
} trie;
int main()
{
    while(scanf("%d", &N) != EOF)
    {
        for(int i=1; i<=N; i++) for(int j=1; j<=N; j++) km.mp[i][j] = 0;
        trie.init();
        for(int i=1; i<=N; i++)
        {
            scanf("%s", str[i]);
            trie.Insert(str[i], i);
        }
        for(int i=1, len; i<=N; i++)
        {
            len = (int)strlen(str[i]);
            reverse(str[i], str[i] + len);
            trie.query(str[i], i);
        }
        for(int i=1; i<=N; i++) km.mp[i][i] = 0;
        km.solve();
    }
    return 0;
}