Submission #857183

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <cstdio>
#include <cstring>
using namespace std;

const int64_t M = 1000000007;

string w;
int n;

int gtbl[4001][4001];

bool check(int l, int r, int s)
{
    int sl = (r - l) / s;
    for (int ofs = 0; ofs < sl; ofs++) {
        for (int seg = 1; seg < s; seg++) {
            if (w[l + ofs] != w[l + seg * sl + ofs]) {
                return false;
            }
        }
    }
    return true;
}

bool is_good(int l, int r)
{
    auto &ret = gtbl[l][r];

    if (ret >= 0) return ret != 0;
    int L = r - l;

    ret = 0;
    for (int i = 2; i * i <= L; i++) {
        if (L % i == 0) continue;

        if (check(l, r, i)) return ret = 1;
        if (check(l, r, L / i)) return ret = 1;
    }

    return ret;
}

pair<int, int> tbl[4001][4001];

pair<int, int> solve(int l, int r)
{
    auto &ret = tbl[l][r];
    if (ret.first >= 0) return ret;

    ret.first = 0;
    ret.second = 0;

    if (r - l == 1) return ret = make_pair(1, 1);
    if (is_good(l, r)) return ret = make_pair(1, 1);

    for (int m = l + 1; m < r; m++) {
        auto ll = solve(l, m);
        auto rr = solve(m, l);

        if (ret.first == 0 || ret.first > ll.first + rr.first) {
            ret.first = ll.first + rr.first;
            ret.second = ((int64_t)ll.second * rr.second) % M;
        } else if (ret.first == ll.first + rr.first) {
            ret.second = (ret.second + ((int64_t)ll.second * rr.second)) % M;
        }
    }

    return ret;
}

int main()
{
    cin >> w;
    n = w.size();

    auto r =  solve(0, n);
    cout << r.first << endl;
    cout << r.second << endl;

    return 0;
}

Submission Info

Judge Result