Submission #4064658

---

Source Code Expand

#include<map>
#include<set>
#include<bitset>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<chrono>
#include<stack>
#include<fstream>
#include<list>
#include<complex>
#define REP(i,x,y) for(ll i=x;i<=y;i++)
#define SIZE(a) ll(a.size())
#define vll vector<ll> 
#define MEMSET(a, n, m) for(ll i=0;i<=n;i++) a[i] = m
#define BIT(n) (ll(1)<<n)
#define UNIQUE(v) v.erase(unique(v.begin(),v.end()),v.end()) 
#define UNIQUE_ARRAY(a,x) unique(a + 1, a + x + 1) - a - 1
#define SORT(a,n) sort(a+1,a+n+1)
#define SORT_O(a,n,order) sort(a+1,a+n+1,order)
#define PER(i,y,x) for(ll i=y;i>=x;i--)
typedef long long ll;
using namespace std;


struct point
{
	long long i; long long j;
};


ll const MAX = 200005;
string s;
ll memo[MAX][30] = {};

int main() {
	ll n;
	cin >> s;
	n = s.size();
	REP(i, 1, n) {
		char cur = s[i - 1];
		REP(j, 0, 25) {
			memo[i][j] = memo[i - 1][j];
		}
		memo[i][cur - 'a']++;
	}
	ll ans = 0;
	REP(i, 1, n) {
		ll cur = s[i - 1] - 'a';
		ans += i - 1 - memo[i - 1][cur];
	}
	cout << ans + 1 << endl;
}

Submission Info

Judge Result