結果

問題 No.2454 Former < Latter
ユーザー ZrjaK
提出日時 2023-11-15 17:30:52
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 31,580 bytes
コンパイル時間 7,390 ms
コンパイル使用メモリ 345,920 KB
実行使用メモリ 11,004 KB
最終ジャッジ日時 2024-09-26 04:41:08
合計ジャッジ時間 11,541 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 16 TLE * 1 -- * 6
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#endif
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
template <class T> using pbds_set = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;
using Trie = trie<string, null_type, trie_string_access_traits<>, pat_trie_tag, trie_prefix_search_node_update>;
// template <class T> using heapq = __gnu_pbds::priority_queue<T, greater<T>, pairing_heap_tag>;
template <class T> using heapq = std::priority_queue<T, vector<T>, greater<T>>;
using ll   =                long long;
using u32  =                unsigned int;
using u64  =                unsigned long long;
using i128 =                __int128;
using u128 =                __uint128_t;
using f128 =                __float128;
using ld   =                long double;
using ui   =                unsigned int;
using ull  =                unsigned long long;
using pii  =                pair<int, int>;
using pll  =                pair<ll, ll>;
using pdd  =                pair<ld, ld>;
using vi   =                vector<int>;
using vvi  =                vector<vector<int>>;
using vll  =                vector<ll>;
using vvll =                vector<vector<ll>>;
using vpii =                vector<pii>;
using vpll =                vector<pll>;
template <class T>
constexpr T infty = 0;
template <>
constexpr int infty<int> = 1'000'000'000;
template <>
constexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;
template <>
constexpr u32 infty<u32> = infty<int>;
template <>
constexpr u64 infty<u64> = infty<ll>;
template <>
constexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;
template <>
constexpr double infty<double> = infty<ll>;
template <>
constexpr long double infty<long double> = infty<ll>;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = std::priority_queue<T>;
template <class T>
using pqg = std::priority_queue<T, vector<T>, greater<T>>;
#define vv(type, name, h, ...) \
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...)   \
  vector<vector<vector<type>>> name( \
      h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)       \
  vector<vector<vector<vector<type>>>> name( \
      a, vector<vector<vector<type>>>(       \
             b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
#define lb                  lower_bound
#define ub                  upper_bound
#define pb                  push_back
#define pf                  push_front
#define eb                  emplace_back
#define fi                  first
#define se                  second
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(_1, _2, _3, name, ...) name
#define rep1(n)             for(ll _ = 0; _ < n; ++_)
#define rep2(i, n)          for(ll i = 0; i < n; ++i)
#define rep3(i, a, b)       for(ll i = a; i < b; ++i)
#define rep4(i, a, b, c)    for(int i = a; i < b; i += c)
#define rep(...)            overload4(__VA_ARGS__, rep4, rep3, rep2, rep1) (__VA_ARGS__)
#define rrep1(n)            for(ll i = n; i--; )
#define rrep2(i, n)         for(ll i = n; i--; )
#define rrep3(i, a, b)      for(ll i = a; i > b; i--)
#define rrep4(i, a, b, c)   for(ll i = a; i > b; i -= c)
#define rrep(...)           overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1) (__VA_ARGS__)
#define each1(i, a)         for(auto&& i : a)
#define each2(x, y, a)      for(auto&& [x, y] : a)
#define each3(x, y, z, a)   for(auto&& [x, y, z] : a)
#define each(...)           overload4(__VA_ARGS__, each3, each2, each1) (__VA_ARGS__)
#define FOR1(a)             for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a)          for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b)       for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c)    for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a)           for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a)        for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b)     for (ll i = (b)-1; i >= ll(a); --i)
#define FOR(...)            overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1) (__VA_ARGS__)
#define FOR_R(...)          overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R) (__VA_ARGS__)
#define FOR_subset(t, s)    for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))
#define len(x)              (int)x.size()
#define elif                else if
#define all1(i)             begin(i), end(i)
#define all2(i, a)          begin(i), begin(i) + a
#define all3(i, a, b)       begin(i) + a, begin(i) + b
#define all(...)            overload3(__VA_ARGS__, all3, all2, all1) (__VA_ARGS__)
#define rall1(i)            rbegin(i), rend(i)
#define rall2(i, a)         rbegin(i), rbegin(i) + a
#define rall3(i, a, b)      rbegin(i) + a, rbegin(i) + b
#define rall(...)           overload3(__VA_ARGS__, rall3, rall2, rall1) (__VA_ARGS__)
#define mst(x, a)           memset(x, a, sizeof(x))
#define bitcnt(x)           (__builtin_popcountll(x))
#define endl                "\n"
#define MIN(v)              *min_element(all(v))
#define MAX(v)              *max_element(all(v))
#define LB(c, x)            distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x)            distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x)           sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
#define SORT(a)             sort(all(a))
#define REV(a)              reverse(all(a))
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
template<class T> auto max(const T& a){ return *max_element(all(a)); }
template<class T> auto min(const T& a){ return *min_element(all(a)); }
template <typename T, typename U>
T ceil(T x, U y) {
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U>
T floor(T x, U y) {
    return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T, typename U>
pair<T, T> divmod(T x, U y) {
    T q = floor(x, y);
    return {q, x - q * y};
}
template <typename T, typename U>
T SUM(const vector<U> &A) {
    T sum = 0;
    for (auto &&a: A) sum += a;
    return sum;
}
template <typename T, typename U>
vector<T> cumsum(vector<U> &A, int off = 1) {
    int N = A.size();
    vector<T> B(N + 1);
    for (int i = 0; i < N; i++) B[i + 1] = B[i] + A[i];
    if (off == 0) B.erase(B.begin());
    return B;
}
template <typename T>
vector<int> argsort(const vector<T> &A) {
  vector<int> ids(len(A));
  iota(all(ids), 0);
  sort(all(ids),
       [&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });
  return ids;
}
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
  vc<T> B(len(I));
  FOR(i, len(I)) B[i] = A[I[i]];
  return B;
}
template <typename T>
T POP(deque<T> &que) {
  T a = que.front();
  que.pop_front();
  return a;
}
template <typename T>
T POP(pq<T> &que) {
  T a = que.top();
  que.pop();
  return a;
}
template <typename T>
T POP(pqg<T> &que) {
  assert(!que.empty());
  T a = que.top();
  que.pop();
  return a;
}
template <typename T>
T POP(vc<T> &que) {
  assert(!que.empty());
  T a = que.back();
  que.pop_back();
  return a;
}
template <typename F>
ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {
  if (check_ok) assert(check(ok));
  while (abs(ok - ng) > 1) {
    auto x = (ng + ok) / 2;
    (check(x) ? ok : ng) = x;
  }
  return ok;
}
template <typename F>
double binary_search_real(F check, double ok, double ng, int iter = 100) {
  while (iter--) {
    double x = (ok + ng) / 2;
    (check(x) ? ok : ng) = x;
  }
  return (ok + ng) / 2;
}
template <class T, class S> inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S> inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
mt19937 rng( chrono::steady_clock::now().time_since_epoch().count() );
#define Ran(a, b) rng() % ( (b) - (a) + 1 ) + (a)
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }
    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
    size_t operator()(pair<uint64_t,uint64_t> x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x.first + FIXED_RANDOM) ^ (splitmix64(x.second + FIXED_RANDOM) >> 1);
    }
};
#define FASTIO
#include <unistd.h>
// https://judge.yosupo.jp/submission/21623
namespace fastio {
static constexpr uint32_t SZ = 1 << 17;
char ibuf[SZ];
char obuf[SZ];
char out[100];
// pointer of ibuf, obuf
uint32_t pil = 0, pir = 0, por = 0;
struct Pre {
  char num[10000][4];
  constexpr Pre() : num() {
    for (int i = 0; i < 10000; i++) {
      int n = i;
      for (int j = 3; j >= 0; j--) {
        num[i][j] = n % 10 | '0';
        n /= 10;
      }
    }
  }
} constexpr pre;
inline void load() {
  memcpy(ibuf, ibuf + pil, pir - pil);
  pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);
  pil = 0;
  if (pir < SZ) ibuf[pir++] = '\n';
}
inline void flush() {
  fwrite(obuf, 1, por, stdout);
  por = 0;
}
void rd(char &c) {
  do {
    if (pil + 1 > pir) load();
    c = ibuf[pil++];
  } while (isspace(c));
}
void rd(string &x) {
  x.clear();
  char c;
  do {
    if (pil + 1 > pir) load();
    c = ibuf[pil++];
  } while (isspace(c));
  do {
    x += c;
    if (pil == pir) load();
    c = ibuf[pil++];
  } while (!isspace(c));
}
template <typename T>
void rd_real(T &x) {
  string s;
  rd(s);
  x = stod(s);
}
template <typename T>
void rd_integer(T &x) {
  if (pil + 100 > pir) load();
  char c;
  do
    c = ibuf[pil++];
  while (c < '-');
  bool minus = 0;
  if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
    if (c == '-') { minus = 1, c = ibuf[pil++]; }
  }
  x = 0;
  while ('0' <= c) { x = x * 10 + (c & 15), c = ibuf[pil++]; }
  if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
    if (minus) x = -x;
  }
}
void rd(int &x) { rd_integer(x); }
void rd(ll &x) { rd_integer(x); }
void rd(i128 &x) { rd_integer(x); }
void rd(u32 &x) { rd_integer(x); }
void rd(u64 &x) { rd_integer(x); }
void rd(u128 &x) { rd_integer(x); }
void rd(double &x) { rd_real(x); }
void rd(long double &x) { rd_real(x); }
void rd(f128 &x) { rd_real(x); }
template <class T, class U>
void rd(pair<T, U> &p) {
  return rd(p.first), rd(p.second);
}
template <size_t N = 0, typename T>
void rd_tuple(T &t) {
  if constexpr (N < std::tuple_size<T>::value) {
    auto &x = std::get<N>(t);
    rd(x);
    rd_tuple<N + 1>(t);
  }
}
template <class... T>
void rd(tuple<T...> &tpl) {
  rd_tuple(tpl);
}
template <size_t N = 0, typename T>
void rd(array<T, N> &x) {
  for (auto &d: x) rd(d);
}
template <class T>
void rd(vc<T> &x) {
  for (auto &d: x) rd(d);
}
void read() {}
template <class H, class... T>
void read(H &h, T &... t) {
  rd(h), read(t...);
}
void wt(const char c) {
  if (por == SZ) flush();
  obuf[por++] = c;
}
void wt(const string s) {
  for (char c: s) wt(c);
}
void wt(const char *s) {
  size_t len = strlen(s);
  for (size_t i = 0; i < len; i++) wt(s[i]);
}
template <typename T>
void wt_integer(T x) {
  if (por > SZ - 100) flush();
  if (x < 0) { obuf[por++] = '-', x = -x; }
  int outi;
  for (outi = 96; x >= 10000; outi -= 4) {
    memcpy(out + outi, pre.num[x % 10000], 4);
    x /= 10000;
  }
  if (x >= 1000) {
    memcpy(obuf + por, pre.num[x], 4);
    por += 4;
  } else if (x >= 100) {
    memcpy(obuf + por, pre.num[x] + 1, 3);
    por += 3;
  } else if (x >= 10) {
    int q = (x * 103) >> 10;
    obuf[por] = q | '0';
    obuf[por + 1] = (x - q * 10) | '0';
    por += 2;
  } else
    obuf[por++] = x | '0';
  memcpy(obuf + por, out + outi + 4, 96 - outi);
  por += 96 - outi;
}
template <typename T>
void wt_real(T x) {
  ostringstream oss;
  oss << fixed << setprecision(15) << double(x);
  string s = oss.str();
  wt(s);
}
void wt(int x) { wt_integer(x); }
void wt(ll x) { wt_integer(x); }
void wt(i128 x) { wt_integer(x); }
void wt(u32 x) { wt_integer(x); }
void wt(u64 x) { wt_integer(x); }
void wt(u128 x) { wt_integer(x); }
void wt(double x) { wt_real(x); }
void wt(long double x) { wt_real(x); }
void wt(f128 x) { wt_real(x); }
template <class T, class U>
void wt(const pair<T, U> val) {
  wt(val.first);
  wt(' ');
  wt(val.second);
}
template <size_t N = 0, typename T>
void wt_tuple(const T t) {
  if constexpr (N < std::tuple_size<T>::value) {
    if constexpr (N > 0) { wt(' '); }
    const auto x = std::get<N>(t);
    wt(x);
    wt_tuple<N + 1>(t);
  }
}
template <class... T>
void wt(tuple<T...> tpl) {
  wt_tuple(tpl);
}
template <class T, size_t S>
void wt(const array<T, S> val) {
  auto n = val.size();
  for (size_t i = 0; i < n; i++) {
    if (i) wt(' ');
    wt(val[i]);
  }
}
template <class T>
void wt(const vector<T> val) {
  auto n = val.size();
  for (size_t i = 0; i < n; i++) {
    if (i) wt(' ');
    wt(val[i]);
  }
}
void print() { wt('\n'); }
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
  wt(head);
  if (sizeof...(Tail)) wt(' ');
  print(forward<Tail>(tail)...);
}
// gcc expansion. called automaticall after main.
void __attribute__((destructor)) _d() { flush(); }
} // namespace fastio
using fastio::read;
using fastio::print;
using fastio::flush;
#define INT(...)   \
  int __VA_ARGS__; \
  read(__VA_ARGS__)
#define LL(...)   \
  ll __VA_ARGS__; \
  read(__VA_ARGS__)
#define U32(...)   \
  u32 __VA_ARGS__; \
  read(__VA_ARGS__)
#define U64(...)   \
  u64 __VA_ARGS__; \
  read(__VA_ARGS__)
#define STR(...)      \
  string __VA_ARGS__; \
  read(__VA_ARGS__)
#define CHAR(...)   \
  char __VA_ARGS__; \
  read(__VA_ARGS__)
#define DBL(...)      \
  double __VA_ARGS__; \
  read(__VA_ARGS__)
#define VEC(type, name, size) \
  vector<type> name(size);    \
  read(name)
#define VV(type, name, h, w)                     \
  vector<vector<type>> name(h, vector<type>(w)); \
  read(name)
void YES(bool t = 1) { print(t ? "YES" : "NO"); }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { print(t ? "Yes" : "No"); }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { print(t ? "yes" : "no"); }
void no(bool t = 1) { yes(!t); }
const i128 ONE = 1;
template <typename Iterable>
auto print_all(const Iterable& v, std::string sep = " ", std::string end = "\n") -> decltype(fastio::wt(*v.begin())) {
    for (auto it = v.begin(); it != v.end();) {
        fastio::wt(*it);
        if (++it != v.end()) fastio::wt(sep);
    }
    fastio::wt(end);
}
ll gcd(ll x, ll y) {
    if(!x) return y;
    if(!y) return x;
    int t = __builtin_ctzll(x | y);
    x >>= __builtin_ctzll(x);
    do {
        y >>= __builtin_ctzll(y);
        if (x > y) swap(x, y);
        y -= x;
    } while (y);
    return x << t;
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
ll exgcd(ll a, ll b, ll &x, ll &y) {
    if(!b) return x = 1, y = 0, a;
    ll d = exgcd(b, a % b, x, y);
    ll t = x;
    x = y;
    y = t - a / b * x;
    return d;
}
ll max(ll x, ll y) { return x > y ? x : y; }
ll min(ll x, ll y) { return x < y ? x : y; }
ll Mod(ll x, int mod) { return (x % mod + mod) % mod; }
ll pow(ll x, ll y, ll mod){
    ll res = 1, cur = x;
    while (y) {
        if (y & 1) res = res * cur % mod;
        cur = ONE * cur * cur % mod;
        y >>= 1;
    }
    return res % mod;
}
ll probabilityMod(ll x, ll y, ll mod) {
    return x * pow(y, mod-2, mod) % mod;
}
vvi getGraph(int n, int m, bool directed = false) {
    vvi res(n);
    rep(_, 0, m) {
        INT(u, v);
        u--, v--;
        res[u].emplace_back(v);
        if(!directed) res[v].emplace_back(u);
    }
    return res;
}
vector<vpii> getWeightedGraph(int n, int m, bool directed = false) {
    vector<vpii> res(n);
    rep(_, 0, m) {
        INT(u, v, w);
        u--, v--;
        res[u].emplace_back(v, w);
        if(!directed) res[v].emplace_back(u, w);
    }
    return res;
}
template <class... Args> auto ndvector(size_t n, Args &&...args) {
    if constexpr (sizeof...(args) == 1) {
        return vector(n, args...);
    } else {
        return vector(n, ndvector(args...));
    }
}
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
const int INF = 0x3fffffff;
const int MOD = 1000000007;
const int MODD = 998244353;
const int N = 1e6 + 10;
template<typename Val, typename Compare = std::less<Val>, int BlockSize = 10>
class DirectRMQ {
public:
    typedef int Index;  //今のところ大きくともintを仮定している(queryとか)
    typedef char InBlockIndex;
    typedef InBlockIndex(*BlockTypeRef)[BlockSize];
    DirectRMQ(Compare comp_ = Compare()) :
        blockTypes(0), innerBlockTable(0), sparseTable(0) {
        comp = comp_;
        calcBallotNumbers();
        buildInnerBlockTable();
    }
    ~DirectRMQ() {
        delete[] innerBlockTable;
        delete[] blockTypes; delete[] sparseTable;
    }
    void build(const Val *a, Index n) {
        blocks = (n + BlockSize - 1) / BlockSize;
        stHeight = 0; while(1 << stHeight < blocks) ++ stHeight;
        delete[] blockTypes; delete[] sparseTable;
        blockTypes = new BlockTypeRef[blocks];
        calcBlockTypes(a, n);
        buildInnerBlockTable(a, n);
        sparseTable = new Index[blocks * stHeight];
        buildSparseTable(a);
    }
    //[l,r]の閉区間
    Index query(const Val *a, Index l, Index r) const {
        Index x = l / BlockSize, y = r / BlockSize, z = y - x;
        if(z == 0) return x * BlockSize + blockTypes[x][l % BlockSize][r % BlockSize];
        if(z == 1) return assumeleft_minIndex(a,
            x * BlockSize + blockTypes[x][l % BlockSize][BlockSize - 1],
            y * BlockSize + blockTypes[y][0][r % BlockSize]);
        z -= 2;
        Index k = 0, s;
        s = ((z & 0xffff0000) != 0) << 4; z >>= s; k |= s;
        s = ((z & 0x0000ff00) != 0) << 3; z >>= s; k |= s;
        s = ((z & 0x000000f0) != 0) << 2; z >>= s; k |= s;
        s = ((z & 0x0000000c) != 0) << 1; z >>= s; k |= s;
        s = ((z & 0x00000002) != 0) << 0; z >>= s; k |= s;
        return assumeleft_minIndex(a
            , assumeleft_minIndex(a,
                x * BlockSize + blockTypes[x][l % BlockSize][BlockSize - 1],
                sparseTable[x + 1 + blocks * k])
            , assumeleft_minIndex(a,
                sparseTable[y + blocks * k - (1 << k)],
                y * BlockSize + blockTypes[y][0][r % BlockSize])
            );
    }
    Val queryVal(const Val *a, Index l, Index r) const {
        Index x = l / BlockSize, y = r / BlockSize, z = y - x;
        if(z == 0) return a[x * BlockSize + blockTypes[x][l % BlockSize][r % BlockSize]];
        Val edge = minVal(
            a[x * BlockSize + blockTypes[x][l % BlockSize][BlockSize - 1]],
            a[y * BlockSize + blockTypes[y][0][r % BlockSize]]);
        if(z == 1) return edge;
        z -= 2;
        Index k = 0, s;
        s = ((z & 0xffff0000) != 0) << 4; z >>= s; k |= s;
        s = ((z & 0x0000ff00) != 0) << 3; z >>= s; k |= s;
        s = ((z & 0x000000f0) != 0) << 2; z >>= s; k |= s;
        s = ((z & 0x0000000c) != 0) << 1; z >>= s; k |= s;
        s = ((z & 0x00000002) != 0) << 0; z >>= s; k |= s;
        return minVal(edge, minVal(
            a[sparseTable[x + 1 + blocks * k]],
            a[sparseTable[y + blocks * k - (1 << k)]]));
    }
private:
    Compare comp;
    int ballotNumbers[BlockSize + 1][BlockSize + 1];
    InBlockIndex(*innerBlockTable)[BlockSize][BlockSize];
    Index blocks;
    int stHeight;
    BlockTypeRef *blockTypes;
    Index *sparseTable;
    inline Index minIndex(const Val *a, Index x, Index y) const {
        return comp(a[x], a[y]) || (a[x] == a[y] && x < y) ? x : y;
    }
    inline Index assumeleft_minIndex(const Val *a, Index x, Index y) const {
        return comp(a[y], a[x]) ? y : x;
    }
    inline Val minVal(Val x, Val y) const {
        return comp(y, x) ? y : x;
    }
    void buildSparseTable(const Val *a) {
        Index *b = sparseTable;
        if(stHeight) for(Index i = 0; i < blocks; i ++)
            b[i] = i * BlockSize + blockTypes[i][0][BlockSize - 1];
        for(Index t = 1; t * 2 < blocks; t *= 2) {
            std::memcpy(b + blocks, b, blocks * sizeof(Index));
            b += blocks;
            for(Index i = 0; i < blocks - t; ++ i)
                b[i] = assumeleft_minIndex(a, b[i], b[i + t]);
        }
    }
    void buildInnerBlockTable(const Val *a, Index n) {
        for(Index i = 0; i < blocks; i ++) {
            BlockTypeRef table = blockTypes[i];
            if(table[0][0] != -1) continue;
            const Val *p = getBlock(a, n, i);
            for(InBlockIndex left = 0; left < BlockSize; left ++) {
                Val minV = p[left];
                InBlockIndex minI = left;
                for(InBlockIndex right = left; right < BlockSize; right ++) {
                    if(comp(p[right], minV)) {
                        minV = p[right];
                        minI = right;
                    }
                    table[left][right] = minI;
                }
            }
        }
    }
    //端っこのブロック用に関数内staticなテンポラリ配列を返す
    const Val *getBlock(const Val *a, Index n, Index i) {
        Index offset = i * BlockSize;
        if(offset + BlockSize <= n)
            return a + offset;
        else {
            static Val tmp_a[BlockSize];
            std::copy(a + offset, a + n, tmp_a);
            Val maxVal = Val();
            for(Index j = i; j < n; j ++)   //iでなくoffsetでは？(動作には問題ないし計算量もほとんど変わらないけれど…)(バグるのが嫌なので
                (今まで動いていたので)直すのは後にする)
                if(comp(maxVal, a[j])) maxVal = a[j];
            std::fill(tmp_a + (n - offset), tmp_a + BlockSize, maxVal);
            return tmp_a;
        }
    }
    void calcBlockTypes(const Val *a, Index n) {
        Val tmp_rp[BlockSize + 1];
        for(Index i = 0; i < blocks; i ++)
            blockTypes[i] = calcBlockType(getBlock(a, n, i), tmp_rp);
    }
    BlockTypeRef calcBlockType(const Val *a, Val *rp) {
        int q = BlockSize, N = 0;
        for(int i = 0; i < BlockSize; i ++) {
            while(q + i - BlockSize > 0 && comp(a[i], rp[q + i - BlockSize])) {
                N += ballotNumbers[BlockSize - i - 1][q];
                q --;
            }
            rp[q + i + 1 - BlockSize] = a[i];
        }
        return innerBlockTable[N];
    }
    void calcBallotNumbers() {
        for(int p = 0; p <= BlockSize; p ++) {
            for(int q = 0; q <= BlockSize; q ++) {
                if(p == 0 && q == 0)
                    ballotNumbers[p][q] = 1;
                else if(p <= q)
                    ballotNumbers[p][q] =
                    (q ? ballotNumbers[p][q - 1] : 0) +
                    (p ? ballotNumbers[p - 1][q] : 0);
                else
                    ballotNumbers[p][q] = 0;
            }
        }
    }
    void buildInnerBlockTable() {
        int numberOfTrees = ballotNumbers[BlockSize][BlockSize];
        innerBlockTable = new InBlockIndex[numberOfTrees][BlockSize][BlockSize];
        for(int i = 0; i < numberOfTrees; i ++)
            innerBlockTable[i][0][0] = -1;
    }
};
class SuffixArray {
public:
    typedef char Alpha;
    typedef int Index;
    void build(const Alpha *str, Index n, int AlphaSize);
    void build(const Alpha *str, Index n);
    void buildAll(const Alpha *str, Index n);
    inline Index getKThSuffix(Index k) const { return suffixArray[k]; }
    inline Index length() const { return static_cast<Index>(suffixArray.size() - 1); }
    std::vector<Index> suffixArray;
    template<typename AlphaT> void sa_is(const AlphaT *str, Index n, int AlphaSize, Index *sa, std::vector<Index> &bucketOffsets);
    template<typename AlphaT> void inducedSort(const AlphaT *str, Index n, int AlphaSize, const std::vector<bool> &types, Index *sa, std::vector
        <Index> &bucketOffsets);
    template<typename AlphaT> void countAlphabets(const AlphaT *str, Index n, int AlphaSize, std::vector<Index> &bucketOffsets, bool b = false);
    template<typename AlphaT> void getBucketOffsets(const AlphaT *str, Index n, bool dir, int AlphaSize, std::vector<Index> &bucketOffsets);
    void buildInverseSuffixArray();
    std::vector<Index> inverseSuffixArray;
    void computeLCPArray(const Alpha *str);
    std::vector<Index> lcpArray;
    typedef DirectRMQ<Index> LCPArrayRMQ;
    LCPArrayRMQ lcpArrayRMQ;
    void preprocessLCPArrayRMQ() {
        lcpArrayRMQ.build(&lcpArray[0], length() + 1);
    }
    Index computeLCP(Index i, Index j) const;
};
void SuffixArray::build(const Alpha *str, Index n, int AlphaSize) {
    suffixArray.resize(n + 1);
    if(n == 0) suffixArray[0] = 0;
    else {
        //I = sizeof(Index) * CHAR_BITS として
        //suffixArray + bucketOffsets + types + 関数ローカル変数
        //= n*I + max(AlphaSize, n/2)*I + 2*n + O(log n) bits
        //I = 4 * 32でAlphaSizeが十分小さいとすると:
        //(6+1/16) * n + O(log n) bytes
        std::vector<Index> bucketOffsets(std::max(AlphaSize, (n + 1) / 2) + 1);
        sa_is<Alpha>(str, n, AlphaSize, &suffixArray[0], bucketOffsets);
    }
}
void SuffixArray::build(const Alpha *str, Index n) {
    Alpha maxElem = *std::max_element(str, str + n);
    assert(maxElem + 0 < std::numeric_limits<int>::max());
    build(str, n, (int)(maxElem + 1));
}
void SuffixArray::buildAll(const Alpha *str, Index n) {
    build(str, n);
    buildInverseSuffixArray();
    computeLCPArray(str);
    preprocessLCPArrayRMQ();
}
//strは[0,n)が有効で番兵は含まれない。saは[0,n]が有効
template<typename AlphaT>
void SuffixArray::sa_is(const AlphaT *str, Index n, int AlphaSize, Index *sa, std::vector<Index> &bucketOffsets) {
    std::vector<bool> types(n + 1);
    types[n - 1] = 0; types[n] = 1;
    for(Index i = n - 2; i >= 0; i --)
        types[i] = str[i] < str[i + 1] || (str[i] == str[i + 1] && types[i + 1]);
    countAlphabets(str, n, AlphaSize, bucketOffsets);
    getBucketOffsets(str, n, true, AlphaSize, bucketOffsets);
    std::fill(sa, sa + n + 1, -1);
    for(Index i = 1; i < n; i ++)
        if(types[i] && !types[i - 1]) sa[-- bucketOffsets[(int)str[i]]] = i;
    sa[0] = n;
    inducedSort(str, n, AlphaSize, types, sa, bucketOffsets);
    Index n1 = 0;
    for(Index i = 0; i <= n; i ++) {
        Index j = sa[i];
        if(j > 0 && types[j] && !types[j - 1]) sa[n1 ++] = j;
    }
    //LMS substringsを番号付けする。sa[0..n1-1]にソートされている。
    //メモリのためにsaの右半分をバッファに利用する。
    //さらにそこでposの順序で整数ソートすることを同時に行う。
    //ここでLMS substringが連続して現れないことやLMS substringの数がn/2以下であることを利用してなんとか1つの配列でやる
    Index *buffer = sa + n1;
    std::fill(buffer, sa + n + 1, -1);
    Index uniqueLMSCount = 0, prevPos = -1;
    assert(sa[0] == n);
    buffer[sa[0] / 2] = uniqueLMSCount ++;  //'$'
    for(Index i = 1; i < n1; i ++) {
        Index pos = sa[i]; bool diff = false;
        if(prevPos == -1) diff = true;
        else for(Index j = pos, k = prevPos; ; j ++, k ++) {
            if(str[j] != str[k] || types[j] != types[k]) {
                diff = true;
                break;
            } else if(j != pos && ((types[j] && !types[j - 1]) || (types[k] && !types[k - 1])))
                break;
        }
        if(diff) {
            uniqueLMSCount ++;
            prevPos = pos;
        }
        buffer[pos / 2] = uniqueLMSCount - 1;
    }
    for(Index i = n, j = n; i >= n1; i --)
        if(sa[i] >= 0) sa[j --] = sa[i];
    Index *sa1 = sa, *s1 = sa + n + 1 - n1;
    if(uniqueLMSCount == n1)
        for(Index i = 0; i < n1; i ++) sa1[s1[i]] = i;
    else
        sa_is<Index>(s1, n1 - 1, uniqueLMSCount, sa1, bucketOffsets);
    countAlphabets(str, n, AlphaSize, bucketOffsets);
    getBucketOffsets(str, n, true, AlphaSize, bucketOffsets);
    for(Index i = 1, j = 0; i <= n; i ++)
        if(types[i] && !types[i - 1]) s1[j ++] = i;
    for(Index i = 0; i < n1; i ++) sa1[i] = s1[sa1[i]];
    std::fill(sa + n1, sa + n + 1, -1);
    for(Index i = n1 - 1; i >= 1; i --) {
        Index j = sa[i]; sa[i] = -1;
        sa[-- bucketOffsets[(int)str[j]]] = j;
    }
    inducedSort(str, n, AlphaSize, types, sa, bucketOffsets);
}
template<typename AlphaT>
void SuffixArray::inducedSort(const AlphaT *str, Index n, int AlphaSize, const std::vector<bool> &types, Index *sa, std::vector<Index> 
    &bucketOffsets) {
    getBucketOffsets(str, n, false, AlphaSize, bucketOffsets);
    for(Index i = 0; i < n; i ++) {
        Index j = sa[i] - 1;
        if(j >= 0 && !types[j]) sa[bucketOffsets[(int)str[j]] ++] = j;
    }
    getBucketOffsets(str, n, true, AlphaSize, bucketOffsets);
    for(Index i = n; i >= 1; i --) {
        Index j = sa[i] - 1;
        if(j >= 0 && types[j]) sa[-- bucketOffsets[(int)str[j]]] = j;
    }
}
template<typename AlphaT>
void SuffixArray::countAlphabets(const AlphaT *str, Index n, int AlphaSize, std::vector<Index> &bucketOffsets, bool b) {
    if(b || (int)bucketOffsets.size() / 2 >= AlphaSize) {
        std::vector<Index>::iterator alphabetCounts =
            b ? bucketOffsets.begin() : bucketOffsets.begin() + AlphaSize;
        std::fill(alphabetCounts, alphabetCounts + AlphaSize, 0);
        for(Index i = 0; i < n; i ++)
            alphabetCounts[(int)str[i]] ++;
    }
}
template<typename AlphaT>
void SuffixArray::getBucketOffsets(const AlphaT *str, Index n, bool dir, int AlphaSize, std::vector<Index> &bucketOffsets) {
    //AlphaSizeが大きい場合にはbucketOffset求めるたびにalphabetを数えてメモリ量を少なくし、
    //AlphaSizeが小さい場合にはbucketOffsetをalphabetCountsと別の場所に置くことにする。
    std::vector<Index>::iterator alphabetCounts;
    if((int)bucketOffsets.size() / 2 < AlphaSize) {
        countAlphabets(str, n, AlphaSize, bucketOffsets, true);
        alphabetCounts = bucketOffsets.begin();
    } else alphabetCounts = bucketOffsets.begin() + AlphaSize;
    Index cumsum = 1;   //'$'の分
    if(dir) {
        for(int i = 0; i < AlphaSize; i ++) {
            cumsum += alphabetCounts[i];
            bucketOffsets[i] = cumsum;
        }
    } else {
        for(int i = 0; i < AlphaSize; i ++) {
            Index x = alphabetCounts[i];
            bucketOffsets[i] = cumsum;
            cumsum += x;
        }
    }
}
void SuffixArray::buildInverseSuffixArray() {
    Index n = length();
    inverseSuffixArray.resize(n + 1);
    for(Index i = 0; i <= n; i ++)
        inverseSuffixArray[suffixArray[i]] = i;
}
void SuffixArray::computeLCPArray(const Alpha *str) {
    int n = length();
    lcpArray.resize(n + 2);
    Index h = 0;
    for(Index i = 0; i < n; i ++) {
        Index pos = inverseSuffixArray[i];
        Index j = suffixArray[pos - 1];
        Index hbound = std::min(n - j, n - i);
        for(Index k = 0; h < hbound && str[i + h] == str[j + h]; ++ h);
        lcpArray[pos - 1] = h;
        if(h > 0) -- h;
    }
    lcpArray[n] = lcpArray[n + 1] = 0;
}
SuffixArray::Index SuffixArray::computeLCP(Index i, Index j) const {
    Index n = length();
    if(i == j) return n - i;
    Index x = inverseSuffixArray[i], y = inverseSuffixArray[j];
    if(x > y) std::swap(x, y);
    return lcpArrayRMQ.queryVal(&lcpArray[0], x, y - 1);
}
// https://atcoder.jp/contests/arc050/submissions/682813
void solve() {
    INT(n);
    STR(s);
    SuffixArray sa;
    sa.buildAll(s.c_str(), n);
    int ans = 0;
    rep(i, 1, n) {
        int t = sa.computeLCP(0, i);
        if (i < t) ans++;
        elif (t == i) {
            if (i < n - i) ans++;
        } else {
            if (s[t] < s[i + t]) ans++;
        }
    }
    print(ans);
    
}
signed main() {
    int T = 1;
    read(T);
    while (T--) {
        solve();
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0