Problem p03421 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef unsigned long long int ulint;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define RE return 0
// ios::sync_with_stdio(false);
// std::cin.tie(0);
//<< setprecision(20)
// const int mod=(int)998244353;
const llint big = (llint)(2.19e16) + 1;
const long double pai = 3.141592653589793238462643383279502884197;
const long double ena = 2.71828182845904523536;
const long double eps = 1e-7;
template <class T, class U> bool mineq(T &a, U b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T, class U> bool maxeq(T &a, U b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> void soun(T &ar) {
  sort(ar.begin(), ar.end());
  ar.erase(unique(ar.begin(), ar.end()), ar.end());
}
llint gcd(llint a, llint b) {
  if (a % b == 0) {
    return b;
  } else {
    return gcd(b, a % b);
  }
}
llint lcm(llint a, llint b) { return a / gcd(a, b) * b; }
template <class T, class U> auto LB(T &ve, U in) {
  return lower_bound(ve.begin(), ve.end(), in);
}
template <class T, class U> auto UB(T &ve, U in) {
  return upper_bound(ve.begin(), ve.end(), in);
}
template <class T, class U> auto LBI(T &ve, U in) {
  return LB(ve, in) - ve.begin();
}
template <class T, class U> auto UBI(T &ve, U in) {
  return UB(ve, in) - ve.begin();
}
template <class T> void SO(T &ve) { sort(ve.begin(), ve.end()); }
template <class T> void REV(T &ve) { reverse(ve.begin(), ve.end()); }
using pli = pair<llint, int>;
using daic = priority_queue<pli, vector<pli>, greater<pli>>;
int main(void) {
  llint n, A, B, i, j;
  cin >> n >> A >> B;
  if (A * B < n) {
    cout << "-1\n";
    RE;
  }
  if (n + 1 < A + B) {
    cout << "-1\n";
    RE;
  }
  vector<llint> mae; // 後で座圧する
  for (j = 0; j < A; j++) {
    mae.pub(A * (B - 1) + j);
  }
  for (i = B - 2; i >= 0; i--) {
    for (j = 0; j < A; j++) {
      if (j != 0 && (n - (int)mae.size()) <= i) {
        continue;
      }
      mae.pub(A * i + j);
    }
  }
  vector<llint> atu = mae;
  SO(atu);
  for (i = 0; i < n; i++) {
    cout << LBI(atu, mae[i]) + 1 << " ";
  }
  cout << endl;
  RE;
}

Fixed submission:
#include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef unsigned long long int ulint;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define RE return 0
// ios::sync_with_stdio(false);
// std::cin.tie(0);
//<< setprecision(20)
// const int mod=(int)998244353;
const llint big = (llint)(2.19e16) + 1;
const long double pai = 3.141592653589793238462643383279502884197;
const long double ena = 2.71828182845904523536;
const long double eps = 1e-7;
template <class T, class U> bool mineq(T &a, U b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T, class U> bool maxeq(T &a, U b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> void soun(T &ar) {
  sort(ar.begin(), ar.end());
  ar.erase(unique(ar.begin(), ar.end()), ar.end());
}
llint gcd(llint a, llint b) {
  if (a % b == 0) {
    return b;
  } else {
    return gcd(b, a % b);
  }
}
llint lcm(llint a, llint b) { return a / gcd(a, b) * b; }
template <class T, class U> auto LB(T &ve, U in) {
  return lower_bound(ve.begin(), ve.end(), in);
}
template <class T, class U> auto UB(T &ve, U in) {
  return upper_bound(ve.begin(), ve.end(), in);
}
template <class T, class U> auto LBI(T &ve, U in) {
  return LB(ve, in) - ve.begin();
}
template <class T, class U> auto UBI(T &ve, U in) {
  return UB(ve, in) - ve.begin();
}
template <class T> void SO(T &ve) { sort(ve.begin(), ve.end()); }
template <class T> void REV(T &ve) { reverse(ve.begin(), ve.end()); }
using pli = pair<llint, int>;
using daic = priority_queue<pli, vector<pli>, greater<pli>>;
int main(void) {
  llint n, A, B, i, j;
  cin >> n >> A >> B;
  if (A * B < n) {
    cout << "-1\n";
    RE;
  }
  if (n + 1 < A + B) {
    cout << "-1\n";
    RE;
  }
  vector<llint> mae; // 後で座圧する
  for (j = 0; j < A; j++) {
    mae.pub(A * (B - 1) + j);
  }
  for (i = B - 2; i >= 0; i--) {
    for (j = 0; j < A; j++) {
      if (j != 0 && (n - (int)mae.size()) <= i) {
        break;
      }
      mae.pub(A * i + j);
    }
  }
  vector<llint> atu = mae;
  SO(atu);
  for (i = 0; i < n; i++) {
    cout << LBI(atu, mae[i]) + 1 << " ";
  }
  cout << endl;
  RE;
}