#line 1 "test/aoj/2444/main.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2444"
#include <array>
#include <iostream>
#include <set>
#include <string>
#line 2 "Mylib/AlgebraicStructure/Monoid/pair.cpp"
#include <utility>
namespace haar_lib {
template <typename Monoid1, typename Monoid2>
struct pair_monoid {
using value_type = std::pair<typename Monoid1::value_type, typename Monoid2::value_type>;
const static Monoid1 M1;
const static Monoid2 M2;
value_type operator()() const {
return {M1(), M2()};
}
value_type operator()(const value_type &a, const value_type &b) const {
return {M1(a.first, b.first), M2(a.second, b.second)};
}
};
} // namespace haar_lib
#line 4 "Mylib/AlgebraicStructure/Monoid/rolling_hash.cpp"
namespace haar_lib {
namespace rolling_hash_monoid_impl {
template <int64_t Mod, int64_t Base>
struct internal_value {
int64_t hash, power;
internal_value() {}
internal_value(int64_t hash, int64_t power) : hash(hash), power(power) {}
internal_value(int64_t a) : hash(a % Mod), power(Base) {}
};
} // namespace rolling_hash_monoid_impl
template <int64_t Mod, int Base>
struct rolling_hash_monoid {
using value_type = rolling_hash_monoid_impl::internal_value<Mod, Base>;
value_type operator()() const {
value_type ret(0, 1);
return ret;
}
value_type operator()(const value_type &a, const value_type &b) const {
value_type ret;
ret.hash = (a.hash + b.hash * a.power % Mod) % Mod;
ret.power = a.power * b.power % Mod;
return ret;
}
};
} // namespace haar_lib
#line 2 "Mylib/DataStructure/SegmentTree/segment_tree.cpp"
#include <algorithm>
#include <cassert>
#include <functional>
#include <vector>
namespace haar_lib {
template <typename Monoid>
class segment_tree {
public:
using value_type = typename Monoid::value_type;
private:
Monoid M_;
int depth_, size_, hsize_;
std::vector<value_type> data_;
public:
segment_tree() {}
segment_tree(int n) : depth_(n > 1 ? 32 - __builtin_clz(n - 1) + 1 : 1),
size_(1 << depth_),
hsize_(size_ / 2),
data_(size_, M_()) {}
auto operator[](int i) const {
assert(0 <= i and i < hsize_);
return data_[hsize_ + i];
}
auto fold(int l, int r) const {
assert(0 <= l and l <= r and r <= hsize_);
value_type ret_left = M_();
value_type ret_right = M_();
int L = l + hsize_, R = r + hsize_;
while (L < R) {
if (R & 1) ret_right = M_(data_[--R], ret_right);
if (L & 1) ret_left = M_(ret_left, data_[L++]);
L >>= 1, R >>= 1;
}
return M_(ret_left, ret_right);
}
auto fold_all() const {
return data_[1];
}
void set(int i, const value_type &x) {
assert(0 <= i and i < hsize_);
i += hsize_;
data_[i] = x;
while (i > 1) i >>= 1, data_[i] = M_(data_[i << 1 | 0], data_[i << 1 | 1]);
}
void update(int i, const value_type &x) {
assert(0 <= i and i < hsize_);
i += hsize_;
data_[i] = M_(data_[i], x);
while (i > 1) i >>= 1, data_[i] = M_(data_[i << 1 | 0], data_[i << 1 | 1]);
}
template <typename T>
void init_with_vector(const std::vector<T> &val) {
data_.assign(size_, M_());
for (int i = 0; i < (int) val.size(); ++i) data_[hsize_ + i] = val[i];
for (int i = hsize_; --i >= 1;) data_[i] = M_(data_[i << 1 | 0], data_[i << 1 | 1]);
}
template <typename T>
void init(const T &val) {
init_with_vector(std::vector<value_type>(hsize_, val));
}
private:
template <bool Lower, typename F>
int bound(const int l, const int r, value_type x, F f) const {
std::vector<int> pl, pr;
int L = l + hsize_;
int R = r + hsize_;
while (L < R) {
if (R & 1) pr.push_back(--R);
if (L & 1) pl.push_back(L++);
L >>= 1, R >>= 1;
}
std::reverse(pr.begin(), pr.end());
pl.insert(pl.end(), pr.begin(), pr.end());
value_type a = M_();
for (int i : pl) {
auto b = M_(a, data_[i]);
if ((Lower and not f(b, x)) or (not Lower and f(x, b))) {
while (i < hsize_) {
const auto c = M_(a, data_[i << 1 | 0]);
if ((Lower and not f(c, x)) or (not Lower and f(x, c))) {
i = i << 1 | 0;
} else {
a = c;
i = i << 1 | 1;
}
}
return i - hsize_;
}
a = b;
}
return r;
}
public:
template <typename F = std::less<value_type>>
int lower_bound(int l, int r, value_type x, F f = F()) const {
return bound<true>(l, r, x, f);
}
template <typename F = std::less<value_type>>
int upper_bound(int l, int r, value_type x, F f = F()) const {
return bound<false>(l, r, x, f);
}
};
} // namespace haar_lib
#line 2 "Mylib/IO/input_tuples.cpp"
#include <initializer_list>
#line 4 "Mylib/IO/input_tuples.cpp"
#include <tuple>
#line 6 "Mylib/IO/input_tuple.cpp"
namespace haar_lib {
template <typename T, size_t... I>
static void input_tuple_helper(std::istream &s, T &val, std::index_sequence<I...>) {
(void) std::initializer_list<int>{(void(s >> std::get<I>(val)), 0)...};
}
template <typename T, typename U>
std::istream &operator>>(std::istream &s, std::pair<T, U> &value) {
s >> value.first >> value.second;
return s;
}
template <typename... Args>
std::istream &operator>>(std::istream &s, std::tuple<Args...> &value) {
input_tuple_helper(s, value, std::make_index_sequence<sizeof...(Args)>());
return s;
}
} // namespace haar_lib
#line 8 "Mylib/IO/input_tuples.cpp"
namespace haar_lib {
template <typename... Args>
class InputTuples {
struct iter {
using value_type = std::tuple<Args...>;
value_type value;
bool fetched = false;
int N, c = 0;
value_type operator*() {
if (not fetched) {
std::cin >> value;
}
return value;
}
void operator++() {
++c;
fetched = false;
}
bool operator!=(iter &) const {
return c < N;
}
iter(int N) : N(N) {}
};
int N;
public:
InputTuples(int N) : N(N) {}
iter begin() const { return iter(N); }
iter end() const { return iter(N); }
};
template <typename... Args>
auto input_tuples(int N) {
return InputTuples<Args...>(N);
}
} // namespace haar_lib
#line 11 "test/aoj/2444/main.test.cpp"
namespace hl = haar_lib;
int main() {
using Monoid1 = hl::rolling_hash_monoid<1000000007, 33>;
using Monoid2 = hl::rolling_hash_monoid<1000000007, 100>;
int n, m;
std::cin >> n >> m;
std::string s;
std::cin >> s;
hl::segment_tree<hl::pair_monoid<Monoid1, Monoid2>> seg(n);
for (int i = 0; i < n; ++i) {
seg.set(i, {Monoid1::value_type(s[i]), Monoid2::value_type(s[i])});
}
std::set<std::pair<int64_t, int64_t>> set;
int l = 0, r = 1;
for (int i = 0; i < m; ++i) {
std::string q;
std::cin >> q;
if (q[0] == 'L') {
if (q[1] == '+')
++l;
else
--l;
} else {
if (q[1] == '+')
++r;
else
--r;
}
auto t = seg.fold(l, r);
set.emplace(t.first.hash, t.second.hash);
}
std::cout << set.size() << "\n";
return 0;
}
test/aoj/2444/main.test.cpp
Segment tree
(Mylib/DataStructure/SegmentTree/segment_tree.cpp)