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

#include <bits/stdc++.h>

using namespace std;

inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T> inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i, c)                                                             \\
  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define exist(s, e) ((s).find(e) != (s).end())
#define range(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) range(i, 0, n)
#define clr(a, b) memset((a), (b), sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                                               \\
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi = acos(-1.0);
const ll INF = 1LL << 62;
const int inf = 1 << 29;

struct dice {
public:
  int u, f, r;
  int up() { return u; }
  int down() { return 7 - u; }
  int right() { return r; }
  int left() { return 7 - r; }
  int front() { return f; }
  int back() { return 7 - f; }
  void tofront() {
    swap(f, u);
    u = 7 - u;
  };
  void toback() { tofront(), tofront(), tofront(); };
  void toright() {
    swap(r, u);
    u = 7 - u;
  }
  void toleft() { toright(), toright(), toright(); };
};

int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};

stack<dice> table[210][210];

int main(void) {
  int n;
  while (cin >> n, n) {
    rep(i, 210) rep(j, 210) while (!table[i][j].empty()) table[i][j].pop();
    rep(i, n) {
      int u, f;
      cin >> u >> f;
      int x = 100, y = 100;
      dice cur;
      cur.u = 1;
      cur.f = 3;
      cur.r = 5;
      rep(loop, 4) {
        if (u == cur.up())
          break;
        cur.tofront();
      }
      rep(loop, 4) {
        if (u == cur.up())
          break;
        cur.toright();
      }
      rep(loop, 4) {
        if (f == cur.front())
          break;
        cur.tofront();
        cur.toright();
        cur.toback();
      }

      table[x][y].push(cur);
      while (1) {
        int d = -1;
        int cmax = -1;
        int c = table[x][y].size();
        if (cur.front() >= 4 && cur.front() > cmax &&
            (c - (int)table[x + dx[0]][y + dy[0]].size()) >= 2) {
          cmax = cur.front();
          d = 0;
        }
        if (cur.back() >= 4 && cur.back() > cmax &&
            (c - (int)table[x + dx[1]][y + dy[1]].size()) >= 2) {
          cmax = cur.back();
          d = 1;
        }
        if (cur.right() >= 4 && cur.right() > cmax &&
            (c - (int)table[x + dx[2]][y + dy[2]].size()) >= 2) {
          cmax = cur.right();
          d = 2;
        }
        if (cur.left() >= 4 && cur.left() > cmax &&
            (c - (int)table[x + dx[3]][y + dy[3]].size()) >= 2) {
          cmax = cur.left();
          d = 3;
        }
        if (d == -1)
          break;
        else {
          table[x][y].pop();
          switch (d) {
          case 0:
            cur.tofront();
            break;
          case 1:
            cur.toback();
            break;
          case 2:
            cur.toright();
            break;
          case 3:
            cur.toleft();
            break;
          }
          x += dx[d];
          y += dy[d];
          table[x][y].push(cur);
        }
      }
    }

    int res[6] = {0};
    rep(i, 210) rep(j, 210) {
      if (abs(i - 100) + abs(j - 100) > 100)
        continue;
      if (table[i][j].size())
        res[table[i][j].top().up() - 1]++;
    }
    rep(i, 6) cout << (i ? " " : "") << res[i];
    cout << endl;
  }
  return 0;
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>

using namespace std;

inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T> inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i, c)                                                             \\
  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define exist(s, e) ((s).find(e) != (s).end())
#define range(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) range(i, 0, n)
#define clr(a, b) memset((a), (b), sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                                               \\
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi = acos(-1.0);
const ll INF = 1LL << 62;
const int inf = 1 << 29;

struct dice {
public:
  int u, f, r;
  int up() { return u; }
  int down() { return 7 - u; }
  int right() { return r; }
  int left() { return 7 - r; }
  int front() { return f; }
  int back() { return 7 - f; }
  void tofront() {
    swap(f, u);
    u = 7 - u;
  };
  void toback() { tofront(), tofront(), tofront(); };
  void toright() {
    swap(r, u);
    u = 7 - u;
  }
  void toleft() { toright(), toright(), toright(); };
};

int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};

int main(void) {
  int n;
  while (cin >> n, n) {
    stack<dice> table[210][210];
    rep(i, n) {
      int u, f;
      cin >> u >> f;
      int x = 100, y = 100;
      dice cur;
      cur.u = 1;
      cur.f = 3;
      cur.r = 5;
      rep(loop, 4) {
        if (u == cur.up())
          break;
        cur.tofront();
      }
      rep(loop, 4) {
        if (u == cur.up())
          break;
        cur.toright();
      }
      rep(loop, 4) {
        if (f == cur.front())
          break;
        cur.tofront();
        cur.toright();
        cur.toback();
      }

      table[x][y].push(cur);
      while (1) {
        int d = -1;
        int cmax = -1;
        if (cur.front() >= 4 && cur.front() > cmax &&
            table[x][y].size() - table[x + dx[0]][y + dy[0]].size() >= 2) {
          cmax = cur.front();
          d = 0;
        }
        if (cur.back() >= 4 && cur.back() > cmax &&
            table[x][y].size() - table[x + dx[1]][y + dy[1]].size() >= 2) {
          cmax = cur.back();
          d = 1;
        }
        if (cur.right() >= 4 && cur.right() > cmax &&
            table[x][y].size() - table[x + dx[2]][y + dy[2]].size() >= 2) {
          cmax = cur.right();
          d = 2;
        }
        if (cur.left() >= 4 && cur.left() > cmax &&
            table[x][y].size() - table[x + dx[3]][y + dy[3]].size() >= 2) {
          cmax = cur.left();
          d = 3;
        }

        if (d == -1)
          break;
        else {
          table[x][y].pop();
          switch (d) {
          case 0:
            cur.tofront();
            break;
          case 1:
            cur.toback();
            break;
          case 2:
            cur.toright();
            break;
          case 3:
            cur.toleft();
            break;
          }
          x += dx[d];
          y += dy[d];
          table[x][y].push(cur);
        }
      }
    }

    int res[6] = {0};
    rep(i, 210) rep(j, 210) {
      if (abs(i - 100) + abs(j - 100) > 100)
        continue;
      if (table[i][j].size())
        res[table[i][j].top().up() - 1]++;
    }
    rep(i, 6) cout << (i ? " " : "") << res[i];
    cout << endl;
  }
  return 0;
}