Submission #1542933

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const long double pi = 3.141592653589793;

#define debug(x) cout << #x << " = " << (x) << endl;
#define rep(i, n) for(int i = 0;i < n;i++)
#define pb push_back
#define mp make_pair
#define mod 1000000007

//#define READ_FROM_FILE

int main() {
	ios::sync_with_stdio(false);
	#ifdef READ_FROM_FILE
    freopen("input.in","r",stdin);
 	freopen("output.out","w",stdout);
	#endif

	string s;cin>>s;
	int n = s.size();
	vector<vector<ll>> A(n, vector<ll>(26, 0));

	rep(i, s.size()) A[i][s[i]-'a'] = 1;

	for(int i = n-2;i >= 0;i--) {
		for(int j = 0;j < 26;j++) A[i][j] += A[i+1][j];
	}

	ll answer = 1;
	for(int i = 0;i < n;i++) {
		for(int j = 0;j < 26;j++)
			if(s[i]-'a' != j) answer += A[i][j];
	}

	cout<<answer<<endl;

	return 0;
}

Submission Info

Judge Result