Ositus

#include <algorithm>
#include <map>
#include <iostream>
#include <set>
#include <string> 


using namespace std;

unsigned int MAXTABLESIZE = 1e3;
long M = 1e9 + 7;
int n;

map<string, long long> lookupTable;

long long f(string s) {
    string substr, tail;
    long v = 0;
    if (s.size() <= 1) {
        return 1;
    } else if (s.size() == 2) {
        return 1 + (s[0] != s[1]);
    }
    if (lookupTable.count(s)) {
        return lookupTable[s];
    }
    // int i = find(s.rend()-1, s.rbegin(), s[s.size()-1]);

    for (unsigned int i=1; i<=s.size(); i++) {
        substr = s.substr(0, s.size()-i), tail = s.substr(s.size()-i, i);

        if (set<char>(tail.begin(), tail.end()).size() != tail.size())
            break;
        v += f(substr);
        v %= M;
    }
    if (lookupTable.size() < MAXTABLESIZE)
        lookupTable[s] = v;
    return v;

}


int main() {
    string s;

    cin >> s;
    n = s.size();
    cout << f(s);

}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 2, 3

Verdict: ACCEPTED

Test 6

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: RUNTIME ERROR