Submission #1543130

---

Source Code Expand

#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;cnt<(l);++cnt)
#define iterate(cnt,b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); }
template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }

mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
        }
        template<typename IT> void in(IT begin, IT end) {
            for (auto it = begin; it != end; ++it) *this >> *it;
        }
    };
}
MaiScanner scanner;


class manacher {
public:
    vector<int> radius;

    manacher() {}
    manacher(const string& str) { make(str); }

    void make(const string& str) {
        // TODO:ざっくりとしか理解してないのでほぼコピペ
        // http://snuke.hatenablog.com/entry/2014/12/02/235837
        // abaaaa
        int length = str.size() * 2 - 1;
        radius.resize(length);

        int c = 0;
        for (int i = 0; i < length; i++) {
            int l = c - (i - c);
            if (i + radius[l] < c + radius[c]) {
                radius[i] = radius[l];
            }
            else {
                int j = c + radius[c] - i;
                for (; i - j >= 0 && i + j < length; j++) {
                    if (((i^j) & 1) == 1) continue;
                    if (str[(i - j) / 2] != str[(i + j) / 2]) break;
                }
                radius[i] = j;
                c = i;
            }
        }
    }

    inline int operator[](int idx) const {
        return radius[idx];
    }
    inline size_t size() const {
        return radius.size();
    }

    void print(const string& str) {
        for (int i = 0; i<str.size(); i++) {
            cout << str[i] << " ";
        }
        cout << endl;
        for (int i = 0; i<radius.size(); i++) {
            cout << radius[i];
        }
        cout << endl;
    }

    // 部分文字列str[left..right]が回文かどうか．計算量O(1)
    // left,rightに指定するインデックスは，基の文字列のインデックスを指定する．
    // TODO:実行チェック
    inline bool iskaibun(int left, int right) {
        return radius[left + right] > right - left;
    }

    // 回文の個数を求める．
    ll calc_num() {
        ll r = 0;
        for (auto it = radius.begin(); it < radius.end(); ++it, ++it) {
                r += (*it + 1ll) / 2ll;
            }
        for (auto it = radius.begin() + 1; it < radius.end(); ++it, ++it) {
            r += (*it) / 2ll;
        }
        return r;
    }
};

ll m, n, kei;


ll q, h, s, d;


string str;

int main() {

    cin >> str;

    n = str.size();

    // manacher man(str);

    ll cnt[30];
    fill(cnt,cnt+30,0);

    repeat(i, n) {
        char c = str[i] - 'a';
        cnt[c] += 1;
    }

    ll z = n*(n + 1) / 2;
    repeat(i, 30) {
        ll x = cnt[i];
        z -= x*(x + 1) / 2;
    }

    cout << z+1 << endl;

    return 0;
}

Submission Info

Judge Result