#define PROBLEM "https://judge.yosupo.jp/problem/longest_common_substring"
#include "../../string/longest_common_extension.hpp"
#include <algorithm>
#include <cassert>
#include <cstdint>
#include "../../utilities/fast_io.hpp"
#include <string>
#include <vector>
namespace {
int naive_longest_common_extension(const std::string& text, int i, int j) {
int n = int(text.size());
int result = 0;
while (i + result < n && j + result < n && text[i + result] == text[j + result]) {
result++;
}
return result;
}
int sign(int value) {
if (value < 0) return -1;
if (value > 0) return 1;
return 0;
}
void test_fixed() {
std::string empty;
m1une::string::LongestCommonExtension<> empty_extension(empty);
assert(empty_extension.empty());
assert(empty_extension.longest_common_extension(0, 0) == 0);
assert(empty_extension.compare_suffix(0, 0) == 0);
assert(empty_extension.compare(0, 0, 0, 0) == 0);
assert(empty_extension.suffix_array().empty());
assert(empty_extension.rank().empty());
assert(empty_extension.lcp_array().empty());
std::string text = "banana";
m1une::string::LongestCommonExtension<> extension(text);
assert(extension.size() == 6);
assert(extension.sequence() == text);
assert(extension.longest_common_extension(1, 3) == 3);
assert(extension.longest_common_extension(2, 4) == 2);
assert(extension.longest_common_extension(0, 2) == 0);
assert(extension.longest_common_extension(6, 1) == 0);
assert(extension.longest_common_extension(2, 2) == 4);
assert(extension.longest_common_extension(1, 3, 2) == 2);
assert(extension.lcp(1, 3) == 3);
assert(extension(1, 3) == 3);
assert(extension.compare_suffix(1, 3) == 1);
assert(extension.compare_suffix(3, 1) == -1);
assert(extension.compare(1, 4, 3, 6) == 0);
assert(extension.compare(1, 5, 3, 6) == 1);
assert(extension.compare(0, 0, 1, 2) == -1);
std::vector<int> values;
values.push_back(2);
values.push_back(1);
values.push_back(2);
values.push_back(1);
values.push_back(2);
m1une::string::LongestCommonExtension<std::vector<int>> vector_extension(values);
assert(vector_extension.longest_common_extension(0, 2) == 3);
assert(vector_extension.longest_common_extension(1, 3) == 2);
assert(vector_extension.compare(0, 3, 2, 5) == 0);
}
void test_randomized() {
std::uint64_t state = 20240709;
auto random = [&state]() {
state ^= state << 7;
state ^= state >> 9;
return state;
};
for (int trial = 0; trial < 1500; trial++) {
int n = int(random() % 50);
std::string text(n, 'a');
for (char& character : text) character = char('a' + random() % 5);
m1une::string::LongestCommonExtension<> extension(text);
const std::vector<int>& suffixes = extension.suffix_array();
const std::vector<int>& rank = extension.rank();
for (int i = 0; i < n; i++) {
assert(0 <= suffixes[i] && suffixes[i] < n);
assert(rank[suffixes[i]] == i);
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
int expected = naive_longest_common_extension(text, i, j);
assert(extension.longest_common_extension(i, j) == expected);
int limit = int(random() % (n + 1));
assert(extension.longest_common_extension(i, j, limit) == std::min(expected, limit));
std::string suffix_i = text.substr(i);
std::string suffix_j = text.substr(j);
assert(extension.compare_suffix(i, j) == sign(suffix_i.compare(suffix_j)));
}
}
for (int query = 0; query < 200; query++) {
int l1 = int(random() % (n + 1));
int r1 = l1 + int(random() % (n - l1 + 1));
int l2 = int(random() % (n + 1));
int r2 = l2 + int(random() % (n - l2 + 1));
std::string first = text.substr(l1, r1 - l1);
std::string second = text.substr(l2, r2 - l2);
assert(extension.compare(l1, r1, l2, r2) == sign(first.compare(second)));
}
}
}
std::vector<int> combine_strings(const std::string& first, const std::string& second) {
std::vector<int> combined;
combined.reserve(first.size() + second.size() + 1);
for (unsigned char character : first) combined.push_back(int(character) + 2);
combined.push_back(1);
for (unsigned char character : second) combined.push_back(int(character) + 2);
return combined;
}
} // namespace
int main() {
m1une::utilities::FastInput fast_input;
m1une::utilities::FastOutput fast_output;
test_fixed();
test_randomized();
std::string first, second;
fast_input >> first >> second;
int n = int(first.size());
int m = int(second.size());
std::vector<int> combined = combine_strings(first, second);
m1une::string::LongestCommonExtension<std::vector<int>> extension(combined);
int best_first = 0;
int best_second = 0;
int best_length = 0;
const std::vector<int>& suffixes = extension.suffix_array();
for (int i = 0; i + 1 < int(suffixes.size()); i++) {
int a = suffixes[i];
int b = suffixes[i + 1];
bool a_first = a < n;
bool b_first = b < n;
bool a_second = n < a;
bool b_second = n < b;
if (a_first == b_first || a_second == b_second) continue;
if ((!a_first && !a_second) || (!b_first && !b_second)) continue;
int first_pos = a_first ? a : b;
int second_pos = a_first ? b - n - 1 : a - n - 1;
int length = extension.longest_common_extension(a, b);
length = std::min(length, n - first_pos);
length = std::min(length, m - second_pos);
if (length > best_length) {
best_length = length;
best_first = first_pos;
best_second = second_pos;
}
}
fast_output << best_first << ' ' << best_first + best_length << ' '
<< best_second << ' ' << best_second + best_length << '\n';
}
#line 1 "verify/string/longest_common_extension.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/longest_common_substring"
#line 1 "string/longest_common_extension.hpp"
#include <algorithm>
#include <cassert>
#include <string>
#include <utility>
#include <vector>
#line 1 "string/suffix_array.hpp"
#line 6 "string/suffix_array.hpp"
#include <numeric>
#line 8 "string/suffix_array.hpp"
#include <type_traits>
#line 10 "string/suffix_array.hpp"
namespace m1une {
namespace string {
namespace detail {
template <class Sequence>
std::vector<int> suffix_array_impl(const Sequence& sequence) {
int n = int(sequence.size());
if (n == 0) return {};
using Value = std::remove_cv_t<std::remove_reference_t<decltype(sequence[0])>>;
std::vector<Value> sorted(sequence.begin(), sequence.end());
std::sort(sorted.begin(), sorted.end());
sorted.erase(std::unique(sorted.begin(), sorted.end()), sorted.end());
int length = n + 1;
std::vector<int> order(length);
std::vector<int> rank(length);
std::vector<int> key(length);
key[n] = 0;
for (int i = 0; i < n; i++) {
key[i] = int(std::lower_bound(sorted.begin(), sorted.end(), sequence[i]) - sorted.begin()) + 1;
}
int alphabet = int(sorted.size()) + 1;
std::vector<int> count(std::max(length, alphabet), 0);
for (int value : key) count[value]++;
for (int i = 1; i < alphabet; i++) count[i] += count[i - 1];
for (int i = length - 1; i >= 0; i--) order[--count[key[i]]] = i;
int classes = 1;
rank[order[0]] = 0;
for (int i = 1; i < length; i++) {
if (key[order[i - 1]] != key[order[i]]) classes++;
rank[order[i]] = classes - 1;
}
std::vector<int> shifted(length);
std::vector<int> next_rank(length);
for (long long half = 1; half < length; half <<= 1) {
for (int i = 0; i < length; i++) {
long long position = order[i] - half;
if (position < 0) position += length;
shifted[i] = int(position);
}
count.assign(classes, 0);
for (int position : shifted) count[rank[position]]++;
for (int i = 1; i < classes; i++) count[i] += count[i - 1];
for (int i = length - 1; i >= 0; i--) {
int position = shifted[i];
order[--count[rank[position]]] = position;
}
int next_classes = 1;
next_rank[order[0]] = 0;
for (int i = 1; i < length; i++) {
int current = order[i];
int previous = order[i - 1];
int current_second = int((current + half) % length);
int previous_second = int((previous + half) % length);
if (
rank[current] != rank[previous] ||
rank[current_second] != rank[previous_second]
) {
next_classes++;
}
next_rank[current] = next_classes - 1;
}
rank.swap(next_rank);
classes = next_classes;
if (classes == length) break;
}
std::vector<int> suffixes(n);
for (int i = 0; i < n; i++) suffixes[i] = order[i + 1];
return suffixes;
}
} // namespace detail
template <class Sequence>
std::vector<int> suffix_array(const Sequence& sequence) {
return detail::suffix_array_impl(sequence);
}
inline std::vector<int> suffix_array(const std::string& text) {
std::vector<unsigned char> values;
values.reserve(text.size());
for (unsigned char character : text) values.push_back(character);
return detail::suffix_array_impl(values);
}
template <class Sequence>
std::vector<int> lcp_array(const Sequence& sequence, const std::vector<int>& suffixes) {
int n = int(sequence.size());
assert(int(suffixes.size()) == n);
if (n == 0) return {};
std::vector<int> rank(n);
for (int i = 0; i < n; i++) {
assert(0 <= suffixes[i] && suffixes[i] < n);
rank[suffixes[i]] = i;
}
std::vector<int> lcp(n - 1);
int common = 0;
for (int i = 0; i < n; i++) {
int position = rank[i];
if (position == n - 1) {
common = 0;
continue;
}
int j = suffixes[position + 1];
while (
i + common < n &&
j + common < n &&
sequence[i + common] == sequence[j + common]
) {
common++;
}
lcp[position] = common;
if (common > 0) common--;
}
return lcp;
}
} // namespace string
} // namespace m1une
#line 11 "string/longest_common_extension.hpp"
namespace m1une {
namespace string {
template <class Sequence = std::string>
struct LongestCommonExtension {
private:
Sequence _sequence;
std::vector<int> _suffix_array;
std::vector<int> _rank;
std::vector<int> _lcp;
std::vector<int> _log;
std::vector<std::vector<int>> _table;
int range_min(int left, int right) const {
assert(0 <= left && left < right && right <= int(_lcp.size()));
int k = _log[right - left];
return std::min(_table[k][left], _table[k][right - (1 << k)]);
}
void build() {
int n = int(_sequence.size());
_suffix_array = m1une::string::suffix_array(_sequence);
_rank.assign(n, 0);
for (int i = 0; i < n; i++) {
_rank[_suffix_array[i]] = i;
}
_lcp = m1une::string::lcp_array(_sequence, _suffix_array);
int m = int(_lcp.size());
_log.assign(m + 1, 0);
for (int i = 2; i <= m; i++) {
_log[i] = _log[i >> 1] + 1;
}
_table.clear();
if (m == 0) return;
_table.assign(_log[m] + 1, std::vector<int>());
_table[0] = _lcp;
for (int k = 1; k < int(_table.size()); k++) {
int width = 1 << k;
int half = width >> 1;
_table[k].resize(m - width + 1);
for (int i = 0; i + width <= m; i++) {
_table[k][i] = std::min(_table[k - 1][i], _table[k - 1][i + half]);
}
}
}
public:
LongestCommonExtension() = default;
explicit LongestCommonExtension(const Sequence& sequence) : _sequence(sequence) {
build();
}
explicit LongestCommonExtension(Sequence&& sequence) : _sequence(std::move(sequence)) {
build();
}
int size() const {
return int(_sequence.size());
}
bool empty() const {
return _sequence.empty();
}
const Sequence& sequence() const {
return _sequence;
}
const std::vector<int>& suffix_array() const {
return _suffix_array;
}
const std::vector<int>& rank() const {
return _rank;
}
const std::vector<int>& lcp_array() const {
return _lcp;
}
int longest_common_extension(int i, int j) const {
int n = size();
assert(0 <= i && i <= n);
assert(0 <= j && j <= n);
if (i == j) return n - i;
if (i == n || j == n) return 0;
int left = _rank[i];
int right = _rank[j];
if (left > right) std::swap(left, right);
return range_min(left, right);
}
int longest_common_extension(int i, int j, int limit) const {
assert(0 <= limit);
return std::min(longest_common_extension(i, j), limit);
}
int lcp(int i, int j) const {
return longest_common_extension(i, j);
}
int operator()(int i, int j) const {
return longest_common_extension(i, j);
}
int compare_suffix(int i, int j) const {
int n = size();
assert(0 <= i && i <= n);
assert(0 <= j && j <= n);
if (i == j) return 0;
int common = longest_common_extension(i, j);
if (i + common == n && j + common == n) return 0;
if (i + common == n) return -1;
if (j + common == n) return 1;
return _sequence[i + common] < _sequence[j + common] ? -1 : 1;
}
int compare(int l1, int r1, int l2, int r2) const {
int n = size();
assert(0 <= l1 && l1 <= r1 && r1 <= n);
assert(0 <= l2 && l2 <= r2 && r2 <= n);
int len1 = r1 - l1;
int len2 = r2 - l2;
int common = longest_common_extension(l1, l2, std::min(len1, len2));
if (common == len1 && common == len2) return 0;
if (common == len1) return -1;
if (common == len2) return 1;
return _sequence[l1 + common] < _sequence[l2 + common] ? -1 : 1;
}
};
} // namespace string
} // namespace m1une
#line 4 "verify/string/longest_common_extension.test.cpp"
#line 7 "verify/string/longest_common_extension.test.cpp"
#include <cstdint>
#line 1 "utilities/fast_io.hpp"
#line 5 "utilities/fast_io.hpp"
#include <array>
#include <cerrno>
#include <charconv>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#line 12 "utilities/fast_io.hpp"
#include <cstring>
#include <iterator>
#line 15 "utilities/fast_io.hpp"
#include <sys/stat.h>
#line 18 "utilities/fast_io.hpp"
#include <unistd.h>
#line 20 "utilities/fast_io.hpp"
namespace m1une {
namespace utilities {
struct FastOutput;
namespace internal {
// Shared with the convenience helpers in template.hpp.
inline FastOutput* standard_output_instance = nullptr;
// Detect std::begin(x), std::end(x).
template <class T, class = void>
struct is_range : std::false_type {};
template <class T>
struct is_range<T, std::void_t<
decltype(std::begin(std::declval<T&>())),
decltype(std::end(std::declval<T&>()))
>> : std::true_type {};
template <class T>
inline constexpr bool is_range_v = is_range<T>::value;
template <class T>
using range_reference_t = decltype(*std::begin(std::declval<T&>()));
template <class T>
using range_value_t = std::remove_cv_t<std::remove_reference_t<range_reference_t<T>>>;
template <class T, class = void>
struct range_stored_value {
using type = range_value_t<T>;
};
template <class T>
struct range_stored_value<T, std::void_t<typename std::remove_cv_t<std::remove_reference_t<T>>::value_type>> {
using type = typename std::remove_cv_t<std::remove_reference_t<T>>::value_type;
};
template <class T>
using range_stored_value_t = typename range_stored_value<T>::type;
// Treat strings and C strings as scalar output objects, not as ranges.
template <class T>
struct is_char_array : std::false_type {};
template <class T, std::size_t N>
struct is_char_array<T[N]>
: std::bool_constant<std::is_same_v<std::remove_cv_t<T>, char>> {};
template <class T>
struct is_string_like
: std::bool_constant<
std::is_same_v<std::decay_t<T>, std::string>
|| std::is_same_v<std::decay_t<T>, const char*>
|| std::is_same_v<std::decay_t<T>, char*>
|| is_char_array<std::remove_reference_t<T>>::value
> {};
template <class T>
inline constexpr bool is_string_like_v = is_string_like<T>::value;
// ModInt-like type: x.val() is printable, and x can be assigned from long long.
template <class T, class = void>
struct has_val_method : std::false_type {};
template <class T>
struct has_val_method<T, std::void_t<decltype(std::declval<const T&>().val())>>
: std::true_type {};
template <class T>
inline constexpr bool has_val_method_v = has_val_method<T>::value;
template <class T, class = void>
struct has_static_mod_raw : std::false_type {};
template <class T>
struct has_static_mod_raw<
T, std::void_t<decltype(T::mod()), decltype(T::raw(std::declval<uint32_t>()))>>
: std::true_type {};
template <class T>
inline constexpr bool has_static_mod_raw_v = has_static_mod_raw<T>::value;
// libstdc++ before GCC 16 does not classify __int128 as an integral type in
// strict ISO modes such as -std=c++23. Keep the fast-I/O interface independent
// of that implementation detail.
template <class T>
inline constexpr bool is_integral_v =
std::is_integral_v<T>
|| std::is_same_v<std::remove_cv_t<T>, __int128_t>
|| std::is_same_v<std::remove_cv_t<T>, __uint128_t>;
template <class T>
inline constexpr bool is_signed_v =
std::is_signed_v<T>
|| std::is_same_v<std::remove_cv_t<T>, __int128_t>;
template <class T>
struct make_unsigned {
using type = std::make_unsigned_t<T>;
};
template <>
struct make_unsigned<__int128_t> {
using type = __uint128_t;
};
template <>
struct make_unsigned<__uint128_t> {
using type = __uint128_t;
};
template <class T>
using make_unsigned_t = typename make_unsigned<std::remove_cv_t<T>>::type;
} // namespace internal
struct FastInput {
static constexpr int buffer_size = 1 << 20;
private:
std::FILE* _stream;
char _buffer[buffer_size];
int _position;
int _length;
int _file_descriptor;
bool _streaming;
bool refill() {
_position = 0;
if (_streaming) {
ssize_t length;
do {
length = ::read(_file_descriptor, _buffer, buffer_size);
} while (length < 0 && errno == EINTR);
if (length <= 0) {
_length = 0;
return false;
}
_length = int(length);
} else {
_length = int(std::fread(_buffer, 1, buffer_size, _stream));
}
return _length != 0;
}
template <class T>
bool read_integer_from_stream(T& value) {
if (!skip_spaces()) return false;
int c = read_char_raw();
bool negative = false;
if (c == '-') {
negative = true;
c = read_char_raw();
}
if constexpr (internal::is_signed_v<T>) {
T result = 0;
while ('0' <= c && c <= '9') {
result = negative ? result * 10 - (c - '0')
: result * 10 + (c - '0');
c = read_char_raw();
}
value = result;
} else {
T result = 0;
while ('0' <= c && c <= '9') {
result = result * 10 + T(c - '0');
c = read_char_raw();
}
value = negative ? T(0) - result : result;
}
return true;
}
bool prepare_number() {
if (_length - _position >= 64) return true;
const int remaining = _length - _position;
if (remaining > 0) std::memmove(_buffer, _buffer + _position, remaining);
const int added = int(std::fread(_buffer + remaining, 1, buffer_size - remaining, _stream));
_position = 0;
_length = remaining + added;
if (_length < buffer_size) _buffer[_length] = '\0';
return _length != 0;
}
public:
explicit FastInput(std::FILE* stream = stdin)
: _stream(stream),
_position(0),
_length(0),
_file_descriptor(::fileno(stream)),
_streaming([&] {
struct stat status;
return _file_descriptor >= 0
&& ::fstat(_file_descriptor, &status) == 0
&& !S_ISREG(status.st_mode);
}()) {}
FastInput(const FastInput&) = delete;
FastInput& operator=(const FastInput&) = delete;
int read_char_raw() {
if (_position == _length && !refill()) return EOF;
return _buffer[_position++];
}
bool skip_spaces() {
int c = read_char_raw();
while (c != EOF && c <= ' ') c = read_char_raw();
if (c == EOF) return false;
--_position;
return true;
}
bool read(char& value) {
if (!skip_spaces()) return false;
value = char(read_char_raw());
return true;
}
bool read(std::string& value) {
if (!skip_spaces()) return false;
value.clear();
while (true) {
const int begin = _position;
while (_position < _length &&
static_cast<unsigned char>(_buffer[_position]) > ' ') {
++_position;
}
value.append(_buffer + begin, _position - begin);
if (_position < _length) {
++_position;
return true;
}
if (!refill()) return true;
}
}
bool read(bool& value) {
int x;
if (!read(x)) return false;
value = x != 0;
return true;
}
template <class T>
std::enable_if_t<
internal::is_integral_v<T>
&& !std::is_same_v<std::remove_cv_t<T>, bool>
&& !std::is_same_v<std::remove_cv_t<T>, char>,
bool
>
read(T& value) {
if (_streaming) return read_integer_from_stream(value);
if (!prepare_number()) return false;
int c = static_cast<unsigned char>(_buffer[_position++]);
while (c <= ' ') c = static_cast<unsigned char>(_buffer[_position++]);
bool negative = false;
if (c == '-') {
negative = true;
c = static_cast<unsigned char>(_buffer[_position++]);
}
if constexpr (internal::is_signed_v<T>) {
T result = 0;
while ('0' <= c && c <= '9') {
const int first = c - '0';
const int second = static_cast<unsigned char>(_buffer[_position]) - '0';
if (0 <= second && second <= 9) {
result = negative ? result * 100 - (first * 10 + second)
: result * 100 + (first * 10 + second);
++_position;
} else {
result = negative ? result * 10 - first : result * 10 + first;
}
c = static_cast<unsigned char>(_buffer[_position++]);
}
value = result;
} else {
T result = 0;
while ('0' <= c && c <= '9') {
const unsigned first = unsigned(c - '0');
const int second = static_cast<unsigned char>(_buffer[_position]) - '0';
if (0 <= second && second <= 9) {
result = result * 100 + T(first * 10 + unsigned(second));
++_position;
} else {
result = result * 10 + T(first);
}
c = static_cast<unsigned char>(_buffer[_position++]);
}
value = negative ? T(0) - result : result;
}
if (_position > _length) _position = _length;
return true;
}
template <class T>
std::enable_if_t<std::is_floating_point_v<T>, bool>
read(T& value) {
if (!skip_spaces()) return false;
int c = read_char_raw();
bool negative = false;
if (c == '-' || c == '+') {
negative = c == '-';
c = read_char_raw();
}
long double result = 0;
while ('0' <= c && c <= '9') {
result = result * 10 + (c - '0');
c = read_char_raw();
}
if (c == '.') {
long double place = 0.1L;
c = read_char_raw();
while ('0' <= c && c <= '9') {
result += (c - '0') * place;
place *= 0.1L;
c = read_char_raw();
}
}
if (c == 'e' || c == 'E') {
c = read_char_raw();
bool exponent_negative = false;
if (c == '-' || c == '+') {
exponent_negative = c == '-';
c = read_char_raw();
}
int exponent = 0;
while ('0' <= c && c <= '9') {
exponent = exponent * 10 + (c - '0');
c = read_char_raw();
}
long double scale = 1;
long double power = 10;
while (exponent > 0) {
if (exponent & 1) scale *= power;
power *= power;
exponent >>= 1;
}
result = exponent_negative ? result / scale : result * scale;
}
value = static_cast<T>(negative ? -result : result);
return true;
}
template <class T>
std::enable_if_t<
internal::has_val_method_v<T>
&& !internal::is_integral_v<T>
&& !internal::is_range_v<T>,
bool
>
read(T& value) {
long long x;
if (!read(x)) return false;
if constexpr (internal::has_static_mod_raw_v<T>) {
if (x >= 0 && uint64_t(x) < uint64_t(T::mod())) {
value = T::raw(uint32_t(x));
} else {
value = T(x);
}
} else {
value = T(x);
}
return true;
}
template <class First, class Second>
bool read(std::pair<First, Second>& value) {
if (!read(value.first)) return false;
return read(value.second);
}
template <class Range>
std::enable_if_t<
internal::is_range_v<Range>
&& !internal::is_string_like_v<Range>,
bool
>
read(Range& range) {
using StoredValue = internal::range_stored_value_t<Range>;
constexpr bool nested = internal::is_range_v<StoredValue>
&& !internal::is_string_like_v<StoredValue>;
for (auto&& value : range) {
if constexpr (std::is_same_v<StoredValue, bool> && !nested) {
bool x;
if (!read(x)) return false;
value = x;
} else {
if (!read(value)) return false;
}
}
return true;
}
template <class First, class Second, class... Rest>
bool read(First& first, Second& second, Rest&... rest) {
if (!read(first)) return false;
return read(second, rest...);
}
template <class T>
FastInput& operator>>(T& value) {
if (!read(value)) std::abort();
return *this;
}
};
struct FastOutput {
static constexpr int buffer_size = 1 << 20;
private:
inline static const auto digit_quads = [] {
std::array<char, 40000> result{};
for (int i = 0; i < 10000; i++) {
int value = i;
for (int j = 3; j >= 0; j--) {
result[4 * i + j] = char('0' + value % 10);
value /= 10;
}
}
return result;
}();
std::FILE* _stream;
char _buffer[buffer_size];
int _position;
int _precision;
std::chars_format _float_format;
char _range_separator;
std::string* _capture = nullptr;
template <class T>
std::string format_cell(const T& value) {
std::string result;
struct CaptureGuard {
std::string*& target;
std::string* previous;
~CaptureGuard() { target = previous; }
} guard{_capture, _capture};
_capture = &result;
write(value);
return result;
}
template <class Matrix>
void write_aligned_matrix(const Matrix& matrix) {
std::vector<std::vector<std::string>> rows;
std::vector<std::size_t> widths;
for (const auto& row : matrix) {
auto& cells = rows.emplace_back();
std::size_t column = 0;
for (const auto& value : row) {
cells.push_back(format_cell(value));
if (column == widths.size()) widths.push_back(0);
widths[column] = std::max(widths[column], cells.back().size());
++column;
}
}
bool first = true;
for (const auto& row : rows) {
if (!first) write_char('\n');
first = false;
for (std::size_t column = 0; column < row.size(); ++column) {
if (column != 0) write_char(_range_separator);
for (std::size_t padding = row[column].size();
padding < widths[column]; ++padding) {
write_char(' ');
}
write(row[column]);
}
}
}
public:
explicit FastOutput(std::FILE* stream = stdout)
: _stream(stream),
_position(0),
_precision(6),
_float_format(std::chars_format::general),
_range_separator(' ') {
if (_stream == stdout
&& internal::standard_output_instance == nullptr) {
internal::standard_output_instance = this;
}
}
FastOutput(const FastOutput&) = delete;
FastOutput& operator=(const FastOutput&) = delete;
~FastOutput() {
flush();
if (internal::standard_output_instance == this) {
internal::standard_output_instance = nullptr;
}
}
void flush() {
if (_position != 0) {
std::fwrite(_buffer, 1, _position, _stream);
_position = 0;
}
std::fflush(_stream);
}
void write_char(char c) {
if (_capture != nullptr) {
_capture->push_back(c);
return;
}
if (_position == buffer_size) flush();
_buffer[_position++] = c;
}
void write(const char* s) {
while (*s != '\0') write_char(*s++);
}
void write(const std::string& s) {
if (_capture != nullptr) {
_capture->append(s);
return;
}
std::size_t position = 0;
while (position < s.size()) {
if (_position == buffer_size) flush();
const std::size_t copied =
std::min<std::size_t>(buffer_size - _position, s.size() - position);
std::memcpy(_buffer + _position, s.data() + position, copied);
_position += int(copied);
position += copied;
}
}
void write(char c) {
write_char(c);
}
void write(bool value) {
write_char(value ? '1' : '0');
}
template <class T>
std::enable_if_t<std::is_floating_point_v<T>>
write(T value) {
char digits[128];
auto [end, error] = std::to_chars(
digits,
digits + sizeof(digits),
value,
_float_format,
_precision
);
if (error != std::errc()) std::abort();
for (const char* pointer = digits; pointer != end; pointer++) {
write_char(*pointer);
}
}
template <class T>
std::enable_if_t<
internal::is_integral_v<T>
&& !std::is_same_v<std::remove_cv_t<T>, bool>
&& !std::is_same_v<std::remove_cv_t<T>, char>
>
write(T value) {
using Raw = std::remove_cv_t<T>;
using Unsigned = internal::make_unsigned_t<Raw>;
Unsigned magnitude;
if constexpr (internal::is_signed_v<Raw>) {
if (value < 0) {
write_char('-');
magnitude = Unsigned(0) - Unsigned(value);
} else {
magnitude = Unsigned(value);
}
} else {
magnitude = value;
}
if (magnitude == 0) {
write_char('0');
return;
}
unsigned chunks[16];
int count = 0;
while (magnitude >= 10000) {
const Unsigned quotient = magnitude / 10000;
chunks[count++] = unsigned(magnitude - quotient * 10000);
magnitude = quotient;
}
if (_capture == nullptr && _position > buffer_size - 64) flush();
char captured[64];
char* const begin = _capture != nullptr ? captured : _buffer + _position;
char* destination = begin;
const unsigned leading = unsigned(magnitude);
const char* first = digit_quads.data() + 4 * leading;
int skip = leading < 10 ? 3 : leading < 100 ? 2 : leading < 1000 ? 1 : 0;
for (; skip < 4; skip++) *destination++ = first[skip];
while (count--) {
const char* digits = digit_quads.data() + 4 * chunks[count];
std::memcpy(destination, digits, 4);
destination += 4;
}
if (_capture != nullptr) {
_capture->append(begin, destination - begin);
} else {
_position += int(destination - begin);
}
}
template <class T>
std::enable_if_t<
internal::has_val_method_v<T>
&& !internal::is_integral_v<T>
&& !internal::is_range_v<T>
>
write(const T& value) {
write(value.val());
}
template <class First, class Second>
void write(const std::pair<First, Second>& value) {
write(value.first);
write_char(' ');
write(value.second);
}
template <class Range>
std::enable_if_t<
internal::is_range_v<Range>
&& !internal::is_string_like_v<Range>
>
write(const Range& range) {
using StoredValue = internal::range_stored_value_t<const Range>;
constexpr bool nested = internal::is_range_v<StoredValue>
&& !internal::is_string_like_v<StoredValue>;
bool first = true;
for (const auto& value : range) {
if (!first) write_char(nested ? '\n' : _range_separator);
first = false;
if constexpr (std::is_same_v<StoredValue, bool> && !nested) {
write(static_cast<bool>(value));
} else {
write(value);
}
}
}
template <class First, class... Rest>
void print(const First& first, const Rest&... rest) {
write(first);
((write_char(' '), write(rest)), ...);
}
void println() {
write_char('\n');
}
void set_precision(int precision) {
_precision = precision;
}
void set_fixed(int precision = 6) {
_float_format = std::chars_format::fixed;
_precision = precision;
}
void set_general(int precision = 6) {
_float_format = std::chars_format::general;
_precision = precision;
}
void set_range_separator(char separator) {
_range_separator = separator;
}
template <class Matrix>
void write_aligned(const Matrix& matrix) {
using Row = internal::range_stored_value_t<const Matrix>;
using Cell = internal::range_stored_value_t<const Row>;
static_assert(internal::is_range_v<Row> && !internal::is_string_like_v<Row>,
"write_aligned requires a two-dimensional range");
static_assert(!internal::is_range_v<Cell> || internal::is_string_like_v<Cell>,
"write_aligned requires scalar cells");
write_aligned_matrix(matrix);
}
template <class Matrix>
void println_aligned(const Matrix& matrix) {
write_aligned(matrix);
write_char('\n');
}
template <class... Args>
void println(const Args&... args) {
print(args...);
write_char('\n');
}
template <class T>
FastOutput& operator<<(const T& value) {
write(value);
return *this;
}
};
} // namespace utilities
} // namespace m1une
#line 11 "verify/string/longest_common_extension.test.cpp"
namespace {
int naive_longest_common_extension(const std::string& text, int i, int j) {
int n = int(text.size());
int result = 0;
while (i + result < n && j + result < n && text[i + result] == text[j + result]) {
result++;
}
return result;
}
int sign(int value) {
if (value < 0) return -1;
if (value > 0) return 1;
return 0;
}
void test_fixed() {
std::string empty;
m1une::string::LongestCommonExtension<> empty_extension(empty);
assert(empty_extension.empty());
assert(empty_extension.longest_common_extension(0, 0) == 0);
assert(empty_extension.compare_suffix(0, 0) == 0);
assert(empty_extension.compare(0, 0, 0, 0) == 0);
assert(empty_extension.suffix_array().empty());
assert(empty_extension.rank().empty());
assert(empty_extension.lcp_array().empty());
std::string text = "banana";
m1une::string::LongestCommonExtension<> extension(text);
assert(extension.size() == 6);
assert(extension.sequence() == text);
assert(extension.longest_common_extension(1, 3) == 3);
assert(extension.longest_common_extension(2, 4) == 2);
assert(extension.longest_common_extension(0, 2) == 0);
assert(extension.longest_common_extension(6, 1) == 0);
assert(extension.longest_common_extension(2, 2) == 4);
assert(extension.longest_common_extension(1, 3, 2) == 2);
assert(extension.lcp(1, 3) == 3);
assert(extension(1, 3) == 3);
assert(extension.compare_suffix(1, 3) == 1);
assert(extension.compare_suffix(3, 1) == -1);
assert(extension.compare(1, 4, 3, 6) == 0);
assert(extension.compare(1, 5, 3, 6) == 1);
assert(extension.compare(0, 0, 1, 2) == -1);
std::vector<int> values;
values.push_back(2);
values.push_back(1);
values.push_back(2);
values.push_back(1);
values.push_back(2);
m1une::string::LongestCommonExtension<std::vector<int>> vector_extension(values);
assert(vector_extension.longest_common_extension(0, 2) == 3);
assert(vector_extension.longest_common_extension(1, 3) == 2);
assert(vector_extension.compare(0, 3, 2, 5) == 0);
}
void test_randomized() {
std::uint64_t state = 20240709;
auto random = [&state]() {
state ^= state << 7;
state ^= state >> 9;
return state;
};
for (int trial = 0; trial < 1500; trial++) {
int n = int(random() % 50);
std::string text(n, 'a');
for (char& character : text) character = char('a' + random() % 5);
m1une::string::LongestCommonExtension<> extension(text);
const std::vector<int>& suffixes = extension.suffix_array();
const std::vector<int>& rank = extension.rank();
for (int i = 0; i < n; i++) {
assert(0 <= suffixes[i] && suffixes[i] < n);
assert(rank[suffixes[i]] == i);
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
int expected = naive_longest_common_extension(text, i, j);
assert(extension.longest_common_extension(i, j) == expected);
int limit = int(random() % (n + 1));
assert(extension.longest_common_extension(i, j, limit) == std::min(expected, limit));
std::string suffix_i = text.substr(i);
std::string suffix_j = text.substr(j);
assert(extension.compare_suffix(i, j) == sign(suffix_i.compare(suffix_j)));
}
}
for (int query = 0; query < 200; query++) {
int l1 = int(random() % (n + 1));
int r1 = l1 + int(random() % (n - l1 + 1));
int l2 = int(random() % (n + 1));
int r2 = l2 + int(random() % (n - l2 + 1));
std::string first = text.substr(l1, r1 - l1);
std::string second = text.substr(l2, r2 - l2);
assert(extension.compare(l1, r1, l2, r2) == sign(first.compare(second)));
}
}
}
std::vector<int> combine_strings(const std::string& first, const std::string& second) {
std::vector<int> combined;
combined.reserve(first.size() + second.size() + 1);
for (unsigned char character : first) combined.push_back(int(character) + 2);
combined.push_back(1);
for (unsigned char character : second) combined.push_back(int(character) + 2);
return combined;
}
} // namespace
int main() {
m1une::utilities::FastInput fast_input;
m1une::utilities::FastOutput fast_output;
test_fixed();
test_randomized();
std::string first, second;
fast_input >> first >> second;
int n = int(first.size());
int m = int(second.size());
std::vector<int> combined = combine_strings(first, second);
m1une::string::LongestCommonExtension<std::vector<int>> extension(combined);
int best_first = 0;
int best_second = 0;
int best_length = 0;
const std::vector<int>& suffixes = extension.suffix_array();
for (int i = 0; i + 1 < int(suffixes.size()); i++) {
int a = suffixes[i];
int b = suffixes[i + 1];
bool a_first = a < n;
bool b_first = b < n;
bool a_second = n < a;
bool b_second = n < b;
if (a_first == b_first || a_second == b_second) continue;
if ((!a_first && !a_second) || (!b_first && !b_second)) continue;
int first_pos = a_first ? a : b;
int second_pos = a_first ? b - n - 1 : a - n - 1;
int length = extension.longest_common_extension(a, b);
length = std::min(length, n - first_pos);
length = std::min(length, m - second_pos);
if (length > best_length) {
best_length = length;
best_first = first_pos;
best_second = second_pos;
}
}
fast_output << best_first << ' ' << best_first + best_length << ' '
<< best_second << ' ' << best_second + best_length << '\n';
}
verify/string/longest_common_extension.test.cpp