Problem p02587 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
#include <stdlib.h>
#include <sys/time.h>
#include <unistd.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<long double, ll> Ps;
typedef pair<ll, bool> Pb;

const ll INF = 1e18;
const ll fact_table = 3200008;
long double Pi = 3.1415926535897932384626;

priority_queue<ll> pql;
priority_queue<P> pqp;
priority_queue<P> bag;
// big priority queue
priority_queue<ll, vector<ll>, greater<ll>> pqls;
priority_queue<P, vector<P>, greater<P>> pqps;
// small priority queue
// top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
// ↓,→,↑,←

#define endl "\\n"
#ifdef ENJAPMA
#undef endl
#endif

#define p(x) cout << x << endl;
#define el cout << endl;
#define pe(x) cout << x << " ";
#define ps(x) cout << fixed << setprecision(25) << x << endl;
#define pu(x) cout << (x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)();
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i++)

// const ll mod = 998244353ll;
const ll mod = 1000000007ll;

ll mypow(ll a, ll b, ll mod) {
  ll x = 1;
  while (b) {
    while (!(b & 1)) {
      (a *= a) %= mod;
      b >>= 1;
    }
    (x *= a) %= mod;
    b--;
  }
  return x;
}
void YES(bool cond) {
  if (cond) {
    p("YES");
  } else {
    p("NO");
  }
  return;
}
void Yes(bool cond) {
  if (cond) {
    p("Yes");
  } else {
    p("No");
  }
  return;
}
void line() {
  p("--------------------");
  return;
}

/*
ll fact[fact_table + 5], rfact[fact_table + 5];

void c3_init() {
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}
ll c3(ll n, ll r) {
    return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod;
}
*/
struct Timer {
  int64_t start;
  const int64_t CYCLES_PER_SEC = 2800000000;
  Timer() { reset(); }
  void reset() { start = getCycle(); }
  inline double get() { return (double)(getCycle() - start) / CYCLES_PER_SEC; }
  inline int64_t getCycle() {
    uint32_t low, high;
    __asm__ volatile("rdtsc" : "=a"(low), "=d"(high));
    return ((int64_t)low) | ((int64_t)high << 32);
  }
};

bool multicase = false;

ll n, m, k, w, num, a, b, c, d, e, h, q, ans, sum, l;

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

ll dp[55][50][3];
string s[500];
ll cost[54];

void update(ll id, ll idx, ll dir, ll value) {
  if (dp[id][idx][dir] == -1) {
    dp[id][idx][dir] = value;
  } else {
    dp[id][idx][dir] = min(dp[id][idx][dir], value);
  }
  return;
}

ll calc(ll id, ll idx, int dir, ll cnt) {
  if (cnt >= 20000)
    return INF;
  if (dp[id][idx][dir] != -1)
    return dp[id][idx][dir];
  // 残ってる文字列が怪文である場合の処理をしないといけません

  if (dir == 0) {
    if (idx == s[id].size())
      return 0ll;
    string c = s[id].substr(idx, s[id].size() - idx);
    string d = c;
    reverse(d.begin(), d.end());
    if (c == d)
      return 0ll;
  }

  if (dir == 1) {
    if (idx == -1)
      return 0ll;
    string c = s[id].substr(0, idx + 1);
    string d = c;
    reverse(d.begin(), d.end());
    if (c == d)
      return 0ll;
  }

  ll res = INF;
  if (dir == 0) {
    string a = s[id].substr(idx, s[id].size() - idx);
    for (int i = 0; i < n; i++) {
      string b = s[i];
      if (a.size() > b.size()) {
        reverse(b.begin(), b.end());
        if (a.substr(0, b.size()) == b) {
          update(id, idx, dir, calc(id, idx + b.size(), 0, cnt + 1) + cost[i]);
          res = min(res, dp[id][idx][dir]);
        }
      } else {
        reverse(a.begin(), a.end());
        if (b.substr(b.size() - a.size(), a.size()) == a) {
          update(id, idx, dir,
                 calc(i, b.size() - a.size() - 1, 1, cnt + 1) + cost[i]);
          res = min(res, dp[id][idx][dir]);
        }
        reverse(a.begin(), a.end());
      }
    }
  } else {
    string a = s[id].substr(0, idx + 1);
    for (int i = 0; i < n; i++) {
      string b = s[i];
      if (a.size() > b.size()) {
        reverse(b.begin(), b.end());
        if (a.substr(a.size() - b.size(), b.size()) == b) {
          update(id, idx, dir, calc(id, idx - b.size(), 1, cnt + 1) + cost[i]);
          res = min(res, dp[id][idx][dir]);
        }
      } else {
        reverse(a.begin(), a.end());
        if (b.substr(0, a.size()) == a) {
          update(id, idx, dir, calc(i, a.size(), 0, cnt + 1) + cost[i]);
          res = min(res, dp[id][idx][dir]);
        }
        reverse(a.begin(), a.end());
      }
    }
  }
  return res;
}

void solve() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> s[i] >> cost[i];
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 25; j++) {
      dp[i][j][0] = dp[i][j][1] = -1;
    }
  }
  ll ans = INF;
  for (int i = 0; i < n; i++) {
    ans = min(ans, calc(i, 0, 0, 0) + cost[i]);
  }
  if (ans >= INF) {
    p(-1);
  } else {
    p(ans);
  }
  return;
}

int main() {
  // init();
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll q, testcase = 1;
  if (multicase) {
    cin >> q;
  } else {
    q = 1;
  }
  while (q--) {
    // pu("Case ");pu("#");pu(testcase);pu(": ");
    solve();
    testcase++;
  }
  // solve();
  return 0;
}


Error: 0

Fixed submission:

#include <bits/stdc++.h>
#include <stdlib.h>
#include <sys/time.h>
#include <unistd.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<long double, ll> Ps;
typedef pair<ll, bool> Pb;

const ll INF = 1e18;
const ll fact_table = 3200008;
long double Pi = 3.1415926535897932384626;

priority_queue<ll> pql;
priority_queue<P> pqp;
priority_queue<P> bag;
// big priority queue
priority_queue<ll, vector<ll>, greater<ll>> pqls;
priority_queue<P, vector<P>, greater<P>> pqps;
// small priority queue
// top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
// ↓,→,↑,←

#define endl "\\n"
#ifdef ENJAPMA
#undef endl
#endif

#define p(x) cout << x << endl;
#define el cout << endl;
#define pe(x) cout << x << " ";
#define ps(x) cout << fixed << setprecision(25) << x << endl;
#define pu(x) cout << (x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)();
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i++)

// const ll mod = 998244353ll;
const ll mod = 1000000007ll;

ll mypow(ll a, ll b, ll mod) {
  ll x = 1;
  while (b) {
    while (!(b & 1)) {
      (a *= a) %= mod;
      b >>= 1;
    }
    (x *= a) %= mod;
    b--;
  }
  return x;
}
void YES(bool cond) {
  if (cond) {
    p("YES");
  } else {
    p("NO");
  }
  return;
}
void Yes(bool cond) {
  if (cond) {
    p("Yes");
  } else {
    p("No");
  }
  return;
}
void line() {
  p("--------------------");
  return;
}

/*
ll fact[fact_table + 5], rfact[fact_table + 5];

void c3_init() {
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}
ll c3(ll n, ll r) {
    return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod;
}
*/
struct Timer {
  int64_t start;
  const int64_t CYCLES_PER_SEC = 2800000000;
  Timer() { reset(); }
  void reset() { start = getCycle(); }
  inline double get() { return (double)(getCycle() - start) / CYCLES_PER_SEC; }
  inline int64_t getCycle() {
    uint32_t low, high;
    __asm__ volatile("rdtsc" : "=a"(low), "=d"(high));
    return ((int64_t)low) | ((int64_t)high << 32);
  }
};

bool multicase = false;

ll n, m, k, w, num, a, b, c, d, e, h, q, ans, sum, l;

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

ll dp[55][50][3];
string s[500];
ll cost[54];

void update(ll id, ll idx, ll dir, ll value) {
  if (dp[id][idx][dir] == -1) {
    dp[id][idx][dir] = value;
  } else {
    dp[id][idx][dir] = min(dp[id][idx][dir], value);
  }
  return;
}

ll calc(ll id, ll idx, int dir) {
  if (dp[id][idx][dir] != -1)
    return dp[id][idx][dir];
  // 残ってる文字列が怪文である場合の処理をしないといけません

  if (dir == 0) {
    if (idx == s[id].size())
      return 0ll;
    string c = s[id].substr(idx, s[id].size() - idx);
    string d = c;
    reverse(d.begin(), d.end());
    if (c == d)
      return 0ll;
  }

  if (dir == 1) {
    if (idx == -1)
      return 0ll;
    string c = s[id].substr(0, idx + 1);
    string d = c;
    reverse(d.begin(), d.end());
    if (c == d)
      return 0ll;
  }

  ll res = INF;
  if (dir == 0) {
    string a = s[id].substr(idx, s[id].size() - idx);
    for (int i = 0; i < n; i++) {
      string b = s[i];
      if (a.size() > b.size()) {
        reverse(b.begin(), b.end());
        if (a.substr(0, b.size()) == b) {
          update(id, idx, dir, calc(id, idx + b.size(), 0) + cost[i]);
          res = min(res, dp[id][idx][dir]);
        }
      } else {
        reverse(a.begin(), a.end());
        if (b.substr(b.size() - a.size(), a.size()) == a) {
          update(id, idx, dir, calc(i, b.size() - a.size() - 1, 1) + cost[i]);
          res = min(res, dp[id][idx][dir]);
        }
        reverse(a.begin(), a.end());
      }
    }
  } else {
    string a = s[id].substr(0, idx + 1);
    for (int i = 0; i < n; i++) {
      string b = s[i];
      if (a.size() > b.size()) {
        reverse(b.begin(), b.end());
        if (a.substr(a.size() - b.size(), b.size()) == b) {
          update(id, idx, dir, calc(id, idx - b.size(), 1) + cost[i]);
          res = min(res, dp[id][idx][dir]);
        }
      } else {
        reverse(a.begin(), a.end());
        if (b.substr(0, a.size()) == a) {
          update(id, idx, dir, calc(i, a.size(), 0) + cost[i]);
          res = min(res, dp[id][idx][dir]);
        }
        reverse(a.begin(), a.end());
      }
    }
  }
  return res;
}

void solve() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> s[i] >> cost[i];
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 25; j++) {
      dp[i][j][0] = dp[i][j][1] = -1;
    }
  }
  ll ans = INF;
  for (int i = 0; i < n; i++) {
    ans = min(ans, calc(i, 0, 0) + cost[i]);
  }
  if (ans >= INF) {
    p(-1);
  } else {
    p(ans);
  }
  return;
}

int main() {
  // init();
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll q, testcase = 1;
  if (multicase) {
    cin >> q;
  } else {
    q = 1;
  }
  while (q--) {
    // pu("Case ");pu("#");pu(testcase);pu(": ");
    solve();
    testcase++;
  }
  // solve();
  return 0;
}