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

#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
// #include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
// #include <opencv2/core.hpp>
// #include <opencv2/highgui.hpp>
// #include <opencv2/imgproc.hpp>

using namespace std;

// 呪文
#define DUMPOUT cerr
#define dump(...)                                                              \\
  DUMPOUT << "  ";                                                             \\
  DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]"   \\
          << endl;                                                             \\
  DUMPOUT << "    ";                                                           \\
  dump_func(__VA_ARGS__)

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const pair<_KTy, _Ty> &m) {
  o << "{" << m.first << ", " << m.second << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const unordered_map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const vector<_Ty> &v) {
  if (v.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << v.front();
  for (auto itr = ++v.begin(); itr != v.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty>
ostream &operator<<(ostream &o, const unordered_set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const stack<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  stack<_Ty> t(s);
  o << "{" << t.top();
  t.pop();
  while (!t.empty()) {
    o << ", " << t.top();
    t.pop();
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const list<_Ty> &l) {
  if (l.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << l.front();
  for (auto itr = ++l.begin(); itr != l.end(); ++itr) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
istream &operator>>(istream &is, pair<_KTy, _Ty> &m) {
  is >> m.first >> m.second;
  return is;
}
template <typename _Ty> istream &operator>>(istream &is, vector<_Ty> &v) {
  for (size_t i = 0; i < v.size(); i++)
    is >> v[i];
  return is;
}
namespace aux { // print tuple
template <typename Ty, unsigned N, unsigned L> struct tp {
  static void print(ostream &os, const Ty &v) {
    os << get<N>(v) << ", ";
    tp<Ty, N + 1, L>::print(os, v);
  }
};
template <typename Ty, unsigned N> struct tp<Ty, N, N> {
  static void print(ostream &os, const Ty &v) { os << get<N>(v); }
};
} // namespace aux
template <typename... Tys>
ostream &operator<<(ostream &os, const tuple<Tys...> &t) {
  os << "{";
  aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t);
  os << "}";
  return os;
}

template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) == 0) {
    DUMPOUT << " ";
  } else {
    DUMPOUT << ", ";
  }
  dump_func(std::move(tail)...);
}

#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(is, a, n) for (int is = (a); is < (n); ++is)
#define REP(is, n) FOR(is, 0, n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false

template <typename T>
void printVec(const vector<T> &v, char delim = ' ', ostream &os = cout) {
  os << v[0];
  for (int i = 1; i < v.size(); i++)
    os << delim << v[i];
  os << endl;
}

template <class T> class CDoublyLinkedList {
  typedef struct SNode {
  public:
    T val;
    SNode *prev;
    SNode *next;
  } *SNodePtr;
  SNodePtr nil;

public:
  CDoublyLinkedList() {
    nil = new SNode;
    nil->prev = nil->next = nil;
  }
  void push_front(T val) {
    SNodePtr node = new SNode;
    node->val = val;
    SNodePtr next = nil->next;
    nil->next = node;
    node->prev = nil;
    node->next = next;
    next->prev = node;
  }
  void pop_front() {
    SNodePtr node = nil->next;
    SNodePtr next = node->next;
    nil->next = next;
    next->prev = nil;
    delete node;
  }
  void pop_back() {
    SNodePtr node = nil->prev;
    SNodePtr prev = node->prev;
    nil->prev = prev;
    prev->next = nil;
    delete node;
  }
  void erase(T val) {
    SNodePtr node = nil->next;
    while (node->val != val && node != nil)
      node = node->next;
    if (node == nil)
      return;
    SNodePtr prev = node->prev;
    SNodePtr next = node->next;
    prev->next = next;
    next->prev = prev;
    delete node;
  }
  vector<T> getList() {
    vector<T> ret;
    SNodePtr node = nil->next;
    while (node != nil) {
      ret.push_back(node->val);
      node = node->next;
    }
    return ret;
  }
  ~CDoublyLinkedList() { delete nil; }
};

int main() {

  cin.tie(0);
  ios::sync_with_stdio(false);

  // clock_t elapses;
  // elapses = clock();

  CDoublyLinkedList<int> dll;

  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    string order;
    int val;
    cin >> order;
    if (order == "insert" || order == "delete")
      cin >> val;

    if (order == "insert")
      dll.push_front(val);
    else if (order == "delete")
      dll.erase(val);
    else if (order == "deleteFirst")
      dll.pop_front();
    else
      dll.pop_back();
  }

  vector<int> ans = dll.getList();
  printVec(ans);

  // elapses = clock() - elapses;
  // dump(double(elapses) / CLOCKS_PER_SEC);

  return 0;
}


Error: TLE

Fixed submission:

#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
// #include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
// #include <opencv2/core.hpp>
// #include <opencv2/highgui.hpp>
// #include <opencv2/imgproc.hpp>

using namespace std;

// 呪文
#define DUMPOUT cerr
#define dump(...)                                                              \\
  DUMPOUT << "  ";                                                             \\
  DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]"   \\
          << endl;                                                             \\
  DUMPOUT << "    ";                                                           \\
  dump_func(__VA_ARGS__)

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const pair<_KTy, _Ty> &m) {
  o << "{" << m.first << ", " << m.second << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const unordered_map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const vector<_Ty> &v) {
  if (v.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << v.front();
  for (auto itr = ++v.begin(); itr != v.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty>
ostream &operator<<(ostream &o, const unordered_set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const stack<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  stack<_Ty> t(s);
  o << "{" << t.top();
  t.pop();
  while (!t.empty()) {
    o << ", " << t.top();
    t.pop();
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const list<_Ty> &l) {
  if (l.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << l.front();
  for (auto itr = ++l.begin(); itr != l.end(); ++itr) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
istream &operator>>(istream &is, pair<_KTy, _Ty> &m) {
  is >> m.first >> m.second;
  return is;
}
template <typename _Ty> istream &operator>>(istream &is, vector<_Ty> &v) {
  for (size_t i = 0; i < v.size(); i++)
    is >> v[i];
  return is;
}
namespace aux { // print tuple
template <typename Ty, unsigned N, unsigned L> struct tp {
  static void print(ostream &os, const Ty &v) {
    os << get<N>(v) << ", ";
    tp<Ty, N + 1, L>::print(os, v);
  }
};
template <typename Ty, unsigned N> struct tp<Ty, N, N> {
  static void print(ostream &os, const Ty &v) { os << get<N>(v); }
};
} // namespace aux
template <typename... Tys>
ostream &operator<<(ostream &os, const tuple<Tys...> &t) {
  os << "{";
  aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t);
  os << "}";
  return os;
}

template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) == 0) {
    DUMPOUT << " ";
  } else {
    DUMPOUT << ", ";
  }
  dump_func(std::move(tail)...);
}

#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(is, a, n) for (int is = (a); is < (n); ++is)
#define REP(is, n) FOR(is, 0, n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false

template <class T> class CDoublyLinkedList {
  typedef struct SNode {
  public:
    T val;
    SNode *prev;
    SNode *next;
  } *SNodePtr;
  SNodePtr nil;

public:
  CDoublyLinkedList() {
    nil = new SNode;
    nil->prev = nil->next = nil;
  }
  void push_front(T val) {
    SNodePtr node = new SNode;
    node->val = val;
    SNodePtr next = nil->next;
    nil->next = node;
    node->prev = nil;
    node->next = next;
    next->prev = node;
  }
  void pop_front() {
    SNodePtr node = nil->next;
    SNodePtr next = node->next;
    nil->next = next;
    next->prev = nil;
    delete node;
  }
  void pop_back() {
    SNodePtr node = nil->prev;
    SNodePtr prev = node->prev;
    nil->prev = prev;
    prev->next = nil;
    delete node;
  }
  void erase(T val) {
    SNodePtr node = nil->next;
    while (node->val != val)
      node = node->next;
    SNodePtr prev = node->prev;
    SNodePtr next = node->next;
    prev->next = next;
    next->prev = prev;
    delete node;
  }
  vector<T> getList() {
    vector<T> ret;
    SNodePtr node = nil->next;
    while (node != nil) {
      ret.push_back(node->val);
      node = node->next;
    }
    return ret;
  }
  ~CDoublyLinkedList() { delete nil; }
};

template <typename T>
void printVec(const vector<T> &v, char delim = ' ', ostream &os = cout) {
  os << v[0];
  for (int i = 1; i < v.size(); i++)
    os << delim << v[i];
  os << endl;
}

int main() {

  cin.tie(0);
  ios::sync_with_stdio(false);

  // clock_t elapses;
  // elapses = clock();

  CDoublyLinkedList<int> dll;

  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    string order;
    int val;
    cin >> order;
    if (order == "insert" || order == "delete")
      cin >> val;

    if (order == "insert")
      dll.push_front(val);
    else if (order == "delete")
      dll.erase(val);
    else if (order == "deleteFirst")
      dll.pop_front();
    else
      dll.pop_back();
  }

  vector<int> ans = dll.getList();

  printVec(ans);

  // elapses = clock() - elapses;
  // dump(double(elapses) / CLOCKS_PER_SEC);

  return 0;
}