HDU6863 Isomorphic Strings

链接

HDU6863

思路

做法很多，哈希、KMP、最小表示法都可以。

其实都是枚举所有因子然后暴力匹配。比如用KMP的话就把第一个串复制一遍，这样里面就有了所有的循环同构，然后对原串的每一段求出 next 数组去KMP，如果没出现就说明该分割不可行。

代码

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/priority_queue.hpp>
//#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
//typedef gp_hash_table<int, int> hashmap;
//typedef tree<pii, null_type, std::less<pii>, splay_tree_tag, tree_order_statistics_node_update> splaytree;
//typedef tree<pii, null_type, std::less<pii>, rb_tree_tag, tree_order_statistics_node_update> rbtree;
//typedef __gnu_pbds::priority_queue<int, std::greater<int>, __gnu_pbds::binary_heap_tag> binheap;
//typedef __gnu_pbds::priority_queue<int, std::greater<int>, __gnu_pbds::pairing_heap_tag> pairingheap;

template <typename T>
inline void read(T &x)
{
    T data = 0, f = 1;
    char ch = getchar();
    while (!isdigit(ch))
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (isdigit(ch))
    {
        data = (data << 3) + (data << 1) + ch - '0';
        ch = getchar();
    }
    x = f * data;
}
template <typename T, typename... Args>
inline void read(T &t, Args &...args)
{
    read(t);
    read(args...);
}

//mt19937 rnd(time(0));
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const int maxn = 1e7 + 9;
const ll mod = 998244353;

int n, g, k;
char str[maxn], t[maxn];
int cnt[30], nxt[maxn];
void init(char s[], int len) // from 0
{
    int i = 0, j = -1;
    nxt[0] = -1;
    while (i < len)
    {
        if (j == -1 || s[i] == s[j])
            nxt[++i] = ++j;
        else
            j = nxt[j];
    }
}
bool kmp(char s[], int len)
{
    int i = 0, j = 0;
    while (i < 2 * len)
    {
        if (j == -1 || t[i] == s[j])
            i++, j++;
        else
            j = nxt[j];
        if (j == len)
            return true;
    }
    return false;
}
bool solve(int len)
{
    if (len == n)
        return false;
    for (int i = 1; i <= len; ++i)
    {
        t[i] = str[i];
        t[i + len] = str[i];
    }
    for (int i = 1; i <= n; i += len)
    {
        init(str + i, len);
        if (!kmp(str + i, len))
            return false;
    }
    return true;
}
int main(int argc, char const *argv[])
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d%s", &n, str + 1);
        if (n == 1)
        {
            puts("No");
            continue;
        }
        memset(cnt, 0, sizeof(cnt));
        for (int i = 1; i <= n; ++i)
            cnt[str[i] - 'a']++;
        g = 0;
        for (int i = 0; i < 26; ++i)
            g = __gcd(g, cnt[i]);
        bool flag = false;
        for (k = 1; k * k <= n; ++k)
        {
            if (n % k)
                continue;
            if (g % k == 0)
            {
                if (solve(n / k))
                {
                    flag = true;
                    break;
                }
            }
            if (g % (n / k) == 0)
            {
                if (solve(k))
                {
                    flag = true;
                    break;
                }
            }
        }
        puts(flag ? "Yes" : "No");
    }
    return 0;
}