test/verify/yosupo-zalgorithm.test.cpp

• View this file on GitHub
• Last update: 2024-07-28 19:56:12+09:00
• Problem: https://judge.yosupo.jp/problem/zalgorithm

Depends on

• Z Algorithm (string/z-algorithm.hpp)
• template/template.hpp

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/zalgorithm

#include "../../template/template.hpp"

#include "../../string/z-algorithm.hpp"

int main() {
  string s;
  cin >> s;
  cout << ZAlgorithm(s).get() << "\n";
}

#line 1 "test/verify/yosupo-zalgorithm.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/zalgorithm

#line 1 "template/template.hpp"
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

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

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

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

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(std::forward<F>(f)) {}

  template <typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};

template <typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{std::forward<F>(f)};
}
#line 4 "test/verify/yosupo-zalgorithm.test.cpp"

#line 1 "string/z-algorithm.hpp"
/**
 * @brief Z Algorithm
 * @see https://heno239.hatenablog.com/entry/2020/07/07/140651
 *
 */
template <typename T = char>
struct ZAlgorithm {
 private:
  vector<T> s;
  vector<int> deleted;
  vector<vector<int> > delete_hist;
  vector<int> z;
  queue<int> cur;

 public:
  ZAlgorithm() : delete_hist{{}} {}

  template <typename S>
  ZAlgorithm(const S &s) : ZAlgorithm() {
    for (auto &c : s) add(c);
  }

  void add(const T &c) {
    s.emplace_back(c);
    delete_hist.emplace_back();
    deleted.emplace_back(0);
    z.emplace_back(0);
    z[0]++;

    int len = (int)s.size();
    if (len == 1) return;
    if (s[0] == c)
      cur.emplace(len - 1);
    else
      deleted[len - 1] = 1;

    auto set = [&](int t, int len) {
      deleted[t] = 1;
      delete_hist[len].emplace_back(t);
      z[t] = len - t - 1;
    };

    while (not cur.empty()) {
      int t = cur.front();
      if (deleted[t]) {
        cur.pop();
      } else if (s[len - t - 1] == s.back()) {
        break;
      } else {
        set(t, len);
        cur.pop();
      }
    }

    if (not cur.empty()) {
      int t = cur.front();
      for (auto &p : delete_hist[len - t]) {
        set(p + t, len);
      }
    }
  }

  int get(int k) const { return deleted[k] ? z[k] : (int)s.size() - k; }

  int operator[](int k) const { return get(k); }

  vector<int> get() {
    vector<int> ret(s.size());
    for (int i = 0; i < (int)s.size(); i++) {
      ret[i] = get(i);
    }
    return ret;
  }
};
#line 6 "test/verify/yosupo-zalgorithm.test.cpp"

int main() {
  string s;
  cin >> s;
  cout << ZAlgorithm(s).get() << "\n";
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	all_same_00	AC	51 ms	26 MB
g++	all_same_01	AC	48 ms	26 MB
g++	all_same_02	AC	50 ms	26 MB
g++	all_same_03	AC	51 ms	26 MB
g++	all_same_04	AC	47 ms	26 MB
g++	binary_carry_00	AC	53 ms	27 MB
g++	binary_carry_01	AC	48 ms	27 MB
g++	example_00	AC	6 ms	3 MB
g++	example_01	AC	5 ms	3 MB
g++	example_02	AC	5 ms	3 MB
g++	example_03	AC	5 ms	3 MB
g++	fib_str_00	AC	50 ms	27 MB
g++	fib_str_01	AC	38 ms	22 MB
g++	fib_str_02	AC	37 ms	22 MB
g++	fib_str_03	AC	35 ms	22 MB
g++	fib_str_04	AC	47 ms	27 MB
g++	hack606_00	AC	6 ms	3 MB
g++	max_random_00	AC	41 ms	24 MB
g++	max_random_01	AC	42 ms	24 MB
g++	random_00	AC	35 ms	22 MB
g++	random_01	AC	41 ms	24 MB
g++	random_02	AC	10 ms	6 MB
g++	random_03	AC	38 ms	22 MB
g++	random_04	AC	30 ms	22 MB
g++	random_05	AC	33 ms	22 MB
g++	random_06	AC	39 ms	24 MB
g++	random_07	AC	14 ms	8 MB
g++	random_08	AC	28 ms	22 MB
g++	random_09	AC	14 ms	8 MB
clang++	all_same_00	AC	49 ms	26 MB
clang++	all_same_01	AC	51 ms	26 MB
clang++	all_same_02	AC	46 ms	26 MB
clang++	all_same_03	AC	50 ms	26 MB
clang++	all_same_04	AC	52 ms	26 MB
clang++	binary_carry_00	AC	53 ms	27 MB
clang++	binary_carry_01	AC	51 ms	27 MB
clang++	example_00	AC	6 ms	3 MB
clang++	example_01	AC	5 ms	3 MB
clang++	example_02	AC	5 ms	3 MB
clang++	example_03	AC	5 ms	3 MB
clang++	fib_str_00	AC	53 ms	27 MB
clang++	fib_str_01	AC	40 ms	22 MB
clang++	fib_str_02	AC	53 ms	22 MB
clang++	fib_str_03	AC	35 ms	22 MB
clang++	fib_str_04	AC	49 ms	26 MB
clang++	hack606_00	AC	6 ms	3 MB
clang++	max_random_00	AC	43 ms	24 MB
clang++	max_random_01	AC	43 ms	24 MB
clang++	random_00	AC	37 ms	22 MB
clang++	random_01	AC	41 ms	24 MB
clang++	random_02	AC	10 ms	6 MB
clang++	random_03	AC	38 ms	22 MB
clang++	random_04	AC	30 ms	22 MB
clang++	random_05	AC	31 ms	22 MB
clang++	random_06	AC	50 ms	24 MB
clang++	random_07	AC	14 ms	8 MB
clang++	random_08	AC	28 ms	22 MB
clang++	random_09	AC	14 ms	8 MB

Back to top page