#909928 (C++23) No.2454 Former < Latter

提出ソース

結果

問題	No.2454 Former < Latter
ユーザー	risujiroh
提出日時	2023-09-01 22:24:53
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	69 ms / 2,000 ms
コード長	4,353 bytes
コンパイル時間	3,136 ms
コンパイル使用メモリ	259,804 KB
実行使用メモリ	8,416 KB
最終ジャッジ日時	2024-06-11 04:17:13
合計ジャッジ時間	5,348 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	66 ms 8,284 KB
testcase_03	AC	67 ms 8,412 KB
testcase_04	AC	64 ms 8,416 KB
testcase_05	AC	65 ms 8,408 KB
testcase_06	AC	62 ms 8,412 KB
testcase_07	AC	65 ms 8,408 KB
testcase_08	AC	29 ms 6,944 KB
testcase_09	AC	37 ms 6,944 KB
testcase_10	AC	41 ms 6,940 KB
testcase_11	AC	68 ms 8,408 KB
testcase_12	AC	68 ms 8,280 KB
testcase_13	AC	69 ms 8,412 KB
testcase_14	AC	68 ms 8,284 KB
testcase_15	AC	55 ms 6,940 KB
testcase_16	AC	55 ms 6,940 KB
testcase_17	AC	41 ms 6,940 KB
testcase_18	AC	22 ms 6,940 KB
testcase_19	AC	63 ms 8,408 KB
testcase_20	AC	64 ms 8,412 KB
testcase_21	AC	29 ms 6,940 KB
testcase_22	AC	36 ms 6,940 KB
testcase_23	AC	37 ms 6,940 KB

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

コンパイルメッセージ

In file included from main.cpp:7:
main.cpp: In instantiation of 'std::array<std::vector<unsigned int>, 2> RollingHash<2147482819>::base':
main.cpp:125:26:   required from 'RollingHash<P>::RollingHash(Iterator, Iterator) [with Iterator = __gnu_cxx::__normal_iterator<char*, std::__cxx11::basic_string<char> >; unsigned int P = 2147482819]'
main.cpp:17:36:   required from here
main.cpp:118:65: warning: narrowing conversion of '(RollingHash<2147482819>::rng_.std::mersenne_twister_engine<long unsigned int, 32, 624, 397, 31, 2567483615, 11, 4294967295, 7, 2636928640, 15, 4022730752, 18, 1812433253>::operator()() % 2147482819)' from 'std::mersenne_twister_engine<long unsigned int, 32, 624, 397, 31, 2567483615, 11, 4294967295, 7, 2636928640, 15, 4022730752, 18, 1812433253>::result_type' {aka 'long unsigned int'} to 'unsigned int' [-Wnarrowing]
  118 |   static inline std::array base{std::vector<uint32_t>{1, rng_() % P},
      |                                                          ~~~~~~~^~~
main.cpp:118:65: warning: narrowing conversion of '(RollingHash<2147482819>::rng_.std::mersenne_twister_engine<long unsigned int, 32, 624, 397, 31, 2567483615, 11, 4294967295, 7, 2636928640, 15, 4022730752, 18, 1812433253>::operator()() % 2147482819)' from 'std::mersenne_twister_engine<long unsigned int, 32, 624, 397, 31, 2567483615, 11, 4294967295, 7, 2636928640, 15, 4022730752, 18, 1812433253>::result_type' {aka 'long unsigned int'} to 'unsigned int' [-Wnarrowing]
main.cpp:119:65: warning: narrowing conversion of '(RollingHash<2147482819>::rng_.std::mersenne_twister_engine<long unsigned int, 32, 624, 397, 31, 2567483615, 11, 4294967295, 7, 2636928640, 15, 4022730752, 18, 1812433253>::operator()() % 2147482819)' from 'std::mersenne_twister_engine<long unsigned int, 32, 624, 397, 31, 2567483615, 11, 4294967295, 7, 2636928640, 15, 4022730752, 18, 1812433253>::result_type' {aka 'long unsigned int'} to 'unsigned int' [-Wnarrowing]
  119 |                                 std::vector<uint3

ソースコード

raw source code

#if __INCLUDE_LEVEL__ == 0

#include <bits/stdc++.h>

using namespace std;

#include __BASE_FILE__

namespace {

void solve() {
  int n;
  cin >> n;
  string s;
  cin >> s;
  int ans = 0;
  RollingHash rh(s.begin(), s.end());
  for (int i : rep(1, n)) {
    ans += strcmp(rh, 0, i, rh, i, n) < 0;
  }
  print(ans);
}

}  // namespace

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}

#else  // __INCLUDE_LEVEL__

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = forward<U>(y), true);
}

namespace std {

template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}

template <class... Ts>
istream& operator>>(istream& is, tuple<Ts...>& t) {
  return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

template <class... Ts>
istream& operator>>(istream& is, tuple<Ts&...>&& t) {
  return is >> t;
}

template <class R, enable_if_t<!is_convertible_v<R, string>>* = nullptr>
auto operator>>(istream& is, R&& r) -> decltype(is >> *begin(r)) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << p.first << ' ' << p.second;
}

template <class... Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
  auto f = [&os](const auto&... xs) -> ostream& {
    [[maybe_unused]] auto sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

template <class R, enable_if_t<!is_convertible_v<R, string_view>>* = nullptr>
auto operator<<(ostream& os, R&& r) -> decltype(os << *begin(r)) {
  auto sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

}  // namespace std

template <class... Ts>
void print(Ts&&... xs) {
  cout << tie(xs...) << '\n';
}

inline auto rep(int l, int r) { return views::iota(min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }
inline auto per(int l, int r) { return rep(l, r) | views::reverse; }
inline auto per(int n) { return per(0, n); }
inline auto per1(int l, int r) { return per(l, r + 1); }
inline auto per1(int n) { return per(1, n + 1); }

template <uint32_t P = 2147482819>
struct RollingHash {
  static inline std::mt19937 rng_{
      uint32_t(std::chrono::steady_clock::now().time_since_epoch().count())};
  static inline std::array base{std::vector<uint32_t>{1, rng_() % P},
                                std::vector<uint32_t>{1, rng_() % P}};
  std::array<std::vector<uint32_t>, 2> h;
  RollingHash() { h[0] = h[1] = {0}; }
  template <class Iterator>
  RollingHash(Iterator first, Iterator last) {
    int n = std::distance(first, last);
    for (int z : {0, 1}) base[z].reserve(n + 1), h[z].reserve(n + 1);
    for (h[0] = h[1] = {0}; first != last;) push_back(*first++);
  }
  template <class T>
  void push_back(const T& a) {
    for (int z : {0, 1}) {
      h[z].push_back((uint64_t(h[z].back()) * base[z][1] + a) % P);
      while (base[z].size() < h[z].size())
        base[z].push_back(uint64_t(base[z].back()) * base[z][1] % P);
    }
  }
  void pop_back() {
    for (int z : {0, 1}) h[z].pop_back();
  }
  int get(int l, int r, int z) const {
    return (h[z][r] + uint64_t(P - h[z][l]) * base[z][r - l]) % P;
  }
  std::array<int, 2> get(int l, int r) const {
    return {get(l, r, 0), get(l, r, 1)};
  }

  friend int lcp(const RollingHash& ha, int la, int ra, const RollingHash& hb,
                 int lb, int rb) {
    int ok = 0, ng = std::min(ra - la, rb - lb) + 1;
    while (ng - ok > 1) {
      int mid = (ok + ng) / 2;
      (ha.get(la, la + mid) == hb.get(lb, lb + mid) ? ok : ng) = mid;
    }
    return ok;
  }
  friend int strcmp(const RollingHash& ha, int la, int ra,
                    const RollingHash& hb, int lb, int rb) {
    int m = lcp(ha, la, ra, hb, lb, rb);
    if (la + m == ra && lb + m == rb) return 0;
    if (la + m == ra) return -1;
    if (lb + m == rb) return +1;
    return ha.get(la + m, la + m + 1, 0) - hb.get(lb + m, lb + m + 1, 0);
  }
};

#endif  // __INCLUDE_LEVEL__

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード