test/str/z.test.cpp

• View this file on GitHub
• Last update: 2024-11-09 00:49:07+00:00
• Problem: https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_14_B

Depends on

• prelude.hpp
• str/z.hpp

Code

// competitive-verifier: PROBLEM https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_14_B

#include "str/z.hpp"

vector<int> occurences(char* s_first, char* s_last, char* p_first,
                       char* p_last, char sep = '$') {
  int n = s_last - s_first, m = p_last - p_first;
  vector<char> s(n + m + 1);
  copy(p_first, p_last, s.begin());
  s[m] = sep;
  copy(s_first, s_last, s.begin() + m + 1);
  auto z = z_algo(all(s));
  vector<int> res;
  res.reserve(max(0, n - m + 1));
  rep(i, n - m + 1) if (z[m + 1 + i] == m) res.push_back(i);
  return res;
}

char T[1000001], P[10001];

int main() {
  scanf("%s%s", T, P);
  int n = strlen(T);
  int m = strlen(P);
  for (int i : occurences(T, T + n, P, P + m)) printf("%d\n", i);
}

#line 1 "test/str/z.test.cpp"
// competitive-verifier: PROBLEM https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_14_B

#line 2 "prelude.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vc = vector<char>;
#define rep2(i, m, n) for (auto i = (m); i < (n); i++)
#define rep(i, n) rep2(i, 0, n)
#define repr2(i, m, n) for (auto i = (n); i-- > (m);)
#define repr(i, n) repr2(i, 0, n)
#define all(x) begin(x), end(x)
auto ndvec(int n, auto e) { return vector(n, e); }
auto ndvec(int n, auto ...e) { return vector(n, ndvec(e...)); }
auto comp_key(auto&& f) { return [&](auto&& a, auto&& b) { return f(a) < f(b); }; }
auto& max(const auto& a, const auto& b) { return a < b ? b : a; }
auto& min(const auto& a, const auto& b) { return b < a ? b : a; }
#if __cpp_lib_ranges
namespace R = std::ranges;
namespace V = std::views;
#endif
#line 3 "str/z.hpp"

// z[i] = max { k : s[..k) == s[i..i+k) }
template <class It>
vector<int> z_algo(It s, It s_last) {
  int n = s_last - s;
  vector<int> z(n);
  for (int i = 1, l = 0, r = 0; i < n; i++) {
    if (i < r) z[i] = min(z[i - l], r - i);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) z[i]++;
    if (r < i + z[i]) l = i, r = i + z[i];
  }
  return z;
}
#line 4 "test/str/z.test.cpp"

vector<int> occurences(char* s_first, char* s_last, char* p_first,
                       char* p_last, char sep = '$') {
  int n = s_last - s_first, m = p_last - p_first;
  vector<char> s(n + m + 1);
  copy(p_first, p_last, s.begin());
  s[m] = sep;
  copy(s_first, s_last, s.begin() + m + 1);
  auto z = z_algo(all(s));
  vector<int> res;
  res.reserve(max(0, n - m + 1));
  rep(i, n - m + 1) if (z[m + 1 + i] == m) res.push_back(i);
  return res;
}

char T[1000001], P[10001];

int main() {
  scanf("%s%s", T, P);
  int n = strlen(T);
  int m = strlen(P);
  for (int i : occurences(T, T + n, P, P + m)) printf("%d\n", i);
}

Test cases

Env	Name	Status	Elapsed	Memory
g++-12	00_sample_00.in	AC	13 ms	8 MB
g++-12	01_small_00.in	AC	12 ms	8 MB
g++-12	01_small_01.in	AC	12 ms	8 MB
g++-12	01_small_02.in	AC	11 ms	8 MB
g++-12	01_small_03.in	AC	12 ms	8 MB
g++-12	02_rand_00.in	AC	12 ms	8 MB
g++-12	02_rand_01.in	AC	12 ms	8 MB
g++-12	02_rand_02.in	AC	12 ms	8 MB
g++-12	02_rand_03.in	AC	12 ms	8 MB
g++-12	02_rand_04.in	AC	12 ms	8 MB
g++-12	02_rand_05.in	AC	12 ms	8 MB
g++-12	02_rand_06.in	AC	12 ms	8 MB
g++-12	02_rand_07.in	AC	14 ms	8 MB
g++-12	03_large_00.in	AC	12 ms	8 MB
g++-12	03_large_01.in	AC	12 ms	8 MB
g++-12	03_large_02.in	AC	13 ms	8 MB
g++-12	03_large_03.in	AC	15 ms	8 MB
g++-12	03_large_04.in	AC	40 ms	15 MB
g++-12	03_large_05.in	AC	40 ms	15 MB
g++-12	03_large_06.in	AC	40 ms	15 MB
g++-12	03_large_07.in	AC	35 ms	15 MB
g++-12	03_large_08.in	AC	41 ms	15 MB
g++-12	03_large_09.in	AC	30 ms	15 MB
g++-12	04_embedded_00.in	AC	39 ms	15 MB
g++-12	04_embedded_01.in	AC	38 ms	15 MB
g++-12	04_embedded_02.in	AC	40 ms	15 MB
g++-12	04_embedded_03.in	AC	39 ms	15 MB
g++-12	04_embedded_04.in	AC	37 ms	15 MB
g++-12	04_embedded_05.in	AC	36 ms	15 MB
g++-12	05_corner_00.in	AC	12 ms	8 MB
g++-12	05_corner_01.in	AC	12 ms	8 MB
g++-12	05_corner_02.in	AC	11 ms	8 MB
g++-12	05_corner_03.in	AC	112 ms	19 MB
g++-12	05_corner_04.in	AC	103 ms	19 MB
g++-12	05_corner_05.in	AC	41 ms	15 MB
g++-12	05_corner_06.in	AC	29 ms	15 MB

Back to top page