#826719 (C++17) No.5010 Better Mo's Algorithm is Needed!! (Unweighted)

提出ソース

結果

問題	No.5010 Better Mo's Algorithm is Needed!! (Unweighted)
ユーザー	NyaanNyaan
提出日時	2022-12-18 19:45:58
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	37 ms / 5,000 ms
コード長	17,165 bytes
コンパイル時間	2,671 ms
実行使用メモリ	8,148 KB
スコア	17,889,240,134
最終ジャッジ日時	2022-12-18 19:46:45
合計ジャッジ時間	47,128 ms
ジャッジサーバーID （参考情報）	judge15 / judge14
	純コード判定しない問題か言語

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	30 ms 8,020 KB
testcase_01	AC	31 ms 7,964 KB
testcase_02	AC	32 ms 8,088 KB
testcase_03	AC	33 ms 8,076 KB
testcase_04	AC	32 ms 8,112 KB
testcase_05	AC	34 ms 7,964 KB
testcase_06	AC	32 ms 7,964 KB
testcase_07	AC	31 ms 7,976 KB
testcase_08	AC	31 ms 8,120 KB
testcase_09	AC	31 ms 8,092 KB
testcase_10	AC	36 ms 8,040 KB
testcase_11	AC	32 ms 8,076 KB
testcase_12	AC	32 ms 8,040 KB
testcase_13	AC	31 ms 8,000 KB
testcase_14	AC	31 ms 8,040 KB
testcase_15	AC	34 ms 8,032 KB
testcase_16	AC	32 ms 7,968 KB
testcase_17	AC	31 ms 8,036 KB
testcase_18	AC	32 ms 8,032 KB
testcase_19	AC	32 ms 8,040 KB
testcase_20	AC	31 ms 8,004 KB
testcase_21	AC	31 ms 8,084 KB
testcase_22	AC	32 ms 7,964 KB
testcase_23	AC	32 ms 7,972 KB
testcase_24	AC	34 ms 8,084 KB
testcase_25	AC	32 ms 7,972 KB
testcase_26	AC	32 ms 7,968 KB
testcase_27	AC	33 ms 8,032 KB
testcase_28	AC	33 ms 7,968 KB
testcase_29	AC	31 ms 8,044 KB
testcase_30	AC	33 ms 7,964 KB
testcase_31	AC	32 ms 7,968 KB
testcase_32	AC	31 ms 8,020 KB
testcase_33	AC	32 ms 8,020 KB
testcase_34	AC	32 ms 8,036 KB
testcase_35	AC	33 ms 7,968 KB
testcase_36	AC	32 ms 8,004 KB
testcase_37	AC	37 ms 7,972 KB
testcase_38	AC	32 ms 8,080 KB
testcase_39	AC	34 ms 8,124 KB
testcase_40	AC	33 ms 7,968 KB
testcase_41	AC	33 ms 7,964 KB
testcase_42	AC	33 ms 7,968 KB
testcase_43	AC	32 ms 8,084 KB
testcase_44	AC	32 ms 7,964 KB
testcase_45	AC	33 ms 8,004 KB
testcase_46	AC	33 ms 7,968 KB
testcase_47	AC	33 ms 7,968 KB
testcase_48	AC	35 ms 8,084 KB
testcase_49	AC	31 ms 8,004 KB
testcase_50	AC	33 ms 8,004 KB
testcase_51	AC	32 ms 8,032 KB
testcase_52	AC	33 ms 7,968 KB
testcase_53	AC	33 ms 7,968 KB
testcase_54	AC	33 ms 8,000 KB
testcase_55	AC	32 ms 7,968 KB
testcase_56	AC	32 ms 8,088 KB
testcase_57	AC	33 ms 8,032 KB
testcase_58	AC	33 ms 8,040 KB
testcase_59	AC	33 ms 7,968 KB
testcase_60	AC	33 ms 7,968 KB
testcase_61	AC	33 ms 8,040 KB
testcase_62	AC	33 ms 8,116 KB
testcase_63	AC	32 ms 7,960 KB
testcase_64	AC	31 ms 8,032 KB
testcase_65	AC	33 ms 7,960 KB
testcase_66	AC	32 ms 8,040 KB
testcase_67	AC	32 ms 8,112 KB
testcase_68	AC	31 ms 7,972 KB
testcase_69	AC	32 ms 7,964 KB
testcase_70	AC	32 ms 8,040 KB
testcase_71	AC	31 ms 7,968 KB
testcase_72	AC	36 ms 7,964 KB
testcase_73	AC	32 ms 8,020 KB
testcase_74	AC	32 ms 8,112 KB
testcase_75	AC	32 ms 8,088 KB
testcase_76	AC	32 ms 8,084 KB
testcase_77	AC	32 ms 7,960 KB
testcase_78	AC	33 ms 8,076 KB
testcase_79	AC	32 ms 8,004 KB
testcase_80	AC	32 ms 8,040 KB
testcase_81	AC	36 ms 7,968 KB
testcase_82	AC	32 ms 8,076 KB
testcase_83	AC	32 ms 8,000 KB
testcase_84	AC	32 ms 8,032 KB
testcase_85	AC	32 ms 7,964 KB
testcase_86	AC	34 ms 8,036 KB
testcase_87	AC	32 ms 7,964 KB
testcase_88	AC	32 ms 7,976 KB
testcase_89	AC	32 ms 7,968 KB
testcase_90	AC	33 ms 8,000 KB
testcase_91	AC	31 ms 8,076 KB
testcase_92	AC	32 ms 8,040 KB
testcase_93	AC	33 ms 8,020 KB
testcase_94	AC	33 ms 7,972 KB
testcase_95	AC	32 ms 7,964 KB
testcase_96	AC	32 ms 7,972 KB
testcase_97	AC	34 ms 8,000 KB
testcase_98	AC	33 ms 8,088 KB
testcase_99	AC	32 ms 8,040 KB
testcase_100	AC	32 ms 7,964 KB
testcase_101	AC	33 ms 8,088 KB
testcase_102	AC	32 ms 7,964 KB
testcase_103	AC	33 ms 7,960 KB
testcase_104	AC	33 ms 8,112 KB
testcase_105	AC	32 ms 7,972 KB
testcase_106	AC	33 ms 7,972 KB
testcase_107	AC	32 ms 8,004 KB
testcase_108	AC	33 ms 7,960 KB
testcase_109	AC	32 ms 7,964 KB
testcase_110	AC	32 ms 8,148 KB
testcase_111	AC	32 ms 7,968 KB
testcase_112	AC	32 ms 7,968 KB
testcase_113	AC	32 ms 8,004 KB
testcase_114	AC	32 ms 7,960 KB
testcase_115	AC	32 ms 8,036 KB
testcase_116	AC	36 ms 8,004 KB
testcase_117	AC	33 ms 7,972 KB
testcase_118	AC	33 ms 7,968 KB
testcase_119	AC	32 ms 8,036 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

/**
 *  date : 2022-12-18 19:45:45
 */

#define NDEBUG
using namespace std;

// intrinstic
#include <immintrin.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

// utility
namespace Nyaan {
using ll = long long;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;

template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
using vi = vector<int>;
using vl = vector<long long>;
using vd = V<double>;
using vs = V<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;

template <typename T, typename U>
struct P : pair<T, U> {
  template <typename... Args>
  P(Args... args) : pair<T, U>(args...) {}

  using pair<T, U>::first;
  using pair<T, U>::second;

  P &operator+=(const P &r) {
    first += r.first;
    second += r.second;
    return *this;
  }
  P &operator-=(const P &r) {
    first -= r.first;
    second -= r.second;
    return *this;
  }
  P &operator*=(const P &r) {
    first *= r.first;
    second *= r.second;
    return *this;
  }
  template <typename S>
  P &operator*=(const S &r) {
    first *= r, second *= r;
    return *this;
  }
  P operator+(const P &r) const { return P(*this) += r; }
  P operator-(const P &r) const { return P(*this) -= r; }
  P operator*(const P &r) const { return P(*this) *= r; }
  template <typename S>
  P operator*(const S &r) const {
    return P(*this) *= r;
  }
  P operator-() const { return P{-first, -second}; }
};

using pl = P<ll, ll>;
using pi = P<int, int>;
using vp = V<pl>;

constexpr int inf = 1001001001;
constexpr long long infLL = 4004004004004004004LL;

template <typename T>
int sz(const T &t) {
  return t.size();
}

template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}

template <typename T>
inline T Max(const vector<T> &v) {
  return *max_element(begin(v), end(v));
}
template <typename T>
inline T Min(const vector<T> &v) {
  return *min_element(begin(v), end(v));
}
template <typename T>
inline long long Sum(const vector<T> &v) {
  return accumulate(begin(v), end(v), 0LL);
}

template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}

constexpr long long TEN(int n) {
  long long ret = 1, x = 10;
  for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);
  return ret;
}

template <typename T, typename U>
pair<T, U> mkp(const T &t, const U &u) {
  return make_pair(t, u);
}

template <typename T>
vector<T> mkrui(const vector<T> &v, bool rev = false) {
  vector<T> ret(v.size() + 1);
  if (rev) {
    for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];
  } else {
    for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  }
  return ret;
};

template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}

template <typename F>
vector<int> mkord(int N,F f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}

template <typename T>
vector<int> mkinv(vector<T> &v) {
  int max_val = *max_element(begin(v), end(v));
  vector<int> inv(max_val + 1, -1);
  for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
  return inv;
}

vector<int> mkiota(int n) {
  vector<int> ret(n);
  iota(begin(ret), end(ret), 0);
  return ret;
}

template <typename T>
T mkrev(const T &v) {
  T w{v};
  reverse(begin(w), end(w));
  return w;
}

template <typename T>
bool nxp(vector<T> &v) {
  return next_permutation(begin(v), end(v));
}

template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;

}  // namespace Nyaan

// bit operation
namespace Nyaan {
__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {
  return _mm_popcnt_u64(a);
}
inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; }
template <typename T>
inline int gbit(const T &a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void sbit(T &a, int i, bool b) {
  if (gbit(a, i) != b) a ^= T(1) << i;
}
constexpr long long PW(int n) { return 1LL << n; }
constexpr long long MSK(int n) { return (1LL << n) - 1; }
}  // namespace Nyaan

// inout
namespace Nyaan {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  int s = (int)v.size();
  for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}

istream &operator>>(istream &is, __int128_t &x) {
  string S;
  is >> S;
  x = 0;
  int flag = 0;
  for (auto &c : S) {
    if (c == '-') {
      flag = true;
      continue;
    }
    x *= 10;
    x += c - '0';
  }
  if (flag) x = -x;
  return is;
}

istream &operator>>(istream &is, __uint128_t &x) {
  string S;
  is >> S;
  x = 0;
  for (auto &c : S) {
    x *= 10;
    x += c - '0';
  }
  return is;
}

ostream &operator<<(ostream &os, __int128_t x) {
  if (x == 0) return os << 0;
  if (x < 0) os << '-', x = -x;
  string S;
  while (x) S.push_back('0' + x % 10), x /= 10;
  reverse(begin(S), end(S));
  return os << S;
}
ostream &operator<<(ostream &os, __uint128_t x) {
  if (x == 0) return os << 0;
  string S;
  while (x) S.push_back('0' + x % 10), x /= 10;
  reverse(begin(S), end(S));
  return os << S;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u) {
  cin >> t;
  in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
  cout << t;
  if (sizeof...(u)) cout << sep;
  out(u...);
}

void outr() {}
template <typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
  cout << t;
  outr(u...);
}

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

}  // namespace Nyaan

// debug

#ifdef NyaanDebug
#define trc(...) (void(0))
#else
#define trc(...) (void(0))
#endif

#ifdef NyaanLocal
#define trc2(...) (void(0))
#else
#define trc2(...) (void(0))
#endif

// macro
#define each(x, v) for (auto&& x : v)
#define each2(x, y, v) for (auto&& [x, y] : v)
#define all(v) (v).begin(), (v).end()
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)
#define fi first
#define se second
#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }
#define die(...)             \
  do {                       \
    Nyaan::out(__VA_ARGS__); \
    return;                  \
  } while (0)

namespace Nyaan {
void solve();
}
int main() { Nyaan::solve(); }

//


using namespace std;

namespace fastio {
static constexpr int SZ = 1 << 17;
char inbuf[SZ], outbuf[SZ];
int in_left = 0, in_right = 0, out_right = 0;

struct Pre {
  char num[40000];
  constexpr Pre() : num() {
    for (int i = 0; i < 10000; i++) {
      int n = i;
      for (int j = 3; j >= 0; j--) {
        num[i * 4 + j] = n % 10 + '0';
        n /= 10;
      }
    }
  }
} constexpr pre;

inline void load() {
  int len = in_right - in_left;
  memmove(inbuf, inbuf + in_left, len);
  in_right = len + fread(inbuf + len, 1, SZ - len, stdin);
  in_left = 0;
}

inline void flush() {
  fwrite(outbuf, 1, out_right, stdout);
  out_right = 0;
}

inline void skip_space() {
  if (in_left + 32 > in_right) load();
  while (inbuf[in_left] <= ' ') in_left++;
}

inline void rd(char& c) {
  if (in_left + 32 > in_right) load();
  c = inbuf[in_left++];
}
template <typename T>
inline void rd(T& x) {
  if (in_left + 32 > in_right) load();
  char c;
  do c = inbuf[in_left++];
  while (c < '-');
  [[maybe_unused]] bool minus = false;
  if constexpr (is_signed<T>::value == true) {
    if (c == '-') minus = true, c = inbuf[in_left++];
  }
  x = 0;
  while (c >= '0') {
    x = x * 10 + (c & 15);
    c = inbuf[in_left++];
  }
  if constexpr (is_signed<T>::value == true) {
    if (minus) x = -x;
  }
}
inline void rd() {}
template <typename Head, typename... Tail>
inline void rd(Head& head, Tail&... tail) {
  rd(head);
  rd(tail...);
}

inline void wt(char c) {
  if (out_right > SZ - 32) flush();
  outbuf[out_right++] = c;
}
inline void wt(bool b) {
  if (out_right > SZ - 32) flush();
  outbuf[out_right++] = b ? '1' : '0';
}
inline void wt(const string &s) {
  if (out_right + s.size() > SZ - 32) flush();
  memcpy(outbuf + out_right, s.data(), sizeof(char) * s.size());
  out_right += s.size();
}
template <typename T>
inline void wt(T x) {
  if (out_right > SZ - 32) flush();
  if (!x) {
    outbuf[out_right++] = '0';
    return;
  }
  if constexpr (is_signed<T>::value == true) {
    if (x < 0) outbuf[out_right++] = '-', x = -x;
  }
  int i = 12;
  char buf[16];
  while (x >= 10000) {
    memcpy(buf + i, pre.num + (x % 10000) * 4, 4);
    x /= 10000;
    i -= 4;
  }
  if (x < 100) {
    if (x < 10) {
      outbuf[out_right] = '0' + x;
      ++out_right;
    } else {
      uint32_t q = (uint32_t(x) * 205) >> 11;
      uint32_t r = uint32_t(x) - q * 10;
      outbuf[out_right] = '0' + q;
      outbuf[out_right + 1] = '0' + r;
      out_right += 2;
    }
  } else {
    if (x < 1000) {
      memcpy(outbuf + out_right, pre.num + (x << 2) + 1, 3);
      out_right += 3;
    } else {
      memcpy(outbuf + out_right, pre.num + (x << 2), 4);
      out_right += 4;
    }
  }
  memcpy(outbuf + out_right, buf + i + 4, 12 - i);
  out_right += 12 - i;
}
inline void wt() {}
template <typename Head, typename... Tail>
inline void wt(Head&& head, Tail&&... tail) {
  wt(head);
  wt(forward<Tail>(tail)...);
}
template <typename... Args>
inline void wtn(Args&&... x) {
  wt(forward<Args>(x)...);
  wt('\n');
}

struct Dummy {
  Dummy() { atexit(flush); }
} dummy;

}  // namespace fastio
using fastio::rd;
using fastio::skip_space;
using fastio::wt;
using fastio::wtn;

namespace my_rand {
using i64 = long long;
using u64 = unsigned long long;

// [0, 2^64 - 1)
u64 rng() {
  static u64 _x =
      u64(chrono::duration_cast<chrono::nanoseconds>(
              chrono::high_resolution_clock::now().time_since_epoch())
              .count()) *
      10150724397891781847ULL;
  _x ^= _x << 7;
  return _x ^= _x >> 9;
}

// [l, r]
i64 rng(i64 l, i64 r) {
  assert(l <= r);
  return l + rng() % (r - l + 1);
}

// [l, r)
i64 randint(i64 l, i64 r) {
  assert(l < r);
  return l + rng() % (r - l);
}

// choose n numbers from [l, r) without overlapping
vector<i64> randset(i64 l, i64 r, i64 n) {
  assert(l <= r && n <= r - l);
  unordered_set<i64> s;
  for (i64 i = n; i; --i) {
    i64 m = randint(l, r + 1 - i);
    if (s.find(m) != s.end()) m = r - i;
    s.insert(m);
  }
  vector<i64> ret;
  for (auto& x : s) ret.push_back(x);
  return ret;
}

// [0.0, 1.0)
double rnd() { return rng() * 5.42101086242752217004e-20; }

template <typename T>
void randshf(vector<T>& v) {
  int n = v.size();
  for (int i = 1; i < n; i++) swap(v[i], v[randint(0, i + 1)]);
}

}  // namespace my_rand

using my_rand::randint;
using my_rand::randset;
using my_rand::randshf;
using my_rand::rnd;
using my_rand::rng;


struct Timer {
  chrono::high_resolution_clock::time_point st;

  Timer() { reset(); }

  void reset() { st = chrono::high_resolution_clock::now(); }

  chrono::milliseconds::rep elapsed() {
    auto ed = chrono::high_resolution_clock::now();
    return chrono::duration_cast<chrono::milliseconds>(ed - st).count();
  }
};
using namespace Nyaan;

struct Fast_Mo {
  int N, Q, width;
  vector<int> L, R, order;
  bool is_build;

  Fast_Mo(int _n, int _q) : N(_n), Q(_q), order(Q), is_build(false) {
    width = max<int>(1, 1.0 * N / max<double>(1.0, sqrt(Q / 2.0)));
    iota(begin(order), end(order), 0);
  }
  // [l, r)
  void insert(int l, int r) {
    assert(0 <= l and l <= r and r <= N);
    L.push_back(l), R.push_back(r);
  }

  void build() {
    sort();
    climb();
    is_build = true;
  }
  template <typename AL, typename AR, typename DL, typename DR, typename REM>
  void run(const AL &add_left, const AR &add_right, const DL &delete_left,
           const DR &delete_right, const REM &rem) {
    if (!is_build) build();
    int nl = 0, nr = 0;
    for (auto idx : order) {
      while (nl > L[idx]) add_left(--nl);
      while (nr < R[idx]) add_right(nr++);
      while (nl < L[idx]) delete_left(nl++);
      while (nr > R[idx]) delete_right(--nr);
      rem(idx);
    }
  }

 private:
  void sort() {
    assert((int)order.size() == Q);
    vector<int> cnt(N + 1), buf(Q);
    for (int i = 0; i < Q; i++) cnt[R[i]]++;
    for (int i = 1; i < (int)cnt.size(); i++) cnt[i] += cnt[i - 1];
    for (int i = 0; i < Q; i++) buf[--cnt[R[i]]] = i;
    vector<int> b(Q);
    for (int i = 0; i < Q; i++) b[i] = L[i] / width;
    cnt.resize(N / width + 1);
    fill(begin(cnt), end(cnt), 0);
    for (int i = 0; i < Q; i++) cnt[b[i]]++;
    for (int i = 1; i < (int)cnt.size(); i++) cnt[i] += cnt[i - 1];
    for (int i = 0; i < Q; i++) order[--cnt[b[buf[i]]]] = buf[i];
    for (int i = 0, j = 0; i < Q; i = j) {
      int bi = b[order[i]];
      j = i + 1;
      while (j != Q and bi == b[order[j]]) j++;
      if (!(bi & 1)) reverse(begin(order) + i, begin(order) + j);
    }
  }

  long long score() {
    long long res = L[order[0]] + R[order[0]];
    for (int i = 0; i < Q - 1; i++) res += dist(order[i], order[i + 1]);
    return res;
  }

  int dist(int i, int j) { return abs(L[i] - L[j]) + abs(R[i] - R[j]); }

  void climb(int iter = 3) {
    cerr << "width : " << width << endl;
    vector<int> d(Q - 1);
    for (int i = 0; i < Q - 1; i++) d[i] = dist(order[i], order[i + 1]);
    while (iter--) {
      cerr << "debug : " << score() << endl;
      for (int i = 1; i <= Q - 4; i++) {
        int pre1 = d[i - 1];
        int pre2 = d[i + 1];
        int pre3 = d[i + 2];
        int now1 = dist(order[i - 1], order[i + 1]);
        int now2 = dist(order[i], order[i + 2]);
        int now3 = dist(order[i - 1], order[i + 2]);
        int now4 = dist(order[i], order[i + 3]);
        if (now1 + now2 < pre1 + pre2) {
          swap(order[i], order[i + 1]);
          d[i - 1] = now1;
          d[i + 1] = now2;
        } else if (now3 + now4 < pre1 + pre3) {
          swap(order[i], order[i + 2]);
          swap(d[i], d[i + 1]);
          d[i - 1] = now3;
          d[i + 2] = now4;
        }
      }
    }
    cerr << "debug : " << score() << endl;
  }
};

constexpr int N = 200000;
constexpr int Q = 200000;

void q() {
  {
    int _d;
    rep(_, N + 4) rd(_d);
  }
  Fast_Mo mo{N, Q};
  int l, r;
  rep(i, Q) {
    rd(l, r);
    mo.insert(l - 1, r);
  }

  mo.build();
  rep(i, Q - 1) {
    wt(mo.order[i] + 1);
    wt(' ');
  }
  wt(mo.order.back() + 1);
  wt('\n');
}

void Nyaan::solve() {
  int t = 1;
  // in(t);
  while (t--) q();
}

yukicoder

結果

テストケース

ソースコード