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

#include <iostream>
#include <utility>
#include <vector>

int Partition(std::vector<std::pair<char, int>> &v, int p, int r) {
  int x = v[r].second;
  int i = p - 1;
  for (int j = p; j < r; ++j) {
    if (v[j].second <= x) {
      v[++i].swap(v[j]);
    }
  }
  v[i + 1].swap(v[r]);
  return i + 1;
}

void QuickSort(std::vector<std::pair<char, int>> &v, int p, int r) {
  if (p < r) {
    int q = Partition(v, p, r);
    QuickSort(v, p, q - 1);
    QuickSort(v, q + 1, r);
  }
}

constexpr int fIndex = -3;

int BinarySearch(std::vector<std::pair<char, int>> &v, int key) {
  int left = 0;
  int right = v.size();
  int mid;
  // std::cout << key << ": ";
  while (left < right) {
    mid = (left + right) / 2;
    if (v[mid].second == key) {
      // std::cout << key;
      return mid;
    } else if (key < v[mid].second) {
      right = mid;
    } else {
      left = mid + 1;
    }

    if (key == 1) {
      // std::cout << v[mid] << " ";
    }
  }
  return fIndex;
}

// code below cause TLE
// std::string CheckStable( const std::vector<std::pair<char, int>>& initial,
// const std::vector<std::pair<char, int>>& sorted ){
//     int N = sorted.size();
//     int key;
//     for( int i = 0; i < N; ++i ){
//         if( sorted[i].second == sorted[i+1].second ){
//             key = sorted[i].second;
//             for( j = i+1; sorted[j] == key; ++j ){
//                 if( initial[i] )
//             }
//         }
//     }
//     return "Stable";
// }

std::string CheckStable(std::vector<std::pair<char, int>> &initial,
                        std::vector<std::pair<char, int>> &sorted) {
  int N = sorted.size();
  for (int i = 0; i < N; ++i) {
    for (int j = i + 1; j < N; ++j) {
      if (initial[i].second == initial[j].second) {
        for (int a = 0 /*BinarySearch( sorted, initial[i].second )*/; a < N;
             ++a) {
          if (sorted[a].second == initial[i].second) {
            for (int b = a + 1; b < N; ++b) {
              if (initial[i] == sorted[b] && initial[j] == sorted[a]) {
                return "Not stable";
              }
            }
          }
        }
      }
    }
  }
  return "Stable";
}

int main() {
  int n;
  std::cin.tie(0);
  std::cin >> n;

  std::vector<std::pair<char, int>> cards(n);
  int number;
  char symbol;
  for (auto &elem : cards) {
    std::cin >> symbol >> number;
    elem = std::make_pair(symbol, number);
  }

  std::vector<std::pair<char, int>> input(cards);

  QuickSort(cards, 0, cards.size() - 1);

  std::cout << CheckStable(input, cards) << "\\n";
  for (const auto &elem : cards) {
    std::cout << elem.first << " " << elem.second << "\\n";
  }
}


Error: TLE

Fixed submission:

#include <iostream>
#include <utility>
#include <vector>

int Partition(std::vector<std::pair<char, int>> &v, int p, int r) {
  int x = v[r].second;
  int i = p - 1;
  for (int j = p; j < r; ++j) {
    if (v[j].second <= x) {
      v[++i].swap(v[j]);
    }
  }
  v[i + 1].swap(v[r]);
  return i + 1;
}

void QuickSort(std::vector<std::pair<char, int>> &v, int p, int r) {
  if (p < r) {
    int q = Partition(v, p, r);
    QuickSort(v, p, q - 1);
    QuickSort(v, q + 1, r);
  }
}

constexpr int fIndex = -3;

int BinarySearch(std::vector<std::pair<char, int>> &v, int key) {
  int left = 0;
  int right = v.size();
  int mid;
  // std::cout << key << ": ";
  while (left < right) {
    mid = (left + right) / 2;
    if (v[mid].second == key) {
      // std::cout << key;
      return mid;
    } else if (key < v[mid].second) {
      right = mid;
    } else {
      left = mid + 1;
    }

    if (key == 1) {
      // std::cout << v[mid] << " ";
    }
  }
  return fIndex;
}

// code below cause TLE
// std::string CheckStable( const std::vector<std::pair<char, int>>& initial,
// const std::vector<std::pair<char, int>>& sorted ){
//     int N = sorted.size();
//     int key;
//     for( int i = 0; i < N; ++i ){
//         if( sorted[i].second == sorted[i+1].second ){
//             key = sorted[i].second;
//             for( j = i+1; sorted[j] == key; ++j ){
//                 if( initial[i] )
//             }
//         }
//     }
//     return "Stable";
// }

std::string CheckStable(std::vector<std::pair<char, int>> &initial,
                        std::vector<std::pair<char, int>> &sorted) {
  int N = sorted.size();
  for (int i = 0; i < N; ++i) {
    for (int j = i + 1; j < N; ++j) {
      if (initial[i].second == initial[j].second) {
        for (int a = 0 /*BinarySearch( sorted, initial[i].second )*/; a < N;
             ++a) {
          for (int b = a + 1; b < N; ++b) {
            if (initial[i] == sorted[b] && initial[j] == sorted[a]) {
              return "Not stable";
            }
          }
        }
      }
    }
  }
  return "Stable";
}

int main() {
  int n;
  std::cin.tie(0);
  std::cin >> n;

  std::vector<std::pair<char, int>> cards(n);
  int number;
  char symbol;
  for (auto &elem : cards) {
    std::cin >> symbol >> number;
    elem = std::make_pair(symbol, number);
  }

  std::vector<std::pair<char, int>> input(cards);

  QuickSort(cards, 0, cards.size() - 1);

  std::cout << CheckStable(input, cards) << "\\n";
  for (const auto &elem : cards) {
    std::cout << elem.first << " " << elem.second << "\\n";
  }
}