Problem p02671 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <bits/stdc++.h>

//    #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
// #define inf  998244353

#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define pb push_back
#define EPS (1e-8)

int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
public:
  int x;
  int y, z;
  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    return z < p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    return z > p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};

class pa4 {
public:
  int x;
  int y, z, w;
  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    if (z != p.z)
      return z < p.z;
    return w < p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    if (z != p.z)
      return z > p.z;
    return w > p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
public:
  int x, y;
  pa2(int x = 0, int y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};

string itos(int i) {
  ostringstream s;
  s << i;
  return s.str();
}

int Gcd(int v, int b) {
  if (v == 0)
    return b;
  if (b == 0)
    return v;
  if (v > b)
    return Gcd(b, v);
  if (v == b)
    return b;
  if (b % v == 0)
    return v;
  return Gcd(v, b % v);
}

int mod;
int extgcd(int a, int b, int &x, int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int d = extgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
pa operator+(const pa &l, const pa &r) {
  return {l.first + r.first, l.second + r.second};
}
pa operator-(const pa &l, const pa &r) {
  return {l.first - r.first, l.second - r.second};
}
int beki(int wa, int rr, int warukazu) {
  if (rr == 0)
    return 1 % warukazu;
  if (rr == 1)
    return wa % warukazu;
  wa %= warukazu;
  if (rr % 2 == 1)
    return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;
  ll zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}

int pr[100000];
int inv[100000];

int comb(int nn, int rr) {
  if (rr < 0 || rr > nn || nn < 0)
    return 0;
  int r = pr[nn] * inv[rr];
  r %= mod;
  r *= inv[nn - rr];
  r %= mod;
  return r;
}

void gya(int ert) {
  pr[0] = 1;
  for (int i = 1; i <= ert; i++) {
    pr[i] = ((ll)pr[i - 1] * i) % mod;
  }
  inv[ert] = beki(pr[ert], mod - 2, mod);
  for (int i = ert - 1; i >= 0; i--) {
    inv[i] = (ll)inv[i + 1] * (i + 1) % mod;
  }
}

//   cin.tie(0);
//	ios::sync_with_stdio(false);
// priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
// sort(ve.begin(),ve.end(),greater<int>());
//   mt19937(clock_per_sec);
//  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;

void solve() {
  vector<int> ve(1, 0);
  int n;
  cin >> n;
  string s;
  cin >> s;
  int m = s.length();
  vector<int> las(m + 1, 0);

  int san[15];
  san[0] = 1;
  for (int i = 0; i < 13; i++)
    san[i + 1] = san[i] * 3;

  for (int i = 0; i < n; i++) {
    set<int> se[3];
    vector<int> ima(san[i] * 3);
    for (int j = 0; j < 3; j++) {
      for (int k = j * san[i]; k < (j + 1) * san[i]; k++)
        se[j].insert(k), ima[k] = j;
    }
    int tmp[3] = {0, 1, 2};

    las[0] += 2 * san[i];
    for (int j = 0; j < m; j++) {
      if (s[j] == 'S') {
        for (int k = 0; k < 3; k++) {
          tmp[k] = (3 - tmp[k]) % 3;
        }
      } else {
        int mae = las[j] % san[i];
        //	cout<<las[0]<<endl;
        int t = (tmp[ima[mae]] + 1) % 3;
        for (int k = 0; k < 3; k++)
          if (tmp[k] == t)
            ima[mae] = k;

        t = (tmp[ima[mae + san[i]]] + 1) % 3;
        for (int k = 0; k < 3; k++)
          if (tmp[k] == t)
            ima[mae + san[i]] = k;
        t = (tmp[ima[mae + san[i] * 2]] + 1) % 3;
        for (int k = 0; k < 3; k++)
          if (tmp[k] == t)
            ima[mae + san[i] * 2] = k;
      }

      if (tmp[ima[las[j + 1] + san[i]]] == 2)
        las[j + 1] += san[i];
      else if (tmp[ima[las[j + 1] + san[i] * 2]] == 2)
        las[j + 1] += san[i] * 2;
    }

    int ss = ve.size();
    for (int j = 0; j < ss; j++)
      ve.pb(ve[j]);
    for (int j = 0; j < ss; j++)
      ve.pb(ve[j]);
    /*
    for(auto j:se[1])ve[j]+=san[i];
    for(auto j:se[2])ve[j]+=2*san[i];
    */

    for (int j = 0; j < 3 * ss; j++)
      ve[j] += tmp[ima[j]] * san[i];
  }
  for (auto v : ve)
    cout << v << " ";
  cout << endl;
}

signed main() {

  cin.tie(0);
  ios::sync_with_stdio(false);
  int n;
  n = 1;
  for (int i = 0; i < n; i++)
    solve();

  return 0;
}


Error: TLE

Fixed submission:

#include <bits/stdc++.h>

//    #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
// #define inf  998244353

#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define pb push_back
#define EPS (1e-8)

int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
public:
  int x;
  int y, z;
  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    return z < p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    return z > p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};

class pa4 {
public:
  int x;
  int y, z, w;
  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    if (z != p.z)
      return z < p.z;
    return w < p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    if (z != p.z)
      return z > p.z;
    return w > p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
public:
  int x, y;
  pa2(int x = 0, int y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};

string itos(int i) {
  ostringstream s;
  s << i;
  return s.str();
}

int Gcd(int v, int b) {
  if (v == 0)
    return b;
  if (b == 0)
    return v;
  if (v > b)
    return Gcd(b, v);
  if (v == b)
    return b;
  if (b % v == 0)
    return v;
  return Gcd(v, b % v);
}

int mod;
int extgcd(int a, int b, int &x, int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int d = extgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
pa operator+(const pa &l, const pa &r) {
  return {l.first + r.first, l.second + r.second};
}
pa operator-(const pa &l, const pa &r) {
  return {l.first - r.first, l.second - r.second};
}
int beki(int wa, int rr, int warukazu) {
  if (rr == 0)
    return 1 % warukazu;
  if (rr == 1)
    return wa % warukazu;
  wa %= warukazu;
  if (rr % 2 == 1)
    return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;
  ll zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}

int pr[100000];
int inv[100000];

int comb(int nn, int rr) {
  if (rr < 0 || rr > nn || nn < 0)
    return 0;
  int r = pr[nn] * inv[rr];
  r %= mod;
  r *= inv[nn - rr];
  r %= mod;
  return r;
}

void gya(int ert) {
  pr[0] = 1;
  for (int i = 1; i <= ert; i++) {
    pr[i] = ((ll)pr[i - 1] * i) % mod;
  }
  inv[ert] = beki(pr[ert], mod - 2, mod);
  for (int i = ert - 1; i >= 0; i--) {
    inv[i] = (ll)inv[i + 1] * (i + 1) % mod;
  }
}

//   cin.tie(0);
//	ios::sync_with_stdio(false);
// priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
// sort(ve.begin(),ve.end(),greater<int>());
//   mt19937(clock_per_sec);
//  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;

void solve() {
  vector<int> ve(1, 0);
  int n;
  cin >> n;
  string s;
  cin >> s;
  int m = s.length();
  vector<int> las(m + 1, 0);

  int san[15];
  san[0] = 1;
  for (int i = 0; i < 13; i++)
    san[i + 1] = san[i] * 3;

  for (int i = 0; i < n; i++) {
    set<int> se[3];
    for (int j = 0; j < 3; j++) {
      for (int k = j * san[i]; k < (j + 1) * san[i]; k++)
        se[j].insert(k);
    }
    las[0] += 2 * san[i];
    for (int j = 0; j < m; j++) {
      if (s[j] == 'S') {
        swap(se[1], se[2]);
      } else {
        int mae = las[j] % san[i];
        int tmp[3];
        bool sumi[3] = {};
        for (int k = 0; k < 3; k++) {
          if (!sumi[0] && se[k].count(mae))
            tmp[k] = mae, sumi[0] = 1;
          else if (!sumi[1] && se[k].count(mae + san[i]))
            tmp[k] = mae + san[i], sumi[1] = 1;
          else
            tmp[k] = mae + san[i] * 2, sumi[2] = 1;
        }
        for (int k = 0; k < 3; k++) {
          se[k].erase(tmp[k]);
          se[(k + 1) % 3].insert(tmp[k]);
        }
      }
      if (se[2].count(las[j + 1] + san[i]))
        las[j + 1] += san[i];
      else if (se[2].count(las[j + 1] + san[i] * 2))
        las[j + 1] += 2 * san[i];
    }

    int ss = ve.size();
    for (int j = 0; j < ss; j++)
      ve.pb(ve[j]);
    for (int j = 0; j < ss; j++)
      ve.pb(ve[j]);

    for (auto j : se[1])
      ve[j] += san[i];
    for (auto j : se[2])
      ve[j] += 2 * san[i];
  }
  for (auto v : ve)
    cout << v << " ";
  cout << endl;
}

signed main() {

  cin.tie(0);
  ios::sync_with_stdio(false);
  int n;
  n = 1;
  for (int i = 0; i < n; i++)
    solve();

  return 0;
}