Submission #1016942

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

int main() {
  string s;
  cin >> s;
  int len = s.length();
  int ans;
  switch (len) {
  case 1: 
    printf("0\n");
    return 0;
  case 2:
    if (s[0] == s[1]) {
      printf("50\n");
    } else {
      printf("48\n");
    }
    return 0;
  case 3:
    if (s[0] == s[2]) {
      printf("50\n");
    } else {
      ans = 25 + 48;
      printf("%d\n", ans);
    }
    return 0;
  }
  deque<bool> same(len/2);
  string sr = s;
  reverse(all(sr));
  int same_n = 0;
  rep (i, len/2) {
    if (s[i] == sr[i]) {
      same_n += 1;
    }
  }
  if (same_n == len/2) {
    ans = len/2 * 2 * 25;
    printf("%d\n", ans);
    return 0;
  } else if (same_n + 1 == len/2) {
    ans = len/2 * 2 * 25;
    ans -= 2;
    if (len % 2 == 1) {
      ans += 25;
    }
    printf("%d\n", ans);
    return 0;
  } else {
    ans = 25 * len;
    printf("%d\n", ans);
    return 0;
  }
  return 0;
}

Submission Info

Judge Result