cp-library
競技プログラミング用 C++ ライブラリ
test/interval_set_predecessor.test.cpp
test/interval_set_predecessor.test.cpp · GitHub で見る
依存ライブラリ
コード
#define PROBLEM "https://judge.yosupo.jp/problem/predecessor_problem"
#include "data_structure/interval_set.hpp"
#include "components/fast_io.hpp"
#include <string_view>
int main() {
FastInput input;
FastOutput output;
int n = 0, q = 0; input.read(n); input.read(q);
std::string_view initial; input.read(initial);
std::vector<std::pair<int, int>> intervals;
for (int i = 0; i < n;) {
if (initial[i] == '0') { ++i; continue; }
int l = i;
while (i < n && initial[i] == '1') ++i;
intervals.emplace_back(l, i);
}
IntervalSet<int> set(std::move(intervals));
while (q--) {
int t = 0, k = 0; input.read(t); input.read(k);
if (t == 0) set.insert(k);
else if (t == 1) set.erase(k);
else if (t == 2) output.println(static_cast<int>(set.contains(k)));
else if (t == 3) output.println(set.next(k).value_or(-1));
else output.println(set.prev(k).value_or(-1));
}
}
#line 1 "test/interval_set_predecessor.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/predecessor_problem"
#line 1 "data_structure/interval_set.hpp"
#include <algorithm>
#include <cassert>
#include <cstddef>
#include <cstdint>
#include <initializer_list>
#include <iterator>
#include <limits>
#include <map>
#include <optional>
#include <type_traits>
#include <utility>
#include <vector>
template<class T = std::int64_t, class Size = std::conditional_t<
std::is_integral_v<T> && sizeof(T) <= 8, std::uint64_t,
std::conditional_t<std::is_same_v<T, __int128_t>, __uint128_t, T>>>
class IntervalSet {
static_assert(std::numeric_limits<T>::is_integer && !std::is_same_v<T, bool>);
static_assert(std::numeric_limits<Size>::is_integer && !std::is_same_v<Size, bool>);
std::map<T, T> ranges;
Size total = 0;
static Size length(const T &l, const T &r) {
return static_cast<Size>(r) - static_cast<Size>(l);
}
public:
using coordinate_type = T;
using size_type = Size;
using interval_type = std::pair<T, T>;
using const_iterator = typename std::map<T, T>::const_iterator;
using const_reverse_iterator = typename std::map<T, T>::const_reverse_iterator;
IntervalSet() = default;
explicit IntervalSet(std::vector<interval_type> intervals) { assign(std::move(intervals)); }
IntervalSet(std::initializer_list<interval_type> intervals) { assign(intervals); }
IntervalSet(const IntervalSet &) = default;
IntervalSet(IntervalSet &&other) noexcept(std::is_nothrow_constructible_v<Size, int> && std::is_nothrow_swappable_v<Size>) { swap(other); }
IntervalSet &operator=(IntervalSet other) noexcept(std::is_nothrow_swappable_v<Size>) { swap(other); return *this; }
void assign(std::vector<interval_type> intervals) {
std::sort(intervals.begin(), intervals.end());
IntervalSet result;
auto last = result.ranges.end();
for (auto [l, r] : intervals) {
assert(l <= r);
if (l == r) continue;
if (last != result.ranges.end() && l <= last->second) {
if (last->second < r) {
result.total += length(last->second, r);
last->second = r;
}
} else {
last = result.ranges.emplace_hint(result.ranges.end(), l, r);
result.total += length(l, r);
}
}
swap(result);
}
size_type insert(T l, T r) {
assert(l <= r);
if (l == r) return 0;
auto it = ranges.upper_bound(l);
if (it != ranges.begin() && std::prev(it)->second >= l) --it;
if (it == ranges.end() || it->first > r) {
ranges.emplace_hint(it, l, r);
auto added = length(l, r);
total += added;
return added;
}
if (it->first <= l && r <= it->second) return 0;
T left = (std::min)(l, it->first), right = (std::max)(r, it->second);
auto removed = length(it->first, it->second);
auto next_it = std::next(it);
while (next_it != ranges.end() && next_it->first <= right) {
right = (std::max)(right, next_it->second);
removed += length(next_it->first, next_it->second);
next_it = ranges.erase(next_it);
}
if (left == it->first) it->second = right;
else {
auto node = ranges.extract(it);
node.key() = left;
node.mapped() = right;
ranges.insert(next_it, std::move(node));
}
size_type added = length(left, right) - removed;
total += added;
return added;
}
size_type insert(T x) {
if constexpr (std::numeric_limits<T>::is_bounded) assert(x < (std::numeric_limits<T>::max)());
return insert(x, static_cast<T>(x + 1));
}
size_type erase(T l, T r) {
assert(l <= r);
if (l == r) return 0;
auto it = ranges.upper_bound(l);
if (it != ranges.begin() && std::prev(it)->second > l) --it;
size_type removed = 0;
if (it != ranges.end() && it->first < l) {
T right = it->second;
if (r < right) {
ranges.emplace_hint(std::next(it), r, right);
it->second = l;
removed = length(l, r);
total -= removed;
return removed;
}
removed = length(l, right);
it->second = l;
++it;
}
while (it != ranges.end() && it->first < r) {
if (r < it->second) {
removed += length(it->first, r);
auto hint = std::next(it);
auto node = ranges.extract(it);
node.key() = r;
ranges.insert(hint, std::move(node));
break;
}
removed += length(it->first, it->second);
it = ranges.erase(it);
}
total -= removed;
return removed;
}
size_type erase(T x) {
if constexpr (std::numeric_limits<T>::is_bounded)
if (x == (std::numeric_limits<T>::max)()) return 0;
return erase(x, static_cast<T>(x + 1));
}
const_iterator find(T x) const {
auto it = ranges.upper_bound(x);
if (it == ranges.begin()) return ranges.end();
--it;
return x < it->second ? it : ranges.end();
}
const_iterator lower_bound(T x) const {
auto it = ranges.upper_bound(x);
if (it != ranges.begin() && x < std::prev(it)->second) --it;
return it;
}
bool contains(T x) const { return find(x) != end(); }
bool contains(T l, T r) const {
assert(l <= r);
if (l == r) return true;
auto it = find(l);
return it != end() && r <= it->second;
}
bool intersects(T l, T r) const {
assert(l <= r);
if (l == r) return false;
auto it = lower_bound(l);
return it != end() && it->first < r;
}
size_type count(T l, T r) const {
assert(l <= r);
if (l == r) return 0;
size_type result = 0;
for (auto it = lower_bound(l); it != end() && it->first < r; ++it)
result += length((std::max)(l, it->first), (std::min)(r, it->second));
return result;
}
std::optional<T> next(T x) const {
auto it = lower_bound(x);
if (it == end()) return std::nullopt;
return (std::max)(x, it->first);
}
std::optional<T> prev(T x) const {
auto it = ranges.upper_bound(x);
if (it == ranges.begin()) return std::nullopt;
--it;
return (std::min)(x, static_cast<T>(it->second - 1));
}
T mex(T x = 0) const {
auto it = find(x);
return it == end() ? x : it->second;
}
std::optional<T> min() const {
if (empty()) return std::nullopt;
return begin()->first;
}
std::optional<T> max() const {
if (empty()) return std::nullopt;
return static_cast<T>(ranges.rbegin()->second - 1);
}
size_type size() const { return total; }
std::size_t interval_count() const { return ranges.size(); }
bool empty() const { return ranges.empty(); }
const_iterator begin() const { return ranges.begin(); }
const_iterator end() const { return ranges.end(); }
const_reverse_iterator rbegin() const { return ranges.rbegin(); }
const_reverse_iterator rend() const { return ranges.rend(); }
void clear() { ranges.clear(); total = 0; }
void swap(IntervalSet &other) noexcept(std::is_nothrow_swappable_v<Size>) {
ranges.swap(other.ranges);
using std::swap;
swap(total, other.total);
}
friend void swap(IntervalSet &a, IntervalSet &b) noexcept(noexcept(a.swap(b))) { a.swap(b); }
};
#line 1 "components/fast_io.hpp"
#line 5 "components/fast_io.hpp"
#include <array>
#include <bit>
#line 8 "components/fast_io.hpp"
#include <charconv>
#line 11 "components/fast_io.hpp"
#include <cstdio>
#include <cstring>
#include <memory>
#include <stdexcept>
#include <string>
#include <string_view>
#line 18 "components/fast_io.hpp"
#if defined(__unix__) || defined(__APPLE__)
#include <sys/mman.h>
#include <sys/stat.h>
#include <unistd.h>
#endif
namespace fast_io_detail { struct BulkInput; struct BulkOutput; }
class FastInput {
friend struct fast_io_detail::BulkInput;
static constexpr std::size_t capacity = 1 << 16;
FILE *file = nullptr;
std::unique_ptr<char[]> buffer;
const char *current = "", *end = current;
std::string scratch;
void *mapping = nullptr;
std::size_t mapped_size = 0;
bool refill() {
if (!file) return false;
std::size_t n = std::fread(buffer.get(), 1, capacity, file);
current = buffer.get();
end = current + n;
return n;
}
static const char *scan(const char *p, const char *end) {
while (end - p >= 8) {
std::uint64_t x;
std::memcpy(&x, p, 8);
if ((x - 0x2121212121212121ULL) & ~x & 0x8080808080808080ULL) break;
p += 8;
}
while (p != end && static_cast<unsigned char>(*p) > ' ') ++p;
return p;
}
public:
explicit FastInput(FILE *input = stdin) {
#if defined(__unix__) || defined(__APPLE__)
struct stat status;
int fd = fileno(input);
auto offset = ftello(input);
if (fd >= 0 && offset >= 0 && !fstat(fd, &status) && S_ISREG(status.st_mode) && status.st_size > offset) {
mapped_size = status.st_size;
mapping = mmap(nullptr, mapped_size, PROT_READ, MAP_PRIVATE, fd, 0);
if (mapping != MAP_FAILED) {
current = static_cast<const char *>(mapping) + offset;
end = static_cast<const char *>(mapping) + mapped_size;
return;
}
mapping = nullptr;
}
#endif
file = input;
buffer = std::make_unique_for_overwrite<char[]>(capacity);
}
explicit FastInput(std::string_view input) : current(input.empty() ? "" : input.data()), end(current + input.size()) {}
FastInput(const FastInput &) = delete;
FastInput &operator=(const FastInput &) = delete;
~FastInput() {
#if defined(__unix__) || defined(__APPLE__)
if (mapping) munmap(mapping, mapped_size);
#endif
}
std::string_view token() {
while (true) {
while (current != end && static_cast<unsigned char>(*current) <= ' ') ++current;
if (current != end) break;
if (!refill()) return {};
}
const char *begin = current;
current = scan(current, end);
if (current != end || !file) return {begin, std::size_t(current - begin)};
scratch.assign(begin, end);
while (refill()) {
current = scan(current, end);
scratch.append(buffer.get(), std::size_t(current - buffer.get()));
if (current != end) break;
}
return scratch;
}
template <class T>
bool read(T &value) {
if constexpr (std::is_integral_v<T> && !std::is_same_v<T, bool>) {
while (true) {
while (current != end && static_cast<unsigned char>(*current) <= ' ') ++current;
if (current != end) break;
if (!refill()) return false;
}
if constexpr (std::is_unsigned_v<T> && sizeof(T) == 4 && std::endian::native == std::endian::little) {
if (end - current >= 11) {
std::uint64_t x;
std::memcpy(&x, current, 8);
if (!(((x + 0x4646464646464646ULL) | (x - 0x3030303030303030ULL)) & 0x8080808080808080ULL)) {
x &= 0x0f0f0f0f0f0f0f0fULL;
x = (x * 10 + (x >> 8)) & 0x00ff00ff00ff00ffULL;
x = (x * 100 + (x >> 16)) & 0x0000ffff0000ffffULL;
std::uint64_t v = std::uint32_t(x * 10000 + (x >> 32));
int n = 8;
for (; n < 10 && static_cast<unsigned char>(current[n]) - unsigned('0') < 10; ++n)
v = v * 10 + (current[n] - '0');
if (static_cast<unsigned char>(current[n]) <= ' ' && v <= 0xffffffffULL) {
current += n;
value = T(v);
return true;
}
}
}
}
T parsed{};
auto result = std::from_chars(current, end, parsed);
if (result.ec == std::errc{} && (result.ptr != end ? static_cast<unsigned char>(*result.ptr) <= ' ' : !file)) {
current = result.ptr;
value = parsed;
return true;
}
}
auto s = token();
if (s.empty()) return false;
if constexpr (std::is_same_v<T, bool>) {
assert(s == "0" || s == "1");
value = s[0] == '1';
} else if constexpr (std::is_integral_v<T>) {
auto result = std::from_chars(s.data(), s.data() + s.size(), value);
assert(result.ec == std::errc{} && result.ptr == s.data() + s.size());
(void)result;
} else value = T(s);
return true;
}
};
class FastOutput {
friend struct fast_io_detail::BulkOutput;
inline static constexpr auto quads = [] {
std::array<std::array<char, 4>, 10000> table{};
for (int i = 0; i < 10000; ++i)
table[i] = {char('0' + i / 1000), char('0' + i / 100 % 10), char('0' + i / 10 % 10), char('0' + i % 10)};
return table;
}();
FILE *file;
std::unique_ptr<char[]> buffer = std::make_unique_for_overwrite<char[]>(1 << 16);
std::size_t capacity = 1 << 16, length = 0;
char *reserve(std::size_t n) {
if (n > capacity - length) {
if (!flush()) throw std::runtime_error("output failed");
if (n > capacity) {
std::size_t next = std::max(n, 2 * capacity);
buffer = std::make_unique_for_overwrite<char[]>(next);
capacity = next;
}
}
return buffer.get() + length;
}
public:
explicit FastOutput(FILE *output = stdout) : file(output) {}
FastOutput(const FastOutput &) = delete;
FastOutput &operator=(const FastOutput &) = delete;
~FastOutput() { flush(); }
bool flush() {
std::size_t offset = 0;
while (offset < length) {
auto n = std::fwrite(buffer.get() + offset, 1, length - offset, file);
if (!n) {
std::memmove(buffer.get(), buffer.get() + offset, length - offset);
length -= offset;
return false;
}
offset += n;
}
length = 0;
return std::fflush(file) == 0;
}
void write(char c) { *reserve(1) = c; ++length; }
void write(__uint128_t value) {
char digits[40];
char *end = digits + sizeof(digits), *begin = end;
do { *--begin = char('0' + value % 10); value /= 10; } while (value);
write(std::string_view(begin, end - begin));
}
void write(__int128_t value) {
__uint128_t magnitude = __uint128_t(value);
if (value < 0) write('-'), magnitude = 0 - magnitude;
write(magnitude);
}
void write(std::string_view s) {
char *out = reserve(s.size());
if (!s.empty()) std::memcpy(out, s.data(), s.size());
length += s.size();
}
template <class T> requires std::is_integral_v<T>
void write(T value) {
char *out = reserve(32);
if constexpr (std::is_same_v<T, bool>) *out = '0' + value, ++length;
else if constexpr (std::is_unsigned_v<T> && sizeof(T) == 4) {
char *p = out;
if (value >= 100000000) {
auto high = value / 100000000, low = value % 100000000;
p = std::to_chars(p, p + 2, high).ptr;
std::memcpy(p, quads[low / 10000].data(), 4);
std::memcpy(p + 4, quads[low % 10000].data(), 4);
p += 8;
} else if (value >= 10000) {
p = std::to_chars(p, p + 4, value / 10000).ptr;
std::memcpy(p, quads[value % 10000].data(), 4);
p += 4;
} else p = std::to_chars(p, p + 4, value).ptr;
length += p - out;
} else length += std::to_chars(out, out + 32, value).ptr - out;
}
template <class T> requires requires(const T &value, char *out) { value.decimal_capacity(); value.to_chars(out); }
void write(const T &value) {
char *out = reserve(value.decimal_capacity());
length += value.to_chars(out) - out;
}
template <class T>
void println(const T &value) { write(value); write('\n'); }
};
#line 5 "test/interval_set_predecessor.test.cpp"
int main() {
FastInput input;
FastOutput output;
int n = 0, q = 0; input.read(n); input.read(q);
std::string_view initial; input.read(initial);
std::vector<std::pair<int, int>> intervals;
for (int i = 0; i < n;) {
if (initial[i] == '0') { ++i; continue; }
int l = i;
while (i < n && initial[i] == '1') ++i;
intervals.emplace_back(l, i);
}
IntervalSet<int> set(std::move(intervals));
while (q--) {
int t = 0, k = 0; input.read(t); input.read(k);
if (t == 0) set.insert(k);
else if (t == 1) set.erase(k);
else if (t == 2) output.println(static_cast<int>(set.contains(k)));
else if (t == 3) output.println(set.next(k).value_or(-1));
else output.println(set.prev(k).value_or(-1));
}
}