Problem p02937 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int>> mati;
typedef vector<vector<double>> matd;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef vector<pll> vpll;

#define FOR(i, x, y) for (ll i = (ll)x; i < (ll)y; ++i)
#define REP(i, y) FOR(i, 0, y)
#define RFOR(i, x, y) for (ll i = (ll)x; i >= (ll)y; --i)
#define RREP(i, x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back

inline void IN(void) { return; }

template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
  cin >> first;
  IN(rest...);
  return;
}

inline void OUT(void) {
  cout << "\n";
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
  cout << first << " ";
  OUT(rest...);
  return;
}

template <typename T> void vec_print(vector<T> VEC) {
  REP(i, VEC.size()) { cout << VEC[i] << " "; }
  cout << "\n";
};

template <typename T>
void mat_print(vector<vector<T>> MAT){
    REP(i, MAT.size()){REP(j, MAT[i].size()){cout << MAT[i][j] << " ";
}
cout << "\n";
}
}
;

template <typename CLASS1, typename CLASS2> class HOGE {
public:
  CLASS1 key;
  CLASS2 value;
  HOGE(void) { return; };
  HOGE(CLASS1 key, CLASS2 value) {
    this->key = key;
    this->value = value;
  };
  ~HOGE(void) { return; };

  void print(void) {
    cout << "key : " << key << ", value : " << value << "\n";
    return;
  };

  bool operator==(const HOGE &obj) { return (this->value == obj.value); };
  bool operator<(const HOGE &obj) { return (this->value < obj.value); };
  bool operator>(const HOGE &obj) { return (this->value > obj.value); };
};

template <typename CLASS1, typename CLASS2>
bool operator==(const HOGE<CLASS1, CLASS2> &hoge1,
                const HOGE<CLASS1, CLASS2> &hoge2) {
  return hoge1.value == hoge2.value;
};

template <typename CLASS1, typename CLASS2>
bool operator<(const HOGE<CLASS1, CLASS2> &hoge1,
               const HOGE<CLASS1, CLASS2> &hoge2) {
  return hoge1.value < hoge2.value;
};

template <typename CLASS1, typename CLASS2>
bool operator>(const HOGE<CLASS1, CLASS2> &hoge1,
               const HOGE<CLASS1, CLASS2> &hoge2) {
  return hoge1.value > hoge2.value;
};

constexpr int INF = (1 << 30);
constexpr ll INFLL = 1LL << 62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9) + 7);

int main() {
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after
              // std::cin)
  ios::sync_with_stdio(
      false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  string s, t;
  IN(s, t);

  map<ll, ll> mps, mpt;
  REP(i, s.size()) mps[s[i] - 'a']++;
  REP(i, t.size()) mpt[t[i] - 'a']++;

  bool flag = true;
  for (ll i = 0; i <= 'z' - 'a'; ++i) {
    if (mps[i] == 0 && mpt[i] > 0)
      flag = false;
  }

  if (!flag) {
    OUT(-1);
    return 0;
  }

  string s2 = s + s;
  vvll next_pos('z' - 'a' + 1, vll(s.size(), -1));

  REP(i, s2.size()) {
    ll pos = s2.size() - i - 1;
    REP(j, 'z' - 'a' + 1) {
      next_pos[j][pos % s.size()] = next_pos[j][(pos + 1) % s.size()];
    }
    next_pos[s2[pos] - 'a'][pos % s.size()] = pos % s.size();
  }

  // mat_print(next_pos);

  ll ans = 1;
  ll pos = 0;
  REP(i, t.size()) {
    ll next = next_pos[t[i] - 'a'][pos];
    if (next >= pos)
      ans += next - pos;
    else
      ans += next + (s.size() - pos);
    pos = next;
    if (i < t.size() - 1) {
      pos++;
      ans++;
    }
  }

  OUT(ans);
  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int>> mati;
typedef vector<vector<double>> matd;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef vector<pll> vpll;

#define FOR(i, x, y) for (ll i = (ll)x; i < (ll)y; ++i)
#define REP(i, y) FOR(i, 0, y)
#define RFOR(i, x, y) for (ll i = (ll)x; i >= (ll)y; --i)
#define RREP(i, x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back

inline void IN(void) { return; }

template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
  cin >> first;
  IN(rest...);
  return;
}

inline void OUT(void) {
  cout << "\n";
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
  cout << first << " ";
  OUT(rest...);
  return;
}

template <typename T> void vec_print(vector<T> VEC) {
  REP(i, VEC.size()) { cout << VEC[i] << " "; }
  cout << "\n";
};

template <typename T>
void mat_print(vector<vector<T>> MAT){
    REP(i, MAT.size()){REP(j, MAT[i].size()){cout << MAT[i][j] << " ";
}
cout << "\n";
}
}
;

template <typename CLASS1, typename CLASS2> class HOGE {
public:
  CLASS1 key;
  CLASS2 value;
  HOGE(void) { return; };
  HOGE(CLASS1 key, CLASS2 value) {
    this->key = key;
    this->value = value;
  };
  ~HOGE(void) { return; };

  void print(void) {
    cout << "key : " << key << ", value : " << value << "\n";
    return;
  };

  bool operator==(const HOGE &obj) { return (this->value == obj.value); };
  bool operator<(const HOGE &obj) { return (this->value < obj.value); };
  bool operator>(const HOGE &obj) { return (this->value > obj.value); };
};

template <typename CLASS1, typename CLASS2>
bool operator==(const HOGE<CLASS1, CLASS2> &hoge1,
                const HOGE<CLASS1, CLASS2> &hoge2) {
  return hoge1.value == hoge2.value;
};

template <typename CLASS1, typename CLASS2>
bool operator<(const HOGE<CLASS1, CLASS2> &hoge1,
               const HOGE<CLASS1, CLASS2> &hoge2) {
  return hoge1.value < hoge2.value;
};

template <typename CLASS1, typename CLASS2>
bool operator>(const HOGE<CLASS1, CLASS2> &hoge1,
               const HOGE<CLASS1, CLASS2> &hoge2) {
  return hoge1.value > hoge2.value;
};

constexpr int INF = (1 << 30);
constexpr ll INFLL = 1LL << 62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9) + 7);

int main() {
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after
              // std::cin)
  ios::sync_with_stdio(
      false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  string s, t;
  IN(s, t);

  map<ll, ll> mps, mpt;
  REP(i, s.size()) mps[s[i] - 'a']++;
  REP(i, t.size()) mpt[t[i] - 'a']++;

  bool flag = true;
  for (ll i = 0; i <= 'z' - 'a'; ++i) {
    if (mps[i] == 0 && mpt[i] > 0)
      flag = false;
  }

  if (!flag) {
    OUT(-1);
    return 0;
  }

  string s2 = s + s;
  vvll next_pos('z' - 'a' + 1, vll(s.size(), -1));

  REP(i, s2.size()) {
    ll pos = s2.size() - i - 1;
    REP(j, 'z' - 'a' + 1) {
      next_pos[j][pos % s.size()] = next_pos[j][(pos + 1) % s.size()];
    }
    next_pos[s2[pos] - 'a'][pos % s.size()] = pos % s.size();
  }

  // mat_print(next_pos);

  ll ans = 1;
  ll pos = 0;
  REP(i, t.size()) {
    ll next = next_pos[t[i] - 'a'][pos];
    if (next >= pos)
      ans += next - pos;
    else
      ans += next + (s.size() - pos);
    pos = next;
    if (i < t.size() - 1) {
      pos++;
      ans++;
      pos %= s.size();
    }
  }

  OUT(ans);
  return 0;
}