Submission #1540661

---

Source Code Expand

#include <bits/stdc++.h>

#define F first
#define S second
#define x1 privet1
#define x2 privet2
#define y1 privet3
#define y2 privet4
#define left privet6
#define prev ppppp

using namespace std;
typedef long long ll;

const int max_n = 200011, log_n = 32, max_m = 111, mod = 1000000007, inf = 1000111222;

string s;
int a[33][max_n];
ll dp[max_n];

int main() {
    //freopen("input.txt", "r", stdin);
    cin >> s;
    for (int i =0; i < s.length(); ++i) {
        a[s[i] - 'a'][i] = 1;
        if (i)
        for (int q = 0; q < 33; ++q) {
            a[q][i] += a[q][i - 1];
        }
    }
    dp[0] = 1;
    for (int i = 1; i < s.length(); ++i) {
        dp[i] = dp[i - 1] + i + 1 - a[s[i] - 'a'][i];
    }
    cout << dp[s.length() - 1] << endl;
    return 0;
}

Submission Info

Judge Result