Submission #1540579

---

Source Code Expand

//Vanjape Rajas Mangesh
#include<bits/stdc++.h>

using namespace std;

typedef pair<int,int>   II;
typedef vector< II >      VII;
typedef vector<int>     VI;
typedef vector< VI > 	VVI;
typedef long long int 	LL;

#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(),a.end()
#define SET(a,b) memset(a,b,sizeof(a))

#define si(n) scanf("%d",&n)
#define dout(n) printf("%d\n",n)
#define sll(n) scanf("%lld",&n)
#define lldout(n) printf("%lld\n",n)
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)

#define TRACE

#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
	cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
	const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif

//FILE *fin = freopen("in","r",stdin);
//FILE *fout = freopen("out","w",stdout);

const int N=200005;
string A;
int pref[N][26];

int main()
{
  cin>>A;
  int n=SZ(A);
  A="*"+A;
  for(int i=1;i<=n;i++){
    for(int j=0;j<26;j++)
      pref[i][j]=pref[i-1][j];
    pref[i][A[i]-'a']++;
  }
  LL ans=1;
  for(int i=1;i<=n;i++){
    ans=ans+(i-1-pref[i-1][A[i]-'a']);
  }
  cout<<ans<<"\n";
	return 0;
}

Submission Info

Judge Result